A Failure-Friendly Design Principle for Hash Functions
From MaRDI portal
Publication:5451086
Recommendations
Cited in
(36)- Slide Attacks on a Class of Hash Functions
- Expedient Non-malleability Notions for Hash Functions
- Collisions for RC4-Hash
- Building indifferentiable compression functions from the PGV compression functions
- Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
- Security analysis of randomize-hash-then-sign digital signatures
- Extended Multi-Property-Preserving and ECM-Construction
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
- Analysis of the Hash Function Design Strategy Called SMASH
- Simple hash function using discrete-time quantum walks
- How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
- Cryptanalysis of MDC-2
- Fast correlation attack on stream cipher ABC v3
- One-key compression function based MAC with security beyond birthday bound
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Hash function based on quantum walks
- Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL
- The Hash Function Family LAKE
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- Hash function requirements for Schnorr signatures
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Boomerang Distinguisher for the SIMD-512 Compression Function
- scientific article; zbMATH DE number 7647212 (Why is no real title available?)
- Boosting Merkle-Damgård Hashing for Message Authentication
- A simple variant of the Merkle-Damgård scheme with a permutation
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Multilane HMAC— Security beyond the Birthday Limit
- New second-preimage attacks on hash functions
- Optimal collision security in double block length hashing with single length key
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- Collisions for Round-Reduced LAKE
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
- Hash functions from defective ideal ciphers
- How to Fill Up Merkle-Damgård Hash Functions
This page was built for publication: A Failure-Friendly Design Principle for Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451086)
