Stam's conjecture and threshold phenomena in collision resistance

DOI10.1007/978-3-642-32009-5_23MaRDI QIDQ2914271zbMATH OpenOpenAlexFDO

Authors John P. Steinberger, Xiaoming Sun, Zhe Yang

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32009-5_23

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Stam's collision resistance conjecture
• On the collision and preimage resistance of certain two-call hash functions
• Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Building a Collision-Resistant Compression Function from Non-compressing Primitives

Cited in

(7)

• Parallel Hashing via List Recoverability
• Compactness of hashing modes and efficiency beyond Merkle tree
• Colliding stacks: A large deviations analysis
• Optimal collision security in double block length hashing with single length key
• Open problems in hash function security
• Stam's collision resistance conjecture
• Information Security and Cryptology - ICISC 2003

This page was built for publication: Stam's conjecture and threshold phenomena in collision resistance

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