Simplified MITM modeling for permutations: new (quantum) attacks
From MaRDI portal
Recommendations
- Sieve-in-the-middle: improved MITM attacks
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Automatic search of meet-in-the-middle preimage attacks on AES-like hashing
- Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks
- Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework
Cites work
- A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN
- A single-key attack on the full GOST block cipher
- Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
- All subkeys recovery attack on block ciphers: extending meet-in-the-middle approach
- Automatic search of attacks on round-reduced AES and applications
- Automatic search of meet-in-the-middle and impossible differential attacks
- Automatic search of meet-in-the-middle preimage attacks on AES-like hashing
- Bicliques for preimages: attacks on Skein-512 and the SHA-2 family
- Double SP-functions: enhanced generalized Feistel networks (extended abstract)
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- Improved Meet-in-the-Middle Attacks on Reduced-Round DES
- Improving the generalized Feistel
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli}
- Known-key distinguisher on full \(\mathtt{PRESENT}\)
- Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks
- Meet-in-the-middle preimage attacks on AES hashing modes and an application to Whirlpool
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- One Way Hash Functions and DES
- Preimage Attacks on One-Block MD4, 63-Step MD5 and More
- PRESENT: An Ultra-Lightweight Block Cipher
- Putting wings on SPHINCS
- Quantum collision attacks on reduced SHA-256 and SHA-512
- Security analysis of GFN: 8-round distinguisher for 4-branch type-2 GFN
- Simpira v2: a family of efficient permutations using the AES round function
- SPONGENT: The Design Space of Lightweight Cryptographic Hashing
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
Cited in
(11)- Improved attacks against reduced-round Whirlwind
- Meet-in-the-middle preimage attacks on sponge-based hashing
- Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256}
- Quantum attacks on hash constructions with low quantum random access memory
- Automated meet-in-the-middle attack goes to Feistel
- Diving deep into the preimage security of AES-like hashing
- Generic MitM attack frameworks on sponge constructions
- Speeding up preimage and key-recovery attacks with highly biased differential-linear approximations
- Scrutinizing the security of AES-based hashing and one-way functions
- Triangulating meet-in-the-middle attack
- Meet-in-the-middle attack on primitives with binary matrix linear layer
This page was built for publication: Simplified MITM modeling for permutations: new (quantum) attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163972)
