How to improve rebound attacks
From MaRDI portal
Recommendations
Cited in
(19)- Quantum algorithms for the \(k\)-XOR problem
- Some results on Fruit
- Efficient dissection of bicomposite problems with cryptanalytic applications
- The rebound attack and subspace distinguishers: application to Whirlpool
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Improved analysis of ECHO-256
- A new algorithm for the unbalanced meet-in-the-middle problem
- Practical Analysis of Reduced-Round Keccak
- LHash: a lightweight hash function
- Cryptanalysis of full sprout
- Improved cryptanalysis of AES-like permutations
- Triangulating rebound attack on AES-like hashing
- Differential meet-in-the-middle cryptanalysis
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- A generic algorithm for efficient key recovery in differential attacks -- and its associated tool
- Generic MitM attack frameworks on sponge constructions
- The state-test technique on differential attacks: a 26-round attack on Craft and other applications
- Guess-and-determine rebound: applications to key collisions on \textsf{AES}
- Guessing less and better: improved attacks on GIFT-64
This page was built for publication: How to improve rebound attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199191)