How Much Can Complexity of Linear Cryptanalysis Be Reduced?

@inproceedings{Sakikoyama2014HowMC,
  title={How Much Can Complexity of Linear Cryptanalysis Be Reduced?},
  author={Sho Sakikoyama and Yosuke Todo and Kazumaro Aoki and Masakatu Morii},
  booktitle={ICISC},
  year={2014}
}
The linear cryptanalysis proposed by Matsui is one of the most effective attacks on block ciphers, and he demonstrated an experimental cryptanalysis against DES at CRYPTO 1994. In this paper, we show how to optimize the linear cryptanalysis on modern microprocessors. Nowadays, there are two methods of implementing the linear cryptanalysis. Method 1 reduces the time complexity by reducing the number of computations of round functions, and Method 2 applies the fast Fourier transform (FFT). We… CONTINUE READING

Citations

Publications citing this paper.