Optimum attack on 3-round Feistel-2 structure
From MaRDI portal
Publication:2128756
DOI10.1007/978-3-030-85987-9_10zbMATH Open1496.94036OpenAlexW3198054971MaRDI QIDQ2128756FDOQ2128756
Authors: Takanori Daiza, Kaoru Kurosawa 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85987-9_10
Recommendations
- Quantum Key Recovery Attacks on 3-Round Feistel-2 Structure Without Quantum Encryption Oracles
- New attacks on Feistel structures with improved memory complexities
- Extended meet-in-the-middle attacks on some Feistel constructions
- Meet-in-the-middle attacks on generic Feistel constructions
- Advances in Cryptology – CRYPTO 2004
Cites Work
- Monte Carlo Methods for Index Computation (mod p)
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Mathematics of public key cryptography.
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Slidex attacks on the Even-Mansour encryption scheme
- Security analysis of key-alternating Feistel ciphers
- Title not available (Why is that?)
- Limitations of the Even-Mansour construction
- Generic key recovery attack on Feistel scheme
- All subkeys recovery attack on block ciphers: extending meet-in-the-middle approach
- On generalized Feistel networks
- Faster Luby-Rackoff ciphers
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Title not available (Why is that?)
- Luby-Rackoff Ciphers from Weak Round Functions?
- Efficient dissection of bicomposite problems with cryptanalytic applications
- New attacks on Feistel structures with improved memory complexities
Cited In (3)
This page was built for publication: Optimum attack on 3-round Feistel-2 structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128756)
