On the complexity of Matsui's attack

MaRDI QIDQ4736433zbMATH OpenFDO

Authors Pascal Junod

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2259/22590199.htm

zbMATH Keywords

DESlinear cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A chosen-plaintext linear attack on DES
• On linear cryptanalysis with many linear approximations
• On Matsui's linear cryptoanalysis
• The first experimental cryptanalysis of the Data Encryption Standard
• Linear cryptanalysis of DES with asymmetries

Cited in

(18)

• Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
• Multidimensional linear cryptanalysis
• Generalized Matsui Algorithm 1 with application for the full DES
• Generalization of one method of a filter generator key recovery
• Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
• Linear cryptanalysis of DES with asymmetries
• Accurate estimates of the data complexity and success probability for various cryptanalyses
• On probability of success in linear and differential cryptanalysis
• A quantum related-key attack based on the Bernstein-Vazirani algorithm
• On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2
• DES has no per round linear factors
• An improved known plaintext attack on PKZIP encryption algorithm
• Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
• On linear cryptanalysis with many linear approximations
• Improving the search algorithm for the best linear expression
• On Matsui's linear cryptoanalysis
• A chosen-plaintext linear attack on DES
• Improving the Time Complexity of Matsui’s Linear Cryptanalysis

This page was built for publication: On the complexity of Matsui's attack

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