Preimage resistance of LPmkr with r=m-1
From MaRDI portal
Publication:765490
Recommendations
- Security of permutation-based compression function {\textsf{lp}}231
- Attacking the Knudsen-Preneel Compression Functions
- The preimage security of double-block-length compression functions
- Hash functions based on three permutations: a generic security analysis
- Provable security of the Knudsen-Preneel compression functions
Cites work
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- How to Build a Hash Function from Any Collision-Resistant Function
- On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
- On the Indifferentiability of the Sponge Construction
- Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Some Plausible Constructions of Double-Block-Length Hash Functions
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model
This page was built for publication: Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765490)