نتایج جستجو برای: secret disclosure attack

تعداد نتایج: 121525  

Journal: :IACR Cryptology ePrint Archive 2010
Piotr Mroczkowski Janusz Szmidt

In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain128, reduced variants of the block ciphers Serpent and CTC and to a reduced version of the keyed hash function MD6. Independently a very similar attack named AIDA was introduced by M. Vielhaber. In this...

Journal: :IACR Cryptology ePrint Archive 2011
Piotr Mroczkowski Janusz Szmidt

In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain128, reduced variants of the block ciphers Serpent and CTC and to a reduced version of the keyed hash function MD6. Independently a very similar attack named AIDA was introduced by M. Vielhaber. In this...

2015
Elialilia S. Okello Glenn J. Wagner Bonnie Ghosh-Dastidar Jeffrey Garnett Dickens Akena Noeline Nakasujja Seggane Musisi

Purpose: There is extensive evidence regarding the relationship between HIV related stigma and disclosure; however, the influence of depression in this relationship is not well understood, and thus is the focus of our analysis. Methods: Baseline data from a prospective longitudinal cohort of 798 HIV patients starting ART in Kampala, Uganda were examined. A staged-approach regression analysis wa...

2015
Masoumeh Safkhani Mehdi Hosseinzadeh Mojtaba Eslamnezhad Namin Samad Rostampour Nasour Bagheri

Recently,Wang et al. analyzed the security of two EPC C1-G2 compliant RFID authentication protocols, called RAPLT and SRP, and proved that these protocols are vulnerable against de-synchronization and secret disclosure attacks. The time complexity of their attacks were O(2). In addition, they proposed an improved version of SRP entitled SRP, for which they claim the security would be O(2). Howe...

Journal: :IACR Cryptology ePrint Archive 2015
Masoumeh Safkhani Nasour Bagheri Mehdi Hosseinzadeh Mojtaba Eslamnezhad Namin Samad Rostampour

Recently,Wang et al. analyzed the security of two EPC C1-G2 compliant RFID authentication protocols, called RAPLT and SRP, and proved that these protocols are vulnerable against de-synchronization and secret disclosure attacks. The time complexity of their attacks were O(2). In addition, they proposed an improved version of SRP entitled SRP, for which they claim the security would be O(2). Howe...

2009
Adi Akavia Shafi Goldwasser Vinod Vaikuntanathan

This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the “memory attack”, was proposed recently. In this attack, a significant fraction of the bits of a secret key of a cryptographic algorithm can be measured by an adversary if the secret key is ever stored in a part of memory...

2007
Eli Biham Orr Dunkelman Nathan Keller

The slide attack is applicable to ciphers that can be represented as an iterative application of the same keyed permutation. The slide attack leverages simple attacks on the keyed permutation to more complicated (and time consuming) attacks on the entire cipher. In this paper we extend the slide attack by examining the cycle structures of the entire cipher and of the underlying keyed permutatio...

2012
Qiang Zhang Xianglian Xue Xiaopeng Wei

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the...

2003
Roman Novak

Differential Power Analysis (DPA) by Paul Kocher et al. is expanded with the information that is hidden in the sign of power biases. The latter reveal values that collide with the DPA target value within the circuitry. With the help of cross-iteration comparisons, the interpretation of those values can provide significant amounts of the information required to reverse engineer secret algorithm....

Journal: :I. J. Network Security 2008
Zuhua Shao

To enhance the efficiency of threshold group signature schemes, Yu and Chen, recently, proposed an efficient threshold group signature scheme. By using elliptic curves, the proposed scheme can use short secret key and reduces the load of signature verification. However, in this paper we find that there are many ambiguities in the proposed scheme. The verifiers cannot verify valid signatures, wh...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید