Differential cryptanalysis of PRESENT-like cipher
From MaRDI portal
Publication:494577
DOI10.1007/s10623-014-9965-1zbMath1359.94613OpenAlexW2083898372WikidataQ121364349 ScholiaQ121364349MaRDI QIDQ494577
Publication date: 1 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9965-1
Related Items
On the efficiency of solving Boolean polynomial systems with the characteristic set method, Mind the gap -- a closer look at the security of block ciphers against differential cryptanalysis, Speeding up the GVW algorithm via a substituting method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural cryptanalysis of SASAS
- Slender-set differential cryptanalysis
- Multiple Differential Cryptanalysis Using LLR and χ 2 Statistics
- Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations
- Multiple Differential Cryptanalysis: Theory and Practice
- Cryptanalysis of PRESENT-Like Ciphers with Secret S-Boxes
- Cryptanalysis of C2
- Multidimensional Extension of Matsui’s Algorithm 2
- Differential Cryptanalysis of Reduced-Round PRESENT
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINTcipher: A Block Cipher for IC-Printing
- A Statistical Saturation Attack against the Block Cipher PRESENT
- Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
- Weak Keys of Reduced-Round PRESENT for Linear Cryptanalysis
- On the weak keys of blowfish
- IX. On the problem of the most efficient tests of statistical hypotheses
- A Model for Structure Attacks, with Applications to PRESENT and Serpent
- Linear Cryptanalysis of Reduced-Round PRESENT
- How Far Can We Go Beyond Linear Cryptanalysis?