Building Secure Block Ciphers on Generic Attacks Assumptions

DOI10.1007/978-3-642-04159-4_5zbMath1256.94061MaRDI QIDQ3644193

Jacques Patarin, Yannick Seurin

Publication date: 3 November 2009

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04159-4_5

zbMATH Keywords

block ciphers; provable security; generic attacks; Feistel schemes

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

The “Coefficients H” Technique

Uses Software

• QUAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Another look at ``provable security
• Decorrelation: a theory for block cipher security
• Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
• Foiling Birthday Attacks in Length-Doubling Transformations
• On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
• How to Protect DES Against Exhaustive Key Search
• Perfect Block Ciphers with Small Blocks
• QUAD: A Practical Stream Cipher with Provable Security
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• Generic Attacks on Feistel Networks with Internal Permutations
• A Simple Unpredictable Pseudo-Random Number Generator
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Two practical and provably secure block ciphers: BEAR and LION
• About Feistel Schemes with Six (or More) Rounds
• Advances in Cryptology – CRYPTO 2004
• Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
• Dial C for Cipher
• KFC – The Krazy Feistel Cipher
• Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
• Information Security and Cryptology - ICISC 2005
• The security of the cipher block chaining message authentication code