Keyed sum of permutations: a simpler RP-based PRF
From MaRDI portal
Publication:6057195
DOI10.1007/978-3-031-30872-7_22zbMath1522.94088OpenAlexW4366307356MaRDI QIDQ6057195
Yosuke Todo, Ferdinand Sibleyras
Publication date: 4 October 2023
Published in: Topics in Cryptology – CT-RSA 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-30872-7_22
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Minimizing the two-round Even-Mansour cipher
- How to build pseudorandom functions from public random permutations
- Quantum attacks on sum of Even-Mansour pseudorandom functions
- On the XOR of Multiple Random Permutations
- Indifferentiability of 8-Round Feistel Networks
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- Breaking and Repairing GCM Security Proofs
- Security Analysis of Key-Alternating Feistel Ciphers
- The Indistinguishability of the XOR of $$k$$ Permutations
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The “Coefficients H” Technique
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Tight Security Bounds for Key-Alternating Ciphers
- Advances in Cryptology - ASIACRYPT 2004
- 10-Round Feistel is Indifferentiable from an Ideal Cipher
This page was built for publication: Keyed sum of permutations: a simpler RP-based PRF
