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

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

Comprehensive security analysis of CRAFT

IACR Transactions on Symmetric Cryptology ◽

10.46586/tosc.v2019.i4.290-317 ◽

2020 ◽

pp. 290-317

Author(s):

Hosein Hadipour ◽

Sadegh Sadeghi ◽

Majid M. Niknam ◽

Ling Song ◽

Nasour Bagheri

Keyword(s):

Detailed Analysis ◽

Differential Effect ◽

Block Cipher ◽

Security Analysis ◽

Linear Cryptanalysis ◽

Zero Correlation ◽

Efficient Protection ◽

Lightweight Block Cipher ◽

Insight Into ◽

Partitioning Technique

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

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 linear cryptanalysis of lightweight block cipher Piccolo-128

Security and Communication Networks ◽

10.1002/sec.1644 ◽

2016 ◽

Vol 9 (17) ◽

pp. 4520-4535 ◽

Cited By ~ 1

Author(s):

Li-shi Fu ◽

Chen-hui Jin ◽

Xin-ran Li

Keyword(s):

Block Cipher ◽

Linear Cryptanalysis ◽

Zero Correlation ◽

Lightweight Block Cipher

Download Full-text

Protecting lightweight block cipher implementation in mobile big data computing

Peer-to-Peer Networking and Applications ◽

10.1007/s12083-016-0481-0 ◽

2016 ◽

Vol 11 (2) ◽

pp. 252-264

Author(s):

Weidong Qiu ◽

Bozhong Liu ◽

Can Ge ◽

Lingzhi Xu ◽

Xiaoming Tang ◽

...

Keyword(s):

Big Data ◽

Block Cipher ◽

Mobile Big Data ◽

Lightweight Block Cipher ◽

Big Data Computing

Download Full-text

Eight-sided fortress: a lightweight block cipher

The Journal of China Universities of Posts and Telecommunications ◽

10.1016/s1005-8885(14)60275-2 ◽

2014 ◽

Vol 21 (1) ◽

pp. 104-128

Author(s):

Xuan LIU ◽

Wen-ying ZHANG ◽

Xiang-zhong LIU ◽

Feng LIU

Keyword(s):

Block Cipher ◽

Lightweight Block Cipher

Download Full-text

Crypto-Archaeology: unearthing design methodology of DES s-boxes

10.7287/peerj.preprints.3285v1 ◽

2017 ◽

Author(s):

Sankhanil Dey ◽

Ranjan Ghosh

Keyword(s):

Boolean Function ◽

Boolean Functions ◽

Design Methodology ◽

Block Cipher ◽

Block Ciphers ◽

Public Domain ◽

Differential Cryptanalysis ◽

Linear Cryptanalysis ◽

Strict Avalanche Criterion ◽

Independence Criterion

US defence sponsored the DES program in 1974 and released it in 1977. It remained as a well-known and well accepted block cipher until 1998. Thirty-two 4-bit DES S-Boxes are grouped in eight each with four and are put in public domain without any mention of their design methodology. S-Boxes, 4-bit, 8-bit or 32-bit, find a permanent seat in all future block ciphers. In this paper, while looking into the design methodology of DES S-Boxes, we find that S-Boxes have 128 balanced and non-linear Boolean Functions, of which 102 used once, while 13 used twice and 92 of 102 satisfy the Boolean Function-level Strict Avalanche Criterion. All the S-Boxes satisfy the Bit Independence Criterion. Their Differential Cryptanalysis exhibits better results than the Linear Cryptanalysis. However, no S-Boxes satisfy the S-Box-level SAC analyses. It seems that the designer emphasized satisfaction of Boolean-Function-level SAC and S-Box-level BIC and DC, not the S-Box-level LC and SAC.

Download Full-text