Towards Understanding the Known-Key Security of Block Ciphers
From MaRDI portal
Recommendations
- Strengthening the known-key security notion for block ciphers
- The key-dependent attack on block ciphers
- Known-Key Distinguishers for Some Block Ciphers
- Fast Software Encryption
- Building Secure Block Ciphers on Generic Attacks Assumptions
- Known and Chosen Key Differential Distinguishers for Block Ciphers
- scientific article; zbMATH DE number 3854964
- Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks
- scientific article; zbMATH DE number 1406792
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 176558 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 503342 (Why is no real title available?)
- scientific article; zbMATH DE number 697813 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1455107 (Why is no real title available?)
- scientific article; zbMATH DE number 1426196 (Why is no real title available?)
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- About Feistel schemes with six (or more) rounds
- Advances in Cryptology – CRYPTO 2004
- Biclique Cryptanalysis of the Full AES
- Blockcipher-Based Hashing Revisited
- Building a Collision-Resistant Compression Function from Non-compressing Primitives
- Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Decorrelation: a theory for block cipher security
- Distinguisher and Related-Key Attack on the Full AES-256
- Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks
- Hash functions based on three permutations: a generic security analysis
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Improved known-key distinguishers on Feistel-SP ciphers and application to Camellia
- Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Known and Chosen Key Differential Distinguishers for Block Ciphers
- Known-Key Distinguishers for Some Block Ciphers
- Known-key distinguishers on 11-round Feistel and collision attacks on its hashing modes
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- New Impossible Differential and Known-Key Distinguishers for the 3D Cipher
- On generalized Feistel networks
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- On the Indifferentiability of the Sponge Construction
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- On the indifferentiability of the Grøstl hash function
- On the public indifferentiability and correlation intractability of the 6-round Feistel construction
- Optimal collision security in double block length hashing with single length key
- Related-Key Cryptanalysis of the Full AES-192 and AES-256
- Salvaging Merkle-Damgård for Practical Applications
- Security analysis of the mode of JH hash function
- Some Plausible Constructions of Double-Block-Length Hash Functions
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- The Wide Trail Design Strategy
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Theory of Cryptography
- Theory of Cryptography
Cited in
(14)- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- Strong Knowledge Extractors for Public-Key Encryption Schemes
- Known and Chosen Key Differential Distinguishers for Block Ciphers
- On the impact of known-key attacks on hash functions
- XPX: generalized tweakable Even-Mansour with improved security guarantees
- Public-seed pseudorandom permutations
- scientific article; zbMATH DE number 2081067 (Why is no real title available?)
- Known-Key Distinguishers for Some Block Ciphers
- Sequential indifferentiability of confusion-diffusion networks
- Strengthening the known-key security notion for block ciphers
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- Building Secure Block Ciphers on Generic Attacks Assumptions
- Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks
- Revisiting Gilbert's known-key distinguisher
This page was built for publication: Towards Understanding the Known-Key Security of Block Ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946886)
