Truncated Differential Attacks on 8-Round CRYPTON

Author(s):  
Jongsung Kim ◽  
Seokhie Hong ◽  
Sangjin Lee ◽  
Junghwan Song ◽  
Hyungjin Yang
2012 ◽  
Vol 53 (1) ◽  
pp. 189-199
Author(s):  
Victor Ruzhentsev ◽  
Victor Dolgov

ABSTRACT The strength of Rijndael-like ciphers to the truncated differential attack is considered. Theorems about the absence of effective truncated (byte) differential characteristics and effective truncated (byte) differentials for ciphers with sufficient number of rounds are proved.


2015 ◽  
Vol 52 (2) ◽  
pp. 246-254 ◽  
Author(s):  
Nicolas T. Courtois ◽  
Theodosis Mourouzis ◽  
Anna Grocholewska-Czuryło ◽  
Jean-Jacques Quisquater

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.


Author(s):  
Jin HOKI ◽  
Kosei SAKAMOTO ◽  
Fukang LIU ◽  
Kazuhiko MINEMATSU ◽  
Takanori ISOBE

2018 ◽  
Vol 87 (2-3) ◽  
pp. 225-247 ◽  
Author(s):  
Roberto Civino ◽  
Céline Blondeau ◽  
Massimiliano Sala

Cryptanalysis is a very important challenge that faces cryptographers. It has several types that should be well studied by cryptographers to be able to design cryptosystem more secure and able to resist any type of attacks. This paper introduces six types of attacks: Linear, Differential , Linear-Differential, Truncated differential Impossible differential attack and Algebraic attacks. In this paper, algebraic attack is used to formulate the substitution box(S-box) of a block cipher to system of nonlinear equations and solve this system by using a classical method called Grobner  Bases . By Solving these equations, we made algebraic attack on S-box.


Sign in / Sign up

Export Citation Format

Share Document