Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1759316
- On high-rate cryptographic compression functions
- Building a Collision-Resistant Compression Function from Non-compressing Primitives
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 1024002 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- A Failure-Friendly Design Principle for Hash Functions
- A Mathematical Theory of Communication
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- Advances in Cryptology – CRYPTO 2004
- Attacks on fast double block length hash functions
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- Combining Compression Functions and Block Cipher-Based Hash Functions
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Cryptography and Coding
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- How to Build a Hash Function from Any Collision-Resistant Function
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- On the Indifferentiability of the Sponge Construction
- One Way Hash Functions and DES
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Seven-Property-Preserving Iterated Hashing: ROX
- Some Plausible Constructions of Double-Block-Length Hash Functions
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model
Cited in
(35)- Combining Compression Functions and Block Cipher-Based Hash Functions
- On the complexity of cryptographic groups and generic group models
- Salvaging Merkle-Damgård for Practical Applications
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Parallel Hashing via List Recoverability
- Security of permutation-based compression function {\textsf{lp}}231
- Hash functions from defective ideal ciphers
- Towards Understanding the Known-Key Security of Block Ciphers
- Compression Functions Using a Dedicated Blockcipher for Lightweight Hashing
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Construction of secure and fast hash functions using nonbinary error-correcting codes
- Hash functions based on three permutations: a generic security analysis
- On the impact of known-key attacks on hash functions
- Counter-bDM: a provably secure family of multi-block-length compression functions
- On high-rate cryptographic compression functions
- Half-tree: halving the cost of tree expansion in COT and DPF
- An analysis of the blockcipher-based hash functions from PGV
- Blockcipher-Based Hashing Revisited
- Building a Collision-Resistant Compression Function from Non-compressing Primitives
- Sequential indifferentiability of confusion-diffusion networks
- Strengthening the known-key security notion for block ciphers
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- Two-permutation-based hashing with binary mixing
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- On the impossibility of highly-efficient blockcipher-based hash functions
- Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
- Compactness of hashing modes and efficiency beyond Merkle tree
- The security of tandem-DM in the ideal cipher model
- Open problems in hash function security
- On the XOR of multiple random permutations
- Hashing garbled circuits for free
- MJH: a faster alternative to MDC-2
- How to Build a Hash Function from Any Collision-Resistant Function
- MJH: a faster alternative to MDC-2
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
This page was built for publication: Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600233)
