Optimising Linear Key Recovery Attacks with Affine Walsh Transform Pruning - Archive ouverte HAL Access content directly
Conference Papers Year :

Optimising Linear Key Recovery Attacks with Affine Walsh Transform Pruning

(1)
1

Abstract

Linear cryptanalysis [25] is one of the main families of keybrecovery attacks on block ciphers. Several publications [16,19] have drawn attention towards the possibility of reducing their time complexity using the fast Walsh transform. These previous contributions ignore the structure of the key recovery rounds, which are treated as arbitrary boolean functions. In this paper, we optimise the time and memory complexities of these algorithms by exploiting zeroes in the Walsh spectra of these functions using a novel affine pruning technique for the Walsh Transform. These new optimisation strategies are then showcased with two application examples: an improved attack on the DES [1] and the first known atttack on 29-round PRESENT-128 [9].
Fichier principal
Vignette du fichier
linear cryptanalysis paper.pdf (542.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03878737 , version 1 (30-11-2022)

Identifiers

  • HAL Id : hal-03878737 , version 1

Cite

Antonio Florez Gutierrez. Optimising Linear Key Recovery Attacks with Affine Walsh Transform Pruning. ASIACRYPT 2022 - 28th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2022, Taipei, Taiwan. ⟨hal-03878737⟩

Collections

INRIA INRIA2
0 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More