On computational complexity of impossible differential cryptanalysis
From MaRDI portal
Publication:2446068
Recommendations
Cites work
- An Improved Impossible Differential Attack on MISTY1
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Differential cryptanalysis of DES-like cryptosystems
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1808210 (Why is no real title available?)
- Impossible differential cryptanalysis of ARIA reduced to 7 rounds
- Improved impossible differential cryptanalysis of 7-round AES-128
- New Impossible Differential Attacks on AES
- New impossible differential attacks on Camellia
- New observations on impossible differential cryptanalysis of reduced-round Camellia
- New Results on Impossible Differential Cryptanalysis of Reduced–Round Camellia–128
- Selected Areas in Cryptography
Cited in
(11)- Upper bound of the length of truncated impossible differentials for AES
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Making the impossible possible
- scientific article; zbMATH DE number 2089315 (Why is no real title available?)
- The state-of-the-art of research on impossible differential cryptanalysis
- Note on impossible differential attacks
- Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix
- On impossible truncated differentials of XSL ciphers
- On the computational hardness of the code equivalence problem in cryptography
- A unified method for finding impossible differentials of block cipher structures
- Impossible differential cryptanalysis using matrix method
This page was built for publication: On computational complexity of impossible differential cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446068)