The key-dependent message security of key-alternating Feistel ciphers
type: Item
instance of: scholarly article
title: The key-dependent message security of key-alternating Feistel ciphers
zbMATH Open document ID: 1479.94168
DOI: 10.1007/978-3-030-75539-3_15
author: Pooya Farshim
author: Louiza Khati
author: Yannick Seurin
author: Damien Vergnaud
publication date: 2021-12-20T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 7449884
zbMATH Keywords: block ciphers
zbMATH Keywords: strong pseudorandom permutation
MaRDI profile type: Publication
full work available at URL: 978-3-030-75539-3 15
OpenAlex ID: W3159722302
cites work: Two practical and provably secure block ciphers: BEAR and LION
cites work: Key-Dependent Message Security: Generic Amplification and Completeness
cites work: The Related-Key Analysis of Feistel Constructions
cites work: The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
cites work: Q4413854
cites work: Circular-Secure Encryption from Decision Diffie-Hellman
cites work: A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
cites work: Minimizing the Two-Round Even-Mansour Cipher
cites work: Tight Security Bounds for Key-Alternating Ciphers
cites work: Indifferentiability of 8-Round Feistel Networks
cites work: Q4314029
cites work: On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
cites work: Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
cites work: On Generalized Feistel Networks
cites work: Q4537994
cites work: Full Disk Encryption: Bridging Theory and Practice
cites work: Security Analysis of Key-Alternating Feistel Ciphers
cites work: New block encryption algorithm MISTY
cites work: Q4279681
cites work: Q4434898
cites work: Q4950452
cites work: Q4035727
cites work: About Feistel Schemes with Six (or More) Rounds
cites work: Advances in Cryptology – CRYPTO 2004
cites work: The “Coefficients H” Technique
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
description: scientific article; zbMATH DE number 7449884