Preimage resistance of LPmkr with r=m-1

DOI10.1016/J.IPL.2010.05.009zbMATH Open1234.68094OpenAlexW1581586331MaRDI QIDQ765490FDOQ765490

Je Hong Park, Jooyoung Lee

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.009

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

zbMATH Keywords

cryptographycompression functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Title not available (Why is that?)
• On the Indifferentiability of the Sponge Construction
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Title not available (Why is that?)
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Some Plausible Constructions of Double-Block-Length Hash Functions
• How to Build a Hash Function from Any Collision-Resistant Function
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Provably Secure Double-Block-Length Hash Functions in a Black-Box 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)