Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA

Song, Ling; Huang, Zhiyan; Yang, Qianqian

doi:10.1007/978-3-319-40367-0_24

Cited by 68 publications

(45 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Speck-64. Song et al [44] presented 20-round attacks on Speck-64 by constructing a distinguisher from two short characteristics where they concatenated the two characteristics to a 15-round characteristic with probability 2 −60.56 . The distinguishers used in the attack are already based on differentials and the differentials we found do not lead to any improvement.…”

Section: Application Of the Differential Gaps To The Best Published Dmentioning

confidence: 99%

See 1 more Smart Citation

Mind the Gap - A Closer Look at the Security of Block Ciphers against Differential Cryptanalysis

Ankele

Kölbl

2019

Selected Areas in Cryptography – SAC 2018

View full text Add to dashboard Cite

Resistance against differential cryptanalysis is an important design criteria for any modern block cipher and most designs rely on finding some upper bound on probability of single differential characteristics. However, already at EUROCRYPT'91, Lai et al. comprehended that differential cryptanalysis rather uses differentials instead of single characteristics. In this paper, we consider exactly the gap between these two approaches and investigate this gap in the context of recent lightweight cryptographic primitives. This shows that for many recent designs like Midori, Skinny or Sparx one has to be careful as bounds from counting the number of active S-boxes only give an inaccurate evaluation of the best differential distinguishers. For several designs we found new differential distinguishers and show how this gap evolves. We found an 8-round differential distinguisher for Skinny-64 with a probability of 2 −56.93 , while the best single characteristic only suggests a probability of 2 −72. Our approach is integrated into publicly available tools and can easily be used when developing new cryptographic primitives. Moreover, as differential cryptanalysis is critically dependent on the distribution over the keys for the probability of differentials, we provide experiments for some of these new differentials found, in order to confirm that our estimates for the probability are correct. While for Skinny-64 the distribution over the keys follows a Poisson distribution, as one would expect, we noticed that Speck-64 follows a bimodal distribution, and the distribution of Midori-64 suggests a large class of weak keys.

show abstract

Section: Application Of the Differential Gaps To The Best Published Dmentioning

confidence: 99%

“…The best differentials for Simon-64 reach 23 rounds with 2 −63.91[39] 10. The best differentials for Speck-64 reach 15 rounds with 2 −60.56[44].…”

mentioning

confidence: 99%

Mind the Gap - A Closer Look at the Security of Block Ciphers against Differential Cryptanalysis

Ankele

Kölbl

2019

Selected Areas in Cryptography – SAC 2018

View full text Add to dashboard Cite

show abstract

“…end for (8) if b � 1 then //determining the connection status generated by the upper subblock. (9) Cw…”

Section: Improved Automatic Search Algorithmmentioning

confidence: 99%

“…Until now, cryptanalysis on ARX ciphers is still not well understood as S-box-based ciphers, and the security analysis on them are relatively lagging behind [8]. Linear cryptanalysis is very important for evaluating the security margin of symmetric cryptographic primitives [9,10].…”

Section: Introductionmentioning

confidence: 99%

Automatic Search for the Linear (Hull) Characteristics of ARX Ciphers: Applied to SPECK, SPARX, Chaskey, and CHAM-64

Huang

Wang

2020

Security and Communication Networks

View full text Add to dashboard Cite

Linear cryptanalysis is an important evaluation method for cryptographic primitives against key recovery attack. In this paper, we revisit the Walsh transformation for linear correlation calculation of modular addition, and an efficient algorithm is proposed to construct the input-output mask space of specified correlation weight. By filtering out the impossible large correlation weights in the first round, the search space of the first round can be substantially reduced. We introduce a concept of combinational linear approximation table (cLAT) for modular addition with two inputs. When one input mask is fixed, another input mask and the output mask can be obtained by the Splitting-Lookup-Recombination approach. We first split the n-bit fixed input mask into several subvectors and then find the corresponding bits of other masks, and in the recombination phase, pruning conditions can be used. By this approach, a large number of search branches in the middle rounds can be pruned. With the combination of the optimization strategies and the branch-and-bound search algorithm, we can improve the search efficiency for linear characteristics on ARX ciphers. The linear hulls for SPECK32/48/64 with a higher average linear potential (ALP) than existing results have been obtained. For SPARX variants, an 11-round linear trail and a 10-round linear hull have been found for SPARX-64 and a 10-round linear trail and a 9-round linear hull are obtained for SPARX-128. For Chaskey, a 5-round linear trail with a correlation of 2−61 has been obtained. For CHAM-64, 34/35-round optimal linear characteristics with a correlation of 2−31/2−33 are found.

show abstract

“…Speck applies simple round functions due to which its code size is very small. There exist differential attacks targeting 19 rounds out of 26 in SPECK-64/96 and 20 rounds out of 27 in Speck-64/128 [16]. SIMON cipher with a block size of 128-bit is comparable with LEA, LEA's performance exceeds that of SIMON in both 32-bit and 64-bit processors.…”

Section: Related Workmentioning

confidence: 99%

Performance Evaluation of Newly Proposed Lightweight Cipher, BRIGHT

Sehrawat¹,

Gill²

2019

IJIES

View full text Add to dashboard Cite

Lightweight security algorithms are tailored for resource-constrained environment. To improve the efficiency of an algorithm, usually, a tradeoff is involved in lightweight cryptography in terms of its memory requirements and speed. By adopting several performance enhancement techniques, a security framework for IoT enabled applications is presented in this paper. Proposed BRIGHT family of ciphers is comparably better than existing lightweight ciphers and support a range of block and key sizes for constraint environment. It enables users to match their security needs with application requirements by supporting a range of cryptographic solutions. The BRIGHT family of ciphers is a software-oriented design. The performance of BRIGHT family of lightweight ciphers is evaluated on different parameters. All versions of BRIGHT family ciphers fulfill Strict Avalanche Criteria, key sensitivity test, and randomness test. BRIGHT family ciphers show better performance in terms of memory requirements, cost and speed as compared to existing lightweight ciphers.

show abstract

Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA

Cited by 68 publications

References 14 publications

Mind the Gap - A Closer Look at the Security of Block Ciphers against Differential Cryptanalysis

Mind the Gap - A Closer Look at the Security of Block Ciphers against Differential Cryptanalysis

Automatic Search for the Linear (Hull) Characteristics of ARX Ciphers: Applied to SPECK, SPARX, Chaskey, and CHAM-64

Performance Evaluation of Newly Proposed Lightweight Cipher, BRIGHT

Contact Info

Product

Resources

About