Topic
Differential cryptanalysis
About: Differential cryptanalysis is a research topic. Over the lifetime, 2131 publications have been published within this topic receiving 54681 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: A new attack (called “gradient statistical”) on block ciphers is suggested and experimentally investigated and it is demonstrated the possibility of applying it to cipher for which no attacks are known except for the exhaustive key search.
Abstract: A new attack (called "gradient statistical") on block ciphers is suggested and experimentally investigated. We demonstrate the possibility of applying it to ciphers for which no attacks are known except for the exhaustive key search.
9 citations
25 Apr 2017
9 citations
06 Sep 2006
TL;DR: This investigation shows that the full 16-round Cobra-F64a can be broken by the related-key rectangle attack and that theFull 20-round Cobra-F 64b can be broke by therelated-key differential attack.
Abstract: Cobra-F64a and Cobra-F64b, designed for firmware-oriented applications, are 64-bit Data-dependent Permutation based block ciphers with 128 key bits, which consist of 16 and 20 rounds, respectively. In this paper, we investigate their security against related-key attacks. Our investigation shows that the full 16-round Cobra-F64a can be broken by our related-key rectangle attack and that the full 20-round Cobra-F64b can be broken by our related-key differential attack.
9 citations
TL;DR: In this paper, the authors formulated instances of a problem introduced by the differential cryptanalysis of Feistel cryptosystems as optimization tasks and studied the performance of Evolutionary Computation methods on these tasks.
9 citations
TL;DR: This paper proposes a new cryptanalytic technique, which is called the impossible boomerang attack, and describes an extension of this attack which applies in a related-key attack scenario, which matches the best currently known results for AES with 192/256 key bits.
Abstract: The Advanced Encryption Standard (AES) is a 128-bit block cipher with a user key of 128, 192 or 256 bits, released by NIST in 2001 as the next-generation data encryption standard for use in the USA. It was adopted as an ISO international standard in 2005. Impossible differential cryptanalysis and the boomerang attack are powerful variants of differential cryptanalysis for analysing the security of a block cipher. In this paper, building on the notions of impossible differential cryptanalysis and the boomerang attack, we propose a new cryptanalytic technique, which we call the impossible boomerang attack, and then describe an extension of this attack which applies in a related-key attack scenario. 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. In the two-key related-key attack scenario, our results, which were the first to achieve this amount of attacked rounds, match the best currently known results for AES with 192/256 key bits in terms of the numbers of attacked rounds. The (related-key) impossible boomerang attack is a general cryptanalytic technique, and can potentially be used to cryptanalyse other block ciphers.
9 citations