Open AccessFFT‐based multidimensional linear attack on PRESENT using the 2‐bit‐fixed characteristic
Author(s) -
Zheng Lei,
Zhang Shaowu
Publication year - 2015
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.1278
Subject(s) - linear cryptanalysis , cryptanalysis , computer science , differential cryptanalysis , higher order differential cryptanalysis , cryptography , fast fourier transform , algorithm , computation , theoretical computer science , arithmetic , mathematics
Linear cryptanalysis is one of the most important cryptanalysis methods and remains vital in the cryptography research up to now. Many derivatives, improvements, and generations of linear cryptanalysis have been introduced to attack the ciphers of different designs. This paper defines a new characteristic of the cryptographic function, called 2‐bit‐fixed characteristic, as a generation of the linear characteristic. Compared with the linear characteristic, it restricts the input more severely to obtain a larger output bias. Using the characteristic, this paper gives a multidimensional linear attack on 27‐round PRESENT with a computation complexity of 2 74 encryptions, where the fast Fourier transform is employed to deduct the computation complexity. The attack is the first attack on the 27‐round PRESENT of 80 bits master key, verified by experiments for reduced‐round versions, in which we successfully attack 14‐round and 15‐round PRESENT with data complexities of 2 28 and 2 31 , respectively. Copyright © 2015 John Wiley & Sons, Ltd.