Multidimensional zero-correlation linear cryptanalysis of lightweight block cipher Piccolo-128

CRAFT is a lightweight block cipher, designed to provide efficient protection against differential fault attacks. It is a tweakable cipher that includes 32 rounds to produce a ciphertext from a 64-bit plaintext using a 128-bit key and 64-bit public tweak. In this paper, compared to the designers’ analysis, we provide a more detailed analysis of CRAFT against differential and zero-correlation cryptanalysis, aiming to provide better distinguishers for the reduced rounds of the cipher. Our distinguishers for reduced-round CRAFT cover a higher number of rounds compared to the designers’ analysis. In our analysis, we observed that, for any number of rounds, the differential effect of CRAFT has an extremely higher probability compared to any differential trail. As an example, while the best trail for 11 rounds of the cipher has a probability of at least 2−80, we present a differential with probability 2−49.79, containing 229.66 optimal trails, all with the same optimum probability of 2−80. Next, we use a partitioning technique, based on optimal expandable truncated trails to provide a better estimation of the differential effect on CRAFT. Thanks to this technique, we are able to find differential distinguishers for 9, 10, 11, 12, 13, and 14 rounds of the cipher in single tweak model with the probabilities of at least 2−40.20, 2−45.12, 2−49.79, 2−54.49, 2−59.13, and 2−63.80, respectively. These probabilities should be compared with the best distinguishers provided by the designers in the same model for 9 and 10 rounds of the cipher with the probabilities of at least 2−54.67 and 2−62.61, respectively. In addition, we consider the security of CRAFT against the new concept of related tweak zero-correlation (ZC) linear cryptanalysis and present a new distinguisher which covers 14 rounds of the cipher, while the best previous ZC distinguisher covered 13 rounds. Thanks to the related tweak ZC distinguisher for 14 rounds of the cipher, we also present 14 rounds integral distinguishers in related tweak mode of the cipher. Although the provided analysis does not compromise the cipher, we think it provides a better insight into the designing of CRAFT.

Download Full-text

Zero-correlation Linear Cryptanalysis of SAFER Block Cipher Family Using the Undisturbed Bits

The Computer Journal ◽

10.1093/comjnl/bxw086 ◽

2016 ◽

Cited By ~ 1

Author(s):

Wentan Yi ◽

Shaozhen Chen ◽

Yuchen Li

Keyword(s):

Block Cipher ◽

Linear Cryptanalysis ◽

Zero Correlation

Download Full-text

Improved Integral and Zero-correlation Linear Cryptanalysis of CLEFIA Block Cipher

Information Security and Cryptology - Lecture Notes in Computer Science ◽

10.1007/978-3-319-54705-3_3 ◽

2017 ◽

pp. 33-46 ◽

Cited By ~ 1

Author(s):

Wentan Yi ◽

Baofeng Wu ◽

Shaozhen Chen ◽

Dongdai Lin

Keyword(s):

Block Cipher ◽

Linear Cryptanalysis ◽

Zero Correlation

Download Full-text

Multidimensional zero-correlation linear cryptanalysis of the block cipher KASUMI

IET Information Security ◽

10.1049/iet-ifs.2014.0543 ◽

2016 ◽

Vol 10 (4) ◽

pp. 215-221 ◽

Cited By ~ 4

Author(s):

Wentan Yi ◽

Shaozhen Chen

Keyword(s):

Block Cipher ◽

Linear Cryptanalysis ◽

Zero Correlation

Download Full-text

Multiple differential-zero correlation linear cryptanalysis of reduced-round CAST-256

Journal of Mathematical Cryptology ◽

10.1515/jmc-2016-0054 ◽

2017 ◽

Vol 11 (2) ◽

Author(s):

Massoud Hadian Dehkordi ◽

Roghayeh Taghizadeh

Keyword(s):

Block Cipher ◽

Advanced Encryption Standard ◽

Linear Cryptanalysis ◽

Data Complexity ◽

Zero Correlation ◽

Key Block ◽

Symmetric Key ◽

Linear Attack

AbstractCAST-256 (or CAST6) is a symmetric-key block cipher published in June 1998. It was submitted as a candidate for Advanced Encryption Standard (AES). In this paper, we will propose a new chosen text attack, the multiple differential-zero correlation linear attack, to analyze the CAST-256 block cipher. Our attack is the best-known attack on CAST-256 according to the number of rounds without the weak-key assumption. We first construct a 30-round differential-zero correlation linear distinguisher. Based on the distinguisher, we propose a first 33-round attack on CAST-256 with data complexity of

Download Full-text

Cryptanalysis of the Lightweight Block Cipher BORON

Security and Communication Networks ◽

10.1155/2019/7862738 ◽

2019 ◽

Vol 2019 ◽

pp. 1-12 ◽

Cited By ~ 1

Author(s):

Huicong Liang ◽

Meiqin Wang

Keyword(s):

Block Cipher ◽

Security Analysis ◽

Third Party ◽

Linear Cryptanalysis ◽

Key Recovery ◽

Smt Solver ◽

Optimal Probability ◽

Lightweight Block Cipher ◽

Security Evaluations ◽

Key Recovery Attacks

This paper provides security evaluations of a lightweight block cipher called BORON proposed by Bansod et al. There is no third-party cryptanalysis towards BORON. Designers only provided coarse and simple security analysis. To fill this gap, security bounds of BORON against differential and linear cryptanalysis are presented in this paper. By automatic models based on the SMT solver STP, we search for differential and linear trails with the minimal number of active S-boxes and trails with optimal probability and bias. Then, we present key-recovery attacks towards round-reduced BORON. This paper is the first third-party cryptanalysis towards BORON.

Download Full-text

Multidimensional zero-correlation attacks on lightweight block cipher HIGHT: Improved cryptanalysis of an ISO standard

Information Processing Letters ◽

10.1016/j.ipl.2014.01.007 ◽

2014 ◽

Vol 114 (6) ◽

pp. 322-330 ◽

Cited By ~ 18

Author(s):

Long Wen ◽

Meiqin Wang ◽

Andrey Bogdanov ◽

Huaifeng Chen

Keyword(s):

Block Cipher ◽

Iso Standard ◽

Zero Correlation ◽

Lightweight Block Cipher ◽

Correlation Attacks

Download Full-text

Improving Highest Security Lightweight block cipher (HISEC) Algorithm Using Key Dependent S-box

Turkish Journal of Computer and Mathematics Education (TURCOMAT) ◽

10.17762/turcomat.v12i3.1630 ◽

2021 ◽

Vol 12 (3) ◽

pp. 3544-3549

Author(s):

Warkaa Salim Najm Et.al

Keyword(s):

Information Transmission ◽

Smart Card ◽

Block Cipher ◽

Critical Issue ◽

Linear Cryptanalysis ◽

Great Loss ◽

Wide Acceptance ◽

Transmission Of Information ◽

Lightweight Block Cipher ◽

Fixed Structure

Information security is considered as a very critical issue in the transmission of information. Therforelossing or threatening the information transmission will therefore be a great loss in the process of transmitting the information. Recently, Lightweight block cipher Algorithms have gained wide acceptance and it is used in restricted applications, such as electronic passport, smart card, etc. In this study, a modified HISEC algorithm is proposed to enhance and improve the original HISEC algorithm by introducing the concept of a key dependent S-box. This proposal algorithm aims to generate a safer block of code and solve the problem of the fixed structure of the used S-box that was a vulnerability for the attacker. It was an impenetrable barrier facing the attacks of the (Linear cryptanalysis) and (Differential Cryptanalysis). The proposed algorithm showed some improvements when comparing it to the orginal algorithm.

Download Full-text

Improved Impossible Differentials and Zero-Correlation Linear Hulls of New Structure III

Security and Communication Networks ◽

10.1155/2021/6515844 ◽

2021 ◽

Vol 2021 ◽

pp. 1-11

Author(s):

Jun He ◽

Xuan Shen ◽

Guoqiang Liu

Keyword(s):

Block Cipher ◽

Characteristic Matrix ◽

Linear Cryptanalysis ◽

The Core ◽

Round Function ◽

Linear Layer ◽

Zero Correlation ◽

Impossible Differential ◽

Impossible Differentials ◽

Impossible Differential Cryptanalysis

Impossible differential cryptanalysis and zero-correlation linear cryptanalysis are two kinds of most effective tools for evaluating the security of block ciphers. In those attacks, the core step is to construct a distinguisher as long as possible. In this paper, we focus on the security of New Structure III, which is a kind of block cipher structure with excellent resistance against differential and linear attacks. While the best previous result can only exploit one-round linear layer P to construct impossible differential and zero-correlation linear distinguishers, we try to exploit more rounds to find longer distinguishers. Combining the Miss-in-the-Middle strategy and the characteristic matrix method proposed at EUROCRYPT 2016, we could construct 23-round impossible differentials and zero-correlation linear hulls when the linear layer P satisfies some restricted conditions. To our knowledge, both of them are 1 round longer than the best previous works concerning the two cryptanalytical methods. Furthermore, to show the effectiveness of our distinguishers, the linear layer of the round function is specified to the permutation matrix of block cipher SKINNY which was proposed at CRYPTO 2016. Our results indicate that New Structure III has weaker resistance against impossible differential and zero-correlation linear attacks, though it possesses good differential and linear properties.

Download Full-text