Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations
From MaRDI portal
Publication:3013074
DOI10.1007/978-3-642-21702-9_1zbMath1282.94029OpenAlexW150582475MaRDI QIDQ3013074
Gregor Leander, Erik Zenner, Mohamed Ahmed Abdelraheem
Publication date: 7 July 2011
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21702-9_1
Related Items (6)
Combined Differential and Linear Cryptanalysis of Reduced-Round PRINTcipher ⋮ Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures ⋮ Slender-set differential cryptanalysis ⋮ Differential cryptanalysis of PRESENT-like cipher ⋮ О классах слабых ключей обобщенной шифрсистемы PRINT ⋮ Linear Cryptanalysis of PRINTcipher – Trails and Samples Everywhere
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- HIGHT: A New Block Cipher Suitable for Low-Resource Device
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINTcipher: A Block Cipher for IC-Printing
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- ON THE NUMBER OF SOLUTIONS OF THE EQUATION $x^k = a$ IN THE SYMMETRIC GROUP $S_n$
- Fast Software Encryption Functions
- On the weak keys of blowfish
This page was built for publication: Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations