Improved automatic search of impossible differentials for camellia with FL/FL
                            −1 layers

Ding, Yaoling; Wang, Xiaoyun; Wang, Ning; Wang, Wei

doi:10.1007/s11432-016-9104-3

Cited by 3 publications

(16 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, H 3 has 2 3b rows, each of which has 2 b values on average. [14]. Compute the values of X 5 [14] X 5 [14].…”

Section: ) the Key Rocovery Phasementioning

confidence: 99%

“…Compute the values of X 5 [14] X 5 [14]. [14] in H 5 indexed by P [14] t 4 [14], where P [14] = X 5 [14]. Thus H 5 has 2 2b rows, each of which has only one values on average.…”

Section: ) the Key Rocovery Phasementioning

confidence: 99%

“…Since the value of k 0 [3,6,9] has known, we can compute the value of Z 7 [6] Z 7 [6] V 7 [6]. Keep those subkeys satisfying V 7 [6] = t 6 [6] and [14] X 5 [14]. So the value of k 0 [14] can be computed by k 0 [14] = P [14] ⊕ X 5 [14].…”

Section: ) the Key Rocovery Phasementioning

confidence: 99%

“…Keep those subkeys satisfying V 7 [6] = t 6 [6] and [14] X 5 [14]. So the value of k 0 [14] can be computed by k 0 [14] = P [14] ⊕ X 5 [14]. There are 2 b values of k 0 [0, 1,2,3,4,5,6,7,8,9,10,11,12,14,15] left.…”

Section: ) the Key Rocovery Phasementioning

confidence: 99%

“…Given enough plaintext-ciphertexts, the correct subkey should be recovered. Up to now, many new results have been presented to improve its efficiency, such as the early abort technique [7], the statetest technique [8], pre-computation tables [9] and automated algorithms [10]- [14].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Improved Cryptanalysis of Reduced-Version QARMA-64/128

Liu

Zang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

QARMA is a new tweakable block cipher used for memory encryption, the generation of short tags and the construction of the keyed hash functions in future. It adopts a three-round Even-Mansour scheme and supports 64 and 128 bits of block size, denoted by QARMA-64 and QARMA-128, respectively. Their tweak lengths equal the block sizes and their keys are twice as long as the blocks. In this paper, we improve the security analysis of reduced-version QARMA against impossible differential and meet-in-the-middle attacks. Specifically, first exploit some properties of its linear operations and the redundancy of key schedule. Based on them, we propose impossible differential attacks on 11-round QARMA-64/128, and meet-in-themiddle attacks on 10-round symmetric QARMA-128 and the last 12 rounds of asymmetric QARMA-128. Compared with the previously best known results on QARMA-64, our attack can recover 16 more bits of master key with the almost complexities. Compared with the previously best known results on symmetric QARMA-128, the memory complexity of our attack in Section IV is reduced by a factor of 2 48. Moreover, the meet-in-the-middle attack on 12-round QARMA-128 is the best known attack on QARMA-128 in terms of the number of rounds. INDEX TERMS Tweakable block ciphers, QARMA, meet-in-the-middle attacks, impossible differential cryptanalysis, tweaks.

show abstract

“…Thus, H 3 has 2 3b rows, each of which has 2 b values on average. [14]. Compute the values of X 5 [14] X 5 [14].…”

Section: ) the Key Rocovery Phasementioning

confidence: 99%

“…Compute the values of X 5 [14] X 5 [14]. [14] in H 5 indexed by P [14] t 4 [14], where P [14] = X 5 [14]. Thus H 5 has 2 2b rows, each of which has only one values on average.…”

Section: ) the Key Rocovery Phasementioning

confidence: 99%

Section: ) the Key Rocovery Phasementioning

confidence: 99%

Section: ) the Key Rocovery Phasementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Improved Cryptanalysis of Reduced-Version QARMA-64/128

Liu

Zang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

Improved impossible differential cryptanalysis of large-block Rijndael

Liu

Shi

et al. 2018

Sci. China Inf. Sci.

View full text Add to dashboard Cite

A new quantum cryptanalysis method on block cipher Camellia

Lin

Liang

et al. 2021

IET Information Security

View full text Add to dashboard Cite

Symmetric cryptography is expected to be quantum safe when long-term security is needed. Kuwakado and Morii gave a 3-round quantum distinguisher of the Feistel cipher based on Simon's algorithm. However, the quantum distinguisher without considering the specific structure of the round function is not accurate enough. A new quantum cryptanalysis method for Feistel structure is studied here. It can make full use of the specific structure of the round function. The properties of Camellia round function and its linear transformation P are taken into account, and a 5-round quantum distinguisher is proposed. Then, the authors follow a key-recovery attack framework by Leander and May, that is, Grover-meet-Simon algorithm, and give a quantum key-recovery attack on 7-round Camellia in Q2 model with the time complexity of 2 24 . It is the very first time that the specific structure of the round function is used to improve quantum attack on Camellia.This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

show abstract

Improved automatic search of impossible differentials for camellia with FL/FL −1 layers

Cited by 3 publications

References 7 publications

Improved Cryptanalysis of Reduced-Version QARMA-64/128

Improved Cryptanalysis of Reduced-Version QARMA-64/128

Improved impossible differential cryptanalysis of large-block Rijndael

A new quantum cryptanalysis method on block cipher Camellia

Contact Info

Product

Resources

About