MILP-Based Differential Cryptanalysis on Round-Reduced Midori64

Zhao, Hongxia; Han, Guoyong; Wang, Letian; Wang, Wen

doi:10.1109/access.2020.2995795

Cited by 12 publications

(10 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, 15 superpoly equations are chosen where α = α 1 (as there are |S (4,0,64) | − 1 = 15 different values of φ, excluding the instances where φ = α 1 ), whereas one superpoly equation is chosen where α = α 2 . This also results in 2 3 .16 = 2 7 encryptions.…”

Section: Application Of Side-channel Cube Attack S On Craftmentioning

confidence: 96%

“…Note that two different values of α are used here such that 16 equations, 15 superpoly equations are chosen such that γ = γ 1 (as there are |S (4,0,64) | − 1 = 15 different values of φ, excluding the instances where φ = γ 1 ), whereas only one superpoly is chosen where γ = γ 2 . As a result, this yields 2 3 .16 = 2 7 encryptions. Finally, following the same rule, the superpoly equation in Observation 4 requires |S (4,0,64) | = 16 different values of φ and two different values of φ such that 1 , 2 , ∈ S (4,0,64) .…”

Section: Application Of Side-channel Cube Attack S On Craftmentioning

confidence: 99%

“…Resistance against known standard attacks has become one of the criteria for measuring the security of a block cipher. Cryptanalytic attacks such as linear and differential cryptanalysis [1,2] have been used widely to facilitate such security evaluations [3][4][5][6][7]. However, a cipher that can resist standard attacks may not necessarily be secure against side-channel attacks, which exploits the weaknesses in its physical implementation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Key‐dependent side‐channel cube attack on CRAFT

Pang

Abdul‐Latip

2021

ETRI Journal

View full text Add to dashboard Cite

CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time.

show abstract

Section: Application Of Side-channel Cube Attack S On Craftmentioning

confidence: 96%

Section: Application Of Side-channel Cube Attack S On Craftmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Key‐dependent side‐channel cube attack on CRAFT

Pang

Abdul‐Latip

2021

ETRI Journal

View full text Add to dashboard Cite

show abstract

“…Authors have shown that the differential property of modular addition with one constant input is illustrated with fewer number of linear inequalities input to the MILP solver compared to the common case. Hongluan Zhao et al [23] improved the search for differential trails of Midori64 given by Banik et al [16] by using MILP technique. They have given a better 5-round differential characteristics of Midori64 with the MILP-based model.…”

Section: Organization Of the Papermentioning

confidence: 99%

Towards Finding Active Number of S-Boxes in Block Ciphers using Mixed Integer Linear Programming

Tiwari

Jampala

Tentu

et al. 2021

IJCAI

View full text Add to dashboard Cite

Secure lightweight block ciphers have become an important aspect due to the fact that they are a popular choice for providing security in ubiquitous devices. Two of the most important attacks on block ciphers are differential cryptanalysis [1] and linear cryptanalysis [2]. Calculating the number of active S-boxes is one of the method to examine the security of block ciphers against differential attack. In this paper, we count the minimum number of active S-boxes for several rounds of the lightweight ciphers namely KLEIN, LED and AES. We utilized the method proposed in [9], where calculation of the minimum number of active S-boxes is formulated as a Mixed Integer Linear Programming (MILP) problem. The objective function is to minimize the number of active S-boxes, subject to the constraints imposed by the differential propagation of the cipher. The experimental results are presented in this paper and found to be encouraging.Povzetek: Predstavljena je metoda na osnovi analize MILP problem za iskanje primernih šifer za ambientalne naprave.

show abstract

“…Over the years, many lightweight block ciphers have been developed inclusive of RoadRunneR [6], RECTAN-GLE [7], SAFER-Fermat [8], SKINNY [9], BORON [10], SPECK [11], PCB [12], Simeck [13], Midori [14], Loong [15], LRBC [16], and GIFT [17]. Two main foundation structures of lightweight block ciphers are the Feistel networks and Substitution-Permutation Network (SPN) structures.…”

Section: Introductionmentioning

confidence: 99%

Extended RECTANGLE Algorithm Using 3D Bit Rotation to Propose a New Lightweight Block Cipher for IoT

et al. 2020

View full text Add to dashboard Cite

The Internet of Things (IoT) is a broad range of applications enabled by the connection of devices such as sensors, actuators, and monitors accessible through the Internet. Massive IoT device connectivity and vast data transmission have made the information susceptible to various types of attacks. Therefore, encryption is required for secure communication in an IoT ecosystem. An IoT system is constrained by its complexities that require small computing power. Thus, lightweight block cipher is chosen as the solution to IoT security issues. RECTANGLE block cipher has very efficient encryption speed performance among the existing lightweight algorithms. Although RECTANGLE achieves such high efficiency, lack of focus on its security aspect needs to be addressed. The algorithm is short of confusion and diffusion characteristics that should be offered by a block cipher as one of the cryptographic security properties. Therefore, we extended RECTANGLE using a 3D cipher to improve its security features by enhancing the algorithm confusion and diffusion properties. Security analysis and performance tests were performed to verify the strength of the proposed 3D RECTANGLE. The results show that 3D RECTANGLE performs better than its original version in terms of the correlation between data input and output with an increase of 1.58% for non-linearity results, records approximately 50% bit error rate for sensitiveness against both modifications of plaintext and key, increase of passing rate in the randomness test by 22.22%, and achieves competitive performance results against existing algorithms with 0.9516 ms execution speed and 67.26 bit/ms throughput.

show abstract

MILP-Based Differential Cryptanalysis on Round-Reduced Midori64

Cited by 12 publications

References 22 publications

Key‐dependent side‐channel cube attack on CRAFT

Key‐dependent side‐channel cube attack on CRAFT

Towards Finding Active Number of S-Boxes in Block Ciphers using Mixed Integer Linear Programming

Extended RECTANGLE Algorithm Using 3D Bit Rotation to Propose a New Lightweight Block Cipher for IoT

Contact Info

Product

Resources

About