Improving the search algorithm for the best linear expression

DOI10.1007/3-540-44750-4_13MaRDI QIDQ4343431zbMATH OpenFDO

Authors Kazuo Ohta, Shiho Moriai, Kazumaro Aoki

Publication date 24 August 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_13

zbMATH Keywords

best linear expressionDESFEALlinear cryptanalysis

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Best differential characteristic search of FEAL
• How Much Can Complexity of Linear Cryptanalysis Be Reduced?
• Linear cryptanalysis of LOKI and \(s^2\text{DES}\)
• scientific article; zbMATH DE number 2085206

Cited in

(9)

• Speeding up the search algorithm for the best differential and best linear trails
• Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
• Practical security against linear cryptanalysis for SMS4-like ciphers with SP round function
• Best differential characteristic search of FEAL
• Improving linear cryptanalysis of LOKI91 by probabilistic counting method
• Speeding up MILP Aided Differential Characteristic Search with Matsui’s Strategy
• Improving the search algorithm for the best differential/linear trails of bit-permutation-based ciphers
• A new automatic framework for searching rotational-XOR differential characteristics in ARX ciphers
• Improved (related-key) differential cryptanalysis on GIFT

This page was built for publication: Improving the search algorithm for the best linear expression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343431)