Slender-set differential cryptanalysis
From MaRDI portal
Publication:1946602
DOI10.1007/s00145-011-9111-4zbMath1291.94060OpenAlexW2108987404WikidataQ56933149 ScholiaQ56933149MaRDI QIDQ1946602
Julia Borghoff, Søren S. Thomsen, Gregor Leander, Lars R. Knudsen
Publication date: 15 April 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-011-9111-4
Related Items (5)
Towards Practical Whitebox Cryptography: Optimizing Efficiency and Space Hardness ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Speeding up the GVW algorithm via a substituting method ⋮ Differential cryptanalysis of PRESENT-like cipher ⋮ Multiset structural attack on generalized Feistel networks
Uses Software
Cites Work
- Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations
- Cryptanalysis of C2
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINTcipher: A Block Cipher for IC-Printing
- Fast Software Encryption Functions
- On the weak keys of blowfish
- Linear Cryptanalysis of Reduced-Round PRESENT
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Slender-set differential cryptanalysis