Algebraic Techniques in Linear Cryptanalysis
Hongru Wei, Yafei Zheng
Available Online May 2014.
- https://doi.org/10.2991/iccia.2012.93How to use a DOI?
- linear cryptanalysis, algebraic attack, data complexity
- Linear cryptanalysis is a statistical analysis method. Linear cryptanalysis constructs probabilistic patterns first and then distinguishes the cipher from a random permutation using lots of plaintext-ciphertext pairs. Linear cryptanalysis has a big data complexity. Algebraic attack attempts to exploit the algebraic structure of the cipher by expressing the encryption transformation as a set of polynomial equations and then attempts to solve the system to recover the encryption key. Algebraic attacks do not need too much data. This paper combines these two methods by using algebraic techniques in linear cryptanalysis, and proposes a new cryptanalysis method called Algebraic Techniques in Linear Cryptanalysis. This new method is used in the existing linear cryptanalysis of PRESENT. To recover 8-bit key information of 21-round PRESENT, the data complexity is and the time complexity is .Compared with the result of linear cryptanalysis, the data complexity is obviously decreased.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Hongru Wei AU - Yafei Zheng PY - 2014/05 DA - 2014/05 TI - Algebraic Techniques in Linear Cryptanalysis BT - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012) PB - Atlantis Press SP - 386 EP - 389 SN - 1951-6851 UR - https://doi.org/10.2991/iccia.2012.93 DO - https://doi.org/10.2991/iccia.2012.93 ID - Wei2014/05 ER -