On the indifferentiability of key-alternating ciphers
From MaRDI portal
Publication:2845693
Recommendations
- Tight security bounds for key-alternating ciphers
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- How to construct an ideal cipher from a small set of public permutations
- Minimizing the two-round Even-Mansour cipher
Cited in
(41)- Provable security against generic attacks on stream ciphers
- Indifferentiability for public key cryptosystems
- BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
- Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- The \(t\)-wise independence of substitution-permutation networks
- Slidex attacks on the Even-Mansour encryption scheme
- From Indifferentiability to Constructive Cryptography (and Back)
- Improved domain extender for the ideal cipher
- Salvaging weak security bounds for blockcipher-based constructions
- KHAPE: Asymmetric PAKE from key-hiding key exchange
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- On stream ciphers with provable beyond-the-birthday-bound security against time-memory-data tradeoff attacks
- On the sequential indifferentiability of the Lai-Massey construction
- Minimizing the two-round Even-Mansour cipher
- On the Role of Key Schedules in Attacks on Iterated Ciphers
- Security proofs for key-alternating ciphers with non-independent round permutations
- The key-dependent message security of key-alternating Feistel ciphers
- The relationship between idealized models under computationally bounded adversaries
- Sequential indifferentiability of confusion-diffusion networks
- Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- scientific article; zbMATH DE number 1979484 (Why is no real title available?)
- Indifferentiability of 8-Round Feistel Networks
- Connecting tweakable and multi-key blockcipher security
- New slide attacks on almost self-similar ciphers
- Tight security bounds for key-alternating ciphers
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- Feistel ciphers based on a single primitive
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- Tweaking Even-Mansour ciphers
- Key recovery attacks on iterated Even-Mansour encryption schemes
- Strengthening the known-key security notion for block ciphers
- Public-seed pseudorandom permutations
- On Integral Distinguishers of Rijndael Family of Ciphers
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- XPX: generalized tweakable Even-Mansour with improved security guarantees
- ON THE KEYSPACE OF THE HILL CIPHER
- Asymmetric PAKE with low computation \textit{and} communication
This page was built for publication: On the indifferentiability of key-alternating ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845693)
