Automated key recovery attacks on round-reduced Orthros
From MaRDI portal
Publication:6160826
Recommendations
- An efficient strategy to construct a better differential on multiple-branch-based designs: application to Orthros
- Faster key recovery attack on round-reduced PRINCE
- Cryptanalysis of reduced NORX
- Generic key recovery attack on Feistel scheme
- Automatic key recovery of Feistel ciphers: application to SIMON and SIMECK
Cites work
- Automatic search of meet-in-the-middle and impossible differential attacks
- Bit-based division property and application to \textsc{Simon} family
- Differential cryptanalysis of DES-like cryptosystems
- DLCT: a new tool for differential-linear cryptanalysis
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1406763 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Integral attacks on Pyjamask-96 and round-reduced Pyjamask-128
- Programming the Demirci-Selçuk meet-in-the-middle attack with constraints
- RIPEMD-160: a strengthened version of RIPEMD
- Structural evaluation by generalized integral property
- The complexity of theorem-proving procedures
Cited in
(3)- An efficient strategy to construct a better differential on multiple-branch-based designs: application to Orthros
- Revisiting differential-linear attacks via a boomerang perspective with application to AES, Ascon, CLEFIA, SKINNY, PRESENT, KNOT, TWINE, WARP, LBlock, Simeck, and SERPENT
- General practical cryptanalysis of the sum of round-reduced block ciphers and ZIP-AES
This page was built for publication: Automated key recovery attacks on round-reduced Orthros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160826)