A Three-Property-Secure Hash Function
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- A composition theorem for universal one-way hash functions
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient Collision Search Attacks on SHA-0
- Fast Software Encryption
- Finding Collisions in the Full SHA-1
- Formalizing human ignorance
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- How to Break MD5 and Other Hash Functions
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- Second Preimage Attacks on Dithered Hash Functions
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Seven-Property-Preserving Iterated Hashing: ROX
- Strengthening Digital Signatures Via Randomized Hashing
Cited in
(9)- How to Fill Up Merkle-Damgård Hash Functions
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders
- Extended Multi-Property-Preserving and ECM-Construction
- Fast Software Encryption
- Provable second preimage resistance revisited
- Quantum security of hash functions and property-preservation of iterated hashing
- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
- Seven-Property-Preserving Iterated Hashing: ROX
- Open problems in hash function security
This page was built for publication: A Three-Property-Secure Hash Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644203)