A construction of a cipher from a single pseudorandom permutation.
From MaRDI portal
Recommendations
Cites work
Cited in
(82)- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
- Quantum generic attacks on key-alternating Feistel ciphers for shorter keys
- Minimizing the two-round Even-Mansour cipher
- Post-quantum security on the Lai-Massey scheme
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Block encryption of quantum messages
- Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
- Cryptanalysis of the full 8.5-round REESSE3+ block cipher
- Using Bernstein-Vazirani algorithm to attack block ciphers
- An improved affine equivalence algorithm for random permutations
- Hash functions from defective ideal ciphers
- BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
- Security proofs for key-alternating ciphers with non-independent round permutations
- Breaking symmetric cryptosystems using quantum period finding
- Tweak-length extension for tweakable blockciphers
- An efficient affine equivalence algorithm for multiple S-boxes and a structured affine layer
- Quantum query lower bounds for key recovery attacks on the Even-Mansour cipher
- Partition and mix: generalizing the swap-or-not shuffle
- Quantum key-length extension
- XPX: generalized tweakable Even-Mansour with improved security guarantees
- Tweaking Even-Mansour ciphers
- Multi-key security: the Even-Mansour construction revisited
- Simpira v2: a family of efficient permutations using the AES round function
- Tweakable blockciphers with asymptotically optimal security
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm
- Improved BV-based quantum attack on block ciphers
- scientific article; zbMATH DE number 697813 (Why is no real title available?)
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour
- Key recovery attacks on iterated Even-Mansour encryption schemes
- Quantum attacks on PRFs based on public random permutations
- Linear analysis of reduced-round CubeHash
- Public-seed pseudorandom permutations
- Tweakable block ciphers
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Quick trickle permutation based on quick trickle characteristic sequence
- Connecting tweakable and multi-key blockcipher security
- Efficient slide attacks
- Perfect Block Ciphers with Small Blocks
- Better security-efficiency trade-offs in permutation-based two-party computation
- Strengthening the known-key security notion for block ciphers
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- WEM: a new family of white-box block ciphers based on the Even-Mansour construction
- On the security of keyed hashing based on public permutations
- Reflections on slide with a twist attacks
- Farasha: a provable permutation-based parallelizable PRF
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- Tight security analysis of 3-round key-alternating cipher with a single permutation
- Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher
- The iterated random permutation problem with applications to cascade encryption
- Post-quantum security of the Even-Mansour cipher
- More accurate results on the provable security of AES against impossible differential cryptanalysis
- Provable security against generic attacks on stream ciphers
- Pseudorandomness of Camellia-like scheme
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Energy consumption of protected cryptographic hardware cores. An experimental study
- The exact multi-user security of (tweakable) key alternating ciphers with a single permutation
- Propagation properties of a non-linear mapping based on squaring in odd characteristic
- Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model
- Security analysis of Even-Mansour structure hash functions
- Improved key-recovery attacks on reduced-round WEM-8
- Tight security for key-alternating ciphers with correlated sub-keys
- Almost universal forgery attacks on AES-based MAC's
- Slidex attacks on the Even-Mansour encryption scheme
- Truncated differential cryptanalysis: new insights and application to \texttt{QARMAv1}-\(n\) and \texttt{QARMAv2}-64
- The state diagram of $$\chi $$
- Quantum key-recovery attack on Feistel constructions: Bernstein-Vazirani meet Grover algorithm
- Output masking of tweakable Even-Mansour can be eliminated for message authentication code
- Cryptanalytic time-memory-data trade-offs for FX-constructions and the affine equivalence problem
- Quantum key recovery attacks on tweakable Even-Mansour ciphers
- Cryptanalysis of reduced round SPEEDY
- Designing tweakable enciphering schemes using public permutations
- BBB secure nonce based MAC using public permutations
- Multi-user BBB security of public permutations based MAC
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- On a mnemonic construction of permutations
- An observation on NORX, BLAKE2, and ChaCha
- Generic attacks on the Lai-Massey scheme
This page was built for publication: A construction of a cipher from a single pseudorandom permutation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364898)
