Beyond-birthday security for permutation-based Feistel networks
From MaRDI portal
Publication:2657129
Recommendations
Cites work
- A domain extender for the ideal cipher
- A Leakage-Resilient Mode of Operation
- Advances in Cryptology – CRYPTO 2004
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Feistel ciphers. Security proofs and cryptanalysis
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- Generic key recovery attack on Feistel scheme
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 2009979 (Why is no real title available?)
- Improved domain extender for the ideal cipher
- Information-theoretic indistinguishability via the chi-squared method
- Invertible Universal Hashing and the TET Encryption Mode
- Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
- Meet-in-the-middle attacks on generic Feistel constructions
- Minimizing the two-round Even-Mansour cipher
- On generalized Feistel networks
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Security analysis of key-alternating Feistel ciphers
- Square reflection cryptanalysis of 5-round Feistel networks with permutations
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
- Tweakable Blockciphers with Beyond Birthday-Bound Security
Cited in
(14)- Provable related-key security of contracting Feistel networks
- Multi-user security bound for filter permutators in the random oracle model
- \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations
- Foiling birthday attacks in length-doubling transformations
- On generalized Feistel networks
- scientific article; zbMATH DE number 1302846 (Why is no real title available?)
- On the Security of Blockwise Secure Modes of Operation Beyond the Birthday Bound
- Upper Bounds for the Security of Several Feistel Networks
- Beyond Modes: Building a Secure Record Protocol from a Cryptographic Sponge Permutation
- Feistel Networks Made Public, and Applications
- Revisiting linearly extended discrete functions
- Tweakable permutation-based Luby-Rackoff constructions
- The exact multi-user security of key-alternating Feistel ciphers with a single permutation
- Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
This page was built for publication: Beyond-birthday security for permutation-based Feistel networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657129)
