Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
From MaRDI portal
Publication:404952
DOI10.1007/s10623-013-9840-5zbMath1308.94062OpenAlexW2014659940MaRDI QIDQ404952
Stanislav Bulygin, Michael Walter, Johannes A. Buchmann
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9840-5
mixed integer linear programmingchosen plaintext attack\textsc{PRINTcipher}invariant coset attackkey recoveryweak keys
Related Items (3)
Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions ⋮ On the resilience of Even-Mansour to invariant permutations ⋮ A new non-random property of 4.5-round PRINCE
Uses Software
Cites Work
- Unnamed Item
- On unbalanced feistel networks with contracting MDS diffusion
- Combined Differential and Linear Cryptanalysis of Reduced-Round PRINTcipher
- Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48
- EPCBC - A Block Cipher Suitable for Electronic Product Code Encryption
- LBlock: A Lightweight Block Cipher
- Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations
- Linear Cryptanalysis of PRINTcipher – Trails and Samples Everywhere
- The LED Block Cipher
- PRESENT: An Ultra-Lightweight Block Cipher
- Algebraic Cryptanalysis
- PRINTcipher: A Block Cipher for IC-Printing
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- Bivium as a Mixed-Integer Linear Programming Problem
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- Many Weak Keys for PRINTcipher: Fast Key Recovery and Countermeasures
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- SPONGENT: The Design Space of Lightweight Cryptographic Hashing
This page was built for publication: Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures