Building Secure Block Ciphers on Generic Attacks Assumptions
From MaRDI portal
Recommendations
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- scientific article; zbMATH DE number 3854964
- A General Construction of Tweakable Block Ciphers and Different Modes of Operations
- A General Construction of Tweakable Block Ciphers and Different Modes of Operations
- A new type of attacks on block ciphers
- Towards a unifying view of block cipher cryptanalysis
- Attacking block ciphers
- The key-dependent attack on block ciphers
- Towards Understanding the Known-Key Security of Block Ciphers
Cites work
- A Simple Unpredictable Pseudo-Random Number Generator
- About Feistel schemes with six (or more) rounds
- Another look at ``provable security
- Decorrelation: a theory for block cipher security
- Dial C for Cipher
- Foiling birthday attacks in length-doubling transformations
- Generalized birthday attacks on unbalanced Feistel networks
- Generic Attacks on Feistel Networks with Internal Permutations
- Generic attacks on Feistel schemes
- Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- How to Protect DES Against Exhaustive Key Search
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 503342 (Why is no real title available?)
- Information Security and Cryptology - ICISC 2005
- KFC – The Krazy Feistel Cipher
- Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
- New results on pseudorandom permutation generators based on the DES scheme
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- Perfect Block Ciphers with Small Blocks
- Pseudorandom permutations based on the D. E. S. scheme
- QUAD: A Practical Stream Cipher with Provable Security
- Resistance against general iterated attacks
- Security of random Feistel schemes with 5 or more rounds
- The security of many-round Luby-Rackoff pseudo-random permutations
- The security of the cipher block chaining message authentication code
- Two practical and provably secure block ciphers: BEAR and LION
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- White-box cryptography and an AES implementation
Cited in
(13)- Symmetric block ciphers based on group bases
- Increasing block sizes using Feistel networks: the example of the AES
- Towards Understanding the Known-Key Security of Block Ciphers
- Cryptographic applications of the duplex construction
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- The Security of Elastic Block Ciphers Against Key-Recovery Attacks
- Block Ciphers Implementations Provably Secure Against Second Order Side Channel Analysis
- Provable secure scalable block ciphers.
- A General Construction of Tweakable Block Ciphers and Different Modes of Operations
- The “Coefficients H” Technique
- On the round security of symmetric-key cryptographic primitives
- Advances in Cryptology - CRYPTO 2003
- Topics in Cryptology – CT-RSA 2006
This page was built for publication: Building Secure Block Ciphers on Generic Attacks Assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644193)