New constructions in linear cryptanalysis of block ciphers
Anna Zugaj , Karol Górski , Zbigniew Kotulski , Andrzej Paszkiewicz , Janusz Szczepański
AbstractAt the beginning of the paper we describe the state of art in linear cryptanalysis of block ciphers. We present algorithms for finding best linear expressions proposed by Matsui  and Ohta . We sketch basic linear cryptanalysis (0R, 1R, 2R attacks) and the known extensions. We explain the advantages and the limitations of applying linear cryptanalysis and its extensions to block ciphers. In the second part of the paper we describe our proposal of a new extension to linear attack based on the application of a probabilistic counting method. It allows the reduction of two consecutive rounds and form the basis for mounting e.g. 3R attacks. We present experimental results of the implementation of this attack to the Data Encryption Standard.
|Publication size in sheets||0.5|
|Book||Proceedings of the 7th International Conference on Advanced Computer Systems ACS'2000, 2000, Szczecin, Polska, Instytut Informatyki Politechniki Szczecińskiej, ISBN 83-87362-24-7, 594 p.|
|Keywords in English||block cipher, linear cryptanalysis, linear expression, probabilistic counting method, Data Encryption Standard|
|Publication indicators||= 6.0|
|Citation count*||6 (2020-09-05)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.