Indifferentiability of 8-Round Feistel Networks
From MaRDI portal
Recommendations
- On generalized Feistel networks
- scientific article; zbMATH DE number 1759317
- Generalized Feistel networks revisited
- On the differential and linear efficiency of balanced Feistel networks
- Convex solutions of RCC8 networks
- Hamiltonian properties on a class of circulant interconnection networks
- On an extremal family of circulant networks
- Related-key analysis of generalized Feistel networks with expanding round functions
- New algorithm for exhausting optimal permutations for generalized Feistel networks
- Indifferentiability of confusion-diffusion networks
Cites work
- 10-round Feistel is indifferentiable from an ideal cipher
- A domain extender for the ideal cipher
- Careful with composition: limitations of the indifferentiability framework
- How to construct an ideal cipher from a small set of public permutations
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On generalized Feistel networks
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- On the indifferentiability of key-alternating ciphers
- On the Indifferentiability of the Sponge Construction
- On the public indifferentiability and correlation intractability of the 6-round Feistel construction
- Security and composition of multiparty cryptographic protocols
- Security proofs for signature schemes
- The equivalence of the random oracle model and the ideal cipher model, revisited
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Theory of Cryptography
- Theory of Cryptography
- Tight security bounds for key-alternating ciphers
- To hash or not to hash again? (In)differentiability results for H^2 and HMAC
Cited in
(25)- KHAPE: Asymmetric PAKE from key-hiding key exchange
- Asymmetric PAKE with low computation \textit{and} communication
- Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
- On the public indifferentiability and correlation intractability of the 6-round Feistel construction
- Simpira v2: a family of efficient permutations using the AES round function
- Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures
- Public-seed pseudorandom permutations
- 10-round Feistel is indifferentiable from an ideal cipher
- Indifferentiability of confusion-diffusion networks
- Keyed sum of permutations: a simpler RP-based PRF
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Layout graphs, random walks and the t-wise independence of SPN block ciphers
- Redeeming reset indifferentiability and applications to post-quantum security
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- On the sequential indifferentiability of the Lai-Massey construction
- Feistel ciphers based on a single primitive
- Succinctly-committing authenticated encryption
- Indifferentiability of 3-round confusion-diffusion networks
- Under what conditions is encrypted key exchange actually secure?
- Sequential indifferentiability of 7-round Misty structures
- Crooked indifferentiability of the Feistel construction
- HIC is all you need: practical post-quantum password-authenticated public-key encryption
- The key-dependent message security of key-alternating Feistel ciphers
This page was built for publication: Indifferentiability of 8-Round Feistel Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835584)
