Filters








5,826 Hits in 5.6 sec

Distinguisher and Related-Key Attack on the Full AES-256 [chapter]

Alex Biryukov, Dmitry Khovratovich, Ivica Nikolić
2009 Lecture Notes in Computer Science  
AES-128, AES-192 and AES-256 represents the encryption key sizes (128 bits, 192 bits and 256 bits) and in their number of rounds (10, 12, and 14, respectively) required to open the vault that is wrapped  ...  In this paper, the files are encrypted and stored in the disk by using a secret key and asking for the same secret key while decrypting.  ...  Other than this, there are few other attacks which proves DES algorithm insecure are one round attack, full 16-round attack and Meet-in-the-middle attack EXISTING SYSTEM The necessity of providing security  ... 
doi:10.1007/978-3-642-03356-8_14 fatcat:zob5affnivgjpkto5uh5axdeoi

Related-tweakey impossible differential attack on reduced-round Deoxys-BC-256

Rui Zong, Xiaoyang Dong, Xiaoyun Wang
2019 Science China Information Sciences  
Based on this distinguisher, we mount a key-recovery attack on 10 (out of 14) rounds of Deoxys-BC-256.  ...  Compared to previous results that are valid only when the key size > 204 and the tweak size < 52, our method can attack 10-round Deoxys-BC-256 as long as the key size 174 and the tweak size 82.  ...  F . 3 Attack on Deoxys-BC-256 Longer related-key impossible distinguisher In this subsection, we explain the process of extending a single-key impossible differential to a longer related-key impossible  ... 
doi:10.1007/s11432-017-9382-2 fatcat:ahnnhe4na5hsjkqkcz2uq7zao4

The (related-key) impossible boomerang attack and its application to the AES block cipher

Jiqiang Lu
2010 Designs, Codes and Cryptography  
Finally, we apply the impossible boomerang attack to break 6-round AES with 128 key bits and 7-round AES with 192/256 key bits, and using two related keys we apply the related-key impossible boomerang  ...  attack to break 8-round AES with 192 key bits and 9-round AES with 256 key bits.  ...  Chris Mitchell and the anonymous referees for their comments on earlier versions of this paper, and also very grateful to the editor for his/her editorial efforts during the review of this paper.  ... 
doi:10.1007/s10623-010-9421-9 fatcat:k6fj2orwjvaw5kuh4n6rutfboi

Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds [chapter]

Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, Adi Shamir
2010 Lecture Notes in Computer Science  
One of our attacks uses only two related keys and 2 39 time to recover the complete 256-bit key of a 9-round version of AES-256 (the best previous attack on this variant required 4 related keys and 2 120  ...  Another attack can break a 10-round version of AES-256 in 2 45 time, but it uses a stronger type of related subkey attack (the best previous attack on this variant required 64 related keys and 2 172 time  ...  Attacks on Other Variants of AES-256 A Related-Key Distinguisher for 8 Rounds The basic distinguishing attack in this case uses the simplified 8-round differential presented in Section 4.1.1.  ... 
doi:10.1007/978-3-642-13190-5_15 fatcat:imjhqrpk6zb6dgsjzgcmtdwfyq

Collision Attacks on AES-192/256, Crypton-192/256, mCrypton-96/128, and Anubis

Jinkeon Kang, Kitae Jeong, Jaechul Sung, Seokhie Hong, Kyungho Lee
2013 Journal of Applied Mathematics  
Applying our attacks on AES-192/256, we improve the attack result based on meet-in-the-middle attack (AES-192) and the attack result proposed in AES'00 (AES-256), respectively.  ...  At AES'00, a collision attack on 7-round reduced AES was proposed. In this paper, we apply this idea to seven SPN block ciphers, AES-192/256, Crypton-192/256, mCrypton-96/128, and Anubis.  ...  Though our attacks on them are not applicable to the full AES-192/256, these are superior to the attack results of [1] (AES-192) and [3] (AES-256), respectively.  ... 
doi:10.1155/2013/713673 fatcat:7fstfqvh75ghnoakqydnnb7gem

Related-Key Boomerang Attack on Block Cipher SQUARE

Bonwook KOO, Yongjin YEOM, Junghwan SONG
2011 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
In this paper, we present a key recovery attack on the full round of Square using a related-key boomerang distinguisher.  ...  By extending of this related-key differential, we construct a 7-round related-key boomerang distinguisher and successful attack on full round Square.  ...  Attacks on AES-192 and AES-256 [4] [5] [6] have been discussed and those attacks are based on the related-key model [1] .  ... 
doi:10.1587/transfun.e94.a.3 fatcat:rzdmmzdgmnexngetbccacinhde

Faster Chosen-Key Distinguishers on Reduced-Round AES [chapter]

Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean
2012 Lecture Notes in Computer Science  
This model is related to the known-key setting, where the adversary receives a key k, and tries to find a pair of messages (m, m ′ ) that has some property more efficiently than generic attacks.  ...  We have checked our results experimentally and we extend them to distinguisers of AES-256.  ...  On AES-128, we show efficient distinguishers for versions reduced to seven and eight rounds, and verified in practice that they indeed work by implementing the actual attacks.  ... 
doi:10.1007/978-3-642-34931-7_14 fatcat:k6iy5wvxfrbhvavq4qzzb7uxjy

EAES: Extended Advanced Encryption Standard with Extended Security

Abul Kalam Azad, Md. Yamin Mollah
2018 Advances in Science, Technology and Engineering Systems  
Basically, this algorithm takes one cipher key and divides the selected key of two separate sub-keys: FirstKey and SecondKey. Then expand them through two different key expansion schedules.  ...  Though AES is the highest secure symmetric cipher at present, many attacks are now effective against AES too which is seen from the review of recent attacks of AES.  ...  Strength Against Different Attacks Several cryptanalysis attacks such as linear attack, algebraic attack, SAT-solver and hybrid attack, Side channel attack, distinguishing and related-keys attack revised  ... 
doi:10.25046/aj030307 fatcat:vnbmi2qunjayzm5432y4g5g3ae

Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others [chapter]

Alex Biryukov, Ivica Nikolić
2010 Lecture Notes in Computer Science  
We use the optimal differential characteristics to design the best related-key and chosen key attacks on AES-128 (7 out of 10 rounds), AES-192 (full 12 rounds), byte-Camellia (full 18 rounds) and Khazad  ...  We also show that ciphers FOX and Anubis have no related-key attacks on more than 4-5 rounds.  ...  In [9] , boomerang attacks on full-round AES-192 and AES-256 were shown. AES is an SPN cipher.  ... 
doi:10.1007/978-3-642-13190-5_17 fatcat:iz6eqelxtbbmtg25pjrprvprkq

An overview of cryptanalysis research for the advanced encryption standard

Alan Kaminsky, Michael Kurdziel, Stanislaw Radziszowski
2010 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE  
This paper provides an overview of current cryptanalysis research on the AES cryptographic algorithm.  ...  As such, AES is now authorized to protect classified and unclassified national security systems and information.  ...  A successful related-key attack may then break the hash function. In 2009, Biryukov et al. [49] published related-key attacks on full-strength AES-192 and AES-256.  ... 
doi:10.1109/milcom.2010.5680130 fatcat:zlylkf7vnzfjzclw3atqshp6l4

Integral and Multidimensional Linear Distinguishers with Correlation Zero [chapter]

Andrey Bogdanov, Gregor Leander, Kaisa Nyberg, Meiqin Wang
2012 Lecture Notes in Computer Science  
These observations provide new insight into zero-correlation cryptanalysis which is illustrated by attacking a Skipjack variant and round-reduced CAST-256 without weak key assumptions.  ...  In this paper, we reveal fundamental links of zero-correlation distinguishers to integral distinguishers and multidimensional linear distinguishers.  ...  Our multidimensional zero-correlation attack is the first attack on more than half of the full-round AES-candidate CAST-256 without the weak key assumption.  ... 
doi:10.1007/978-3-642-34961-4_16 fatcat:o4lavhs4ujebbniqgeb6dcgwa4

Boomerang Switch in Multiple Rounds. Application to AES Variants and Deoxys

Haoyang Wang, Thomas Peyrin
2019 IACR Transactions on Symmetric Cryptology  
In order to illustrate the power of this technique, we propose a new related-key attack on 10-round AES-256 which requires only 2 simple related-keys and 275 computations.  ...  This is a much more realistic scenario than the state-of-the-art 10-round AES-256 attacks, where subkey oracles, or several related-keys and high computational power is needed.  ...  Acknowledgments The authors would like to thank the anonymous referees for their helpful comments. The authors are supported by Temasek Labs (DSOCL16194).  ... 
doi:10.46586/tosc.v2019.i1.142-169 fatcat:ob2ec3fvendd5k7oxsv7g7zfdu

Boomerang Switch in Multiple Rounds. Application to AES Variants and Deoxys

Haoyang Wang, Thomas Peyrin
2019 IACR Transactions on Symmetric Cryptology  
In order to illustrate the power of this technique, we propose a new related-key attack on 10-round AES-256 which requires only 2 simple related-keys and 275 computations.  ...  This is a much more realistic scenario than the state-of-the-art 10-round AES-256 attacks, where subkey oracles, or several related-keys and high computational power is needed.  ...  Acknowledgments The authors would like to thank the anonymous referees for their helpful comments. The authors are supported by Temasek Labs (DSOCL16194).  ... 
doi:10.13154/tosc.v2019.i1.142-169 dblp:journals/tosc/WangP19 fatcat:eneb573uwbgnbkekj3aw2i4rse

Cryptanalysis on Block Ciphers [chapter]

2015 Security of Block Ciphers  
Many thanks go to the administrative and technical staff at the department and the university for their support. I am highly impressed by their understanding and high-quality services.  ...  Special thanks go to my wife Xiaoyan Yan for her support, who had to get accustomed to a rather different culture, has experienced and is still to experience every moment of my happiness and sadness.  ...  attack on 13-round reduced Camellia when used with 256 key bits. • A related-key rectangle attack on the full Cobra-F64a, and a related-key differential attack on the full Cobra-F64b. • A related-key  ... 
doi:10.1002/9781118660027.ch4 fatcat:zv7gnyul4rgrzhdvmzodgvarxa

Related-Key Cryptanalysis of the Full AES-192 and AES-256 [chapter]

Alex Biryukov, Dmitry Khovratovich
2009 Lecture Notes in Computer Science  
In this paper we present two related-key attacks on the full AES.  ...  For AES-256 we show the first key recovery attack that works for all the keys and has 2 99.5 time and data complexity, while the recent attack by Biryukov-Khovratovich-Nikolić works for a weak key class  ...  The authors thank Vincent Rijmen and anonymous reviewers for their valuable comments, which helped to improve the paper.  ... 
doi:10.1007/978-3-642-10366-7_1 fatcat:usu7322stzfd5aukip23yskwxy
« Previous Showing results 1 — 15 out of 5,826 results