How Much Can Complexity of Linear Cryptanalysis Be Reduced?

DOI10.1007/978-3-319-15943-0_8zbMath1356.94081OpenAlexW334801153MaRDI QIDQ2942831

Yosuke Todo, Sho Sakikoyama, Kazumaro Aoki, Masakatu Morii

Publication date: 11 September 2015

Published in: Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15943-0_8

zbMATH Keywords

FFTlinear cryptanalysismultiple linear cryptanalysisFEAL-8X

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Improvement of Linear Cryptanalysis with Addition Operations with Applications to FEAL-8X
• Zero-Correlation Linear Cryptanalysis with FFT and Improved Attacks on ISO Standards Camellia and CLEFIA
• Improving the Algorithm 2 in Multidimensional Linear Cryptanalysis
• Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited
• Improving the Time Complexity of Matsui’s Linear Cryptanalysis
• FFT Key Recovery for Integral Attack

This page was built for publication: How Much Can Complexity of Linear Cryptanalysis Be Reduced?