Slender-set differential cryptanalysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1722688 (Why is no real title available?)
- scientific article; zbMATH DE number 1024498 (Why is no real title available?)
- scientific article; zbMATH DE number 1498335 (Why is no real title available?)
- scientific article; zbMATH DE number 1406793 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Cryptanalysis of C2
- Differential cryptanalysis of round-reduced printcipher: computing roots of permutations
- Fast Software Encryption Functions
- Linear cryptanalysis of reduced-round PRESENT
- On the weak keys of blowfish
- PRESENT: An Ultra-Lightweight Block Cipher
- PRINTcipher: A Block Cipher for IC-Printing
Cited in
(8)- Cryptanalysis of PRESENT-like ciphers with secret S-boxes
- Speeding up the GVW algorithm via a substituting method
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
- Improbable differential attacks on \texttt{PRESENT} using undisturbed bits
- Improved slender-set linear cryptanalysis
- Differential cryptanalysis of PRESENT-like cipher
- Multiset structural attack on generalized Feistel networks
- Towards practical whitebox cryptography: optimizing efficiency and space hardness
This page was built for publication: Slender-set differential cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946602)