The key-dependent message security of key-alternating Feistel ciphers
From MaRDI portal
Publication:826271
DOI10.1007/978-3-030-75539-3_15zbMath1479.94168OpenAlexW3159722302MaRDI QIDQ826271
Pooya Farshim, Yannick Seurin, Damien Vergnaud, Louiza Khati
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_15
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The key-dependent message security of key-alternating Feistel ciphers
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Indifferentiability of 8-Round Feistel Networks
- Minimizing the Two-Round Even-Mansour Cipher
- Security Analysis of Key-Alternating Feistel Ciphers
- The Related-Key Analysis of Feistel Constructions
- The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
- Full Disk Encryption: Bridging Theory and Practice
- Key-Dependent Message Security: Generic Amplification and Completeness
- On Generalized Feistel Networks
- Circular-Secure Encryption from Decision Diffie-Hellman
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- The “Coefficients H” Technique
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Two practical and provably secure block ciphers: BEAR and LION
- New block encryption algorithm MISTY
- About Feistel Schemes with Six (or More) Rounds
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- Advances in Cryptology – CRYPTO 2004
- Tight Security Bounds for Key-Alternating Ciphers
This page was built for publication: The key-dependent message security of key-alternating Feistel ciphers