Security of iterated hash functions based on block ciphers
From MaRDI portal
Recommendations
Cited in
(17)- More secure version of a Cayley hash function
- Security analysis of randomize-hash-then-sign digital signatures
- On the Security of Hash Functions Employing Blockcipher Postprocessing
- A provably secure non-iterative hash function resisting birthday attack
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 1951621 (Why is no real title available?)
- A new hash function based on block cipher
- scientific article; zbMATH DE number 1759316 (Why is no real title available?)
- Cryptographic Hash Functions and Some Applications to Information Security
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- Cryptanalysis of the CRUSH Hash Function
- Increasing the security of hash functions
- Hash Functions and RFID Tags: Mind the Gap
- Block-cipher-based tree hashing
- Attacks on a double length blockcipher-based hash proposal
This page was built for publication: Security of iterated hash functions based on block ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341765)