Security of permutation-based compression function {\textsf{lp}}231

DOI10.1016/J.IPL.2014.02.008MaRDI QIDQ2446596zbMATH OpenOpenAlexFDO

Authors Jooyoung Lee, Daesung Kwon

Publication date 17 April 2014

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

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

zbMATH Keywords

cryptographyhash functionprovable securityrandom permutation modelcollision resistancepreimage resistance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Hash functions based on three permutations: a generic security analysis
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Two-permutation-based hashing with binary mixing
• Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for 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
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• 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

Cited in

(4)

• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Hash functions based on three permutations: a generic security analysis
• Two-permutation-based hashing with binary mixing
• Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)

Describes a project that uses

Uses Software

• Whirlpool

This page was built for publication: Security of permutation-based compression function {\textsf{lp}}231

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446596)