scholarly journals Protecting Against Multidimensional Linear and Truncated Differential Cryptanalysis by Decorrelation

2015 ◽  
pp. 73-91 ◽  
Author(s):  
Céline Blondeau ◽  
Aslı Bay ◽  
Serge Vaudenay
Keyword(s):  
Differential Cryptanalysis ◽  
Multidimensional Linear ◽  
Truncated Differential

Truncated differential cryptanalysis of PRINCE

2015 ◽  
Vol 8 (16) ◽  
pp. 2875-2887 ◽  
Author(s):  
Guangyao Zhao ◽  
Bing Sun ◽  
Chao Li ◽  
Jinshu Su
Keyword(s):  
Differential Cryptanalysis ◽  
Truncated Differential

Algebraic Truncated Differential Cryptanalysis of 5-Round Salsa20

2013 ◽  
Vol 24 (5) ◽  
pp. 1111-1126
Author(s):  
Jie GUAN ◽  
Zhong-Ya ZHANG
Keyword(s):  
Differential Cryptanalysis ◽  
Truncated Differential

Truncated Differential Cryptanalysis of Camellia

2002 ◽  
pp. 32-38 ◽  
Author(s):  
Seonhee Lee ◽  
Seokhie Hong ◽  
Sangjin Lee ◽  
Jongin Lim ◽  
Seonhee Yoon
Keyword(s):  
Differential Cryptanalysis ◽  
Truncated Differential

On optimal size in truncated differential attacks

2015 ◽  
Vol 52 (2) ◽  
pp. 246-254 ◽  
Author(s):  
Nicolas T. Courtois ◽  
Theodosis Mourouzis ◽  
Anna Grocholewska-Czuryło ◽  
Jean-Jacques Quisquater
Keyword(s):  
Block Cipher ◽  
Ad Hoc ◽  
Differential Cryptanalysis ◽  
Optimal Size ◽  
Potential Space ◽  
Differential Attack ◽  
Pass Through ◽  
Differential Attacks ◽  
Differential Properties ◽  
Truncated Differential

Differential Cryptanalysis (DC) is one of the oldest known attacks on block ciphers. DC is based on tracking of changes in the differences between two messages as they pass through the consecutive rounds of encryption. However DC remains very poorly understood. In his textbook written in the late 1990s Schneier wrote that against differential cryptanalysis, GOST is “probably stronger than DES”. In fact Knudsen have soon proposed more powerful advanced differential attacks however the potential space of such attacks is truly immense. To this day there is no method which allows to evaluate the security of a cipher against such attacks in a systematic way. Instead, attacks are designed and improved in ad-hoc ways with heuristics [6–13,21]. The best differential attack known has time complexity of 2179 [13]. In this paper we show that for a given block cipher there exists an optimal size for advanced differential properties. This new understanding allows to considerably reduce the space to be searched for “good” truncated differential properties suitable for an attack.

Sign in / Sign up

Export Citation Format

Share Document