Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
DOI10.1007/S10623-013-9840-5zbMATH Open1308.94062OpenAlexW2014659940MaRDI QIDQ404952FDOQ404952
Authors: Stanislav Bulygin, Michael Walter, Johannes 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
Recommendations
- Many weak keys for PRINTcipher: fast key recovery and countermeasures
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Linear cryptanalysis of printcipher -- trails and samples everywhere
- On classes of weak keys of generalized cryptosystem PRINT
- A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
mixed integer linear programmingchosen plaintext attack\textsc{PRINTcipher}invariant coset attackkey recoveryweak keys
Cites Work
- LBlock: a lightweight block cipher
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINTcipher: A Block Cipher for IC-Printing
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Algebraic Cryptanalysis
- The LED block cipher
- 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
- Differential cryptanalysis of round-reduced printcipher: computing roots of permutations
- Linear cryptanalysis of printcipher -- trails and samples everywhere
- 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
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
- SPONGENT: The Design Space of Lightweight Cryptographic Hashing
- Algebraic aspects of the advanced encryption standard.
Cited In (9)
- On the resilience of Even-Mansour to invariant permutations
- A new non-random property of 4.5-round PRINCE
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions
- A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
- Linear cryptanalysis of printcipher -- trails and samples everywhere
- Algebraic cryptanalysis of the round-reduced and side channel analysis of the full PRINTCipher-48
- Many weak keys for PRINTcipher: fast key recovery and countermeasures
- On classes of weak keys of generalized cryptosystem PRINT
Uses Software
This page was built for publication: Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404952)
