Improved impossible differential and biclique cryptanalysis of HIGHT

Azimi, Seyyed Arash; Ahmadi, Siavash; Ahmadian, Zahra; Mohajeri, Javad; Aref, Mohammad Reza

doi:10.1002/dac.3382

Cited by 7 publications

(7 citation statements)

References 18 publications

(32 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results show some improvements in comparison to previous works. As an example, generalized MITM attack along with bit-wised matching part on HIGHT has found an attack with time, memory and data complexities of 2 125.2 , 2 16 and 2 24 , which has less time and data complexities than the previous work on full-round HIGHT [22], with time, memory and data complexities of 2 125.67 , 2 16 and 2 42 , respectively. In addition, generalized MITM attack on Piccolo-128 has found the same result as [17] when data complexity limitation is applied on the attack.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm

Ahmadi

Aref

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Meet in the middle (MITM) attack is one of the most important and applicable methods for cryptanalysis of block ciphers. In this paper, a more generalized method for MITM attack is considered. For this purpose, a notion, namely cut-set, is utilized by which several numbers of MITM attacks can be performed. However, manual investigation on these cases is time-consuming and sometimes not errorfree. Therefore, a new search algorithm is also provided to obtain proper attacks in a timely manner. For examination, this new search algorithm, which could make an automated attack along with some certain ideas, is applied on HIGHT, Piccolo-128, CRAFT and AES-128 block ciphers. The least time complexities which are obtained by generalized MITM attack on full HIGHT, Piccolo-128, CRAFT and AES-128 are 2 125.08 , 2 126.78 , 2 123.25 and 2 125.53 , respectively. The results on full-round CRAFT are, to the best of our knowledge, the first cryptanalysis results in the single-key model except the designers' investigations. In addition, the results show some improvements for complexities of all the attacks, especially on HIGHT.

show abstract

Section: Discussionmentioning

confidence: 99%

“…• By C 1 and V 1 , an attack A 1 with time, memory and data complexities of 2 125.399 , 2 32 and 2 64 can be obtained by (K 7 , K 8 ) and (K 3 , K 9 , K 10 ) as forward and backward subkeys, respectively. It should be emphasized that the best known time complexity for full HIGHT was 2 125.67 before [22].…”

Section: A Hight 1) Generalized Mitm Attack On Hightmentioning

confidence: 99%

Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm

Ahmadi

Aref

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…HIGHT is approved by the Korea Information Security Agency and is adopted as an International Standard by ISO/IEC 18033‐3 [11]. This made this cipher an attractive target for cryptanalysis [35–39].…”

Section: Differential Analysis Of Hight Block Cipher Using Milp Methodsmentioning

confidence: 99%

MILP‐based automatic differential search for LEA and HIGHT block ciphers

Bagherzadeh

Ahmadian

2020

IET Information Security

Self Cite

View full text Add to dashboard Cite

“…To go through this deduction certain notations shall be introduced [6]. First, starting with Fourier transfer on a boolean function which can be defined as f : Fn In [7], An estimation of linear trails correlation was stated stated for key alternating ciphers which is a subclass of Markov ciphers that will alternate the use of number of keys (XORing or adding the keys to the rounds) with a key independent instances of round functions . It was noted that when considering linear trails it should be noted that they are key dependent where only the sign of the correlation depends on the key.…”

Section: Linear Probability Estimationsmentioning

confidence: 99%

“…Integral attacks were first introduced by Knudsen in their application on SQUARE in [7] and later on was applied and generalized under different references as in multiset attacks and saturation attacks on Twofish properties to be minimal.…”

Section: Integral Cryptanalysismentioning

confidence: 99%

A Brief Review on Methodology of Cryptanalysis

2019

View full text Add to dashboard Cite

Cryptanalysis comes into deferent forms in order to support that rigorous analysis of the structure cryptographic primitive to evaluate and verify its claimed security margins. This analysis will follow the attack models represented previously in order to exploit possible weakness in the primitive. Thus, achieving the associated attack goals which will vary from a distinguishing attack to a total break that is deﬁned based on the security margins or claims of the primitive under study. For example, for a hash function, total break constitutes ﬁnding a collision or obtaining the message from the hash value. While in block ciphers it revolves around recovering the secret key. When it comes to the claimed security margins, the design approaches will follow certain security models as in provable security or practical security or a mixture of both. The role of cryptanalyst is to subject these primitives to diﬀerent existing categories of cryptanalysis approaches and tailor new ones that will push the design’s security margins if possible to new limits where these attacks are not applicable any more This chapter will introduce the prominent methods of cryptanalysis that utilize certain behavior in the cipher structure. Such behavior disturbs the assumed randomness of the output or the cipher text. This Paper will explore the basic deﬁnitions of prominent cryptanalysis methods that targets the speciﬁc structure of a cipher namely diﬀerential and linear cryptanalysis and their diﬀerent variants. It will also discuss other potential crytpanalytic methods that are usually used in symmetric-key ciphers analysis especially block ciphers.

show abstract

Improved impossible differential and biclique cryptanalysis of HIGHT

Cited by 7 publications

References 18 publications

Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm

Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm

MILP‐based automatic differential search for LEA and HIGHT block ciphers

A Brief Review on Methodology of Cryptanalysis

Contact Info

Product

Resources

About