Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1455090 (Why is no real title available?)
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- A generic approach to invariant subspace attacks: cryptanalysis of Robin, iSCREAM and Zorro
- How to Protect DES Against Exhaustive Key Search
- Low-Data Complexity Attacks on AES
- Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
- Reflection cryptanalysis of PRINCE-like ciphers
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- The effects of the omission of last round's MixColumns on AES
- Universal forgery and key recovery attacks on ELmD authenticated encryption algorithm
- \texttt{Midori}: a block cipher for low energy
Cited in
(9)- A new non-random property of 4.5-round PRINCE
- PRINCEv2. More security for (almost) no overhead
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Multiple differential cryptanalysis of round-reduced \textsc{PRINCE}
- Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
- Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE
- First multidimensional cryptanalysis on reduced-round \(\mathrm{PRINCE}_{core}\)
- Cryptanalysis of \texttt{PRINCEv2} using biclique structures
- Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE
This page was built for publication: Practical low data-complexity subspace-trail cryptanalysis of round-reduced PRINCE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179493)