Interpreting hash function security proofs

DOI10.1007/978-3-642-16280-0_8MaRDI QIDQ4933215zbMATH OpenOpenAlexWikidataFDO

Authors Juraj Šarinay

Publication date 12 October 2010

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16280-0_8

zbMATH Keywords

hash functionssecurity boundsprovable reducibility

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On Building Hash Functions from Multivariate Quadratic Equations
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• On the security of multivariate hash functions
• Open problems in hash function security
• scientific article; zbMATH DE number 177052

Cites work

• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 1024070 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 1942429 (Why is no real title available?)
• scientific article; zbMATH DE number 1406765 (Why is no real title available?)
• Advances in cryptology - CRYPTO 2002. 22nd annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2002. Proceedings
• Advances in cryptology -- EUROCRYPT 2008. 27th annual international conference on the theory and applications of cryptographic techniques, Istanbul, Turkey, April 13--17, 2008. Proceedings
• Analysis of Multivariate Hash Functions
• Analysis of QUAD
• Another Look at “Provable Security”. II
• Another look at ``provable security
• Blockcipher-Based Hashing Revisited
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
• Collisions for the LPS Expander Graph Hash Function
• Cryptanalysis of the Tillich-Zémor hash function
• Cryptographic hash functions from expander graphs
• Discrete logarithm variants of VSH
• FSBday
• Finding Collisions in the Full SHA-1
• Formalizing human ignorance
• Full Cryptanalysis of LPS and Morgenstern Hash Functions
• Generalized Compact Knapsacks Are Collision Resistant
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
• How to Break MD5 and Other Hash Functions
• On Building Hash Functions from Multivariate Quadratic Equations
• Predicting Lattice Reduction
• Progress in Cryptology – Mycrypt 2005
• Progress in cryptology -- INDOCRYPT 2006. 7th international conference on cryptology in India, Kolkata, India, December 11-13, 2006. Proceedings
• SWIFFT: A Modest Proposal for FFT Hashing
• Secure parameters for SWIFFT
• Security bounds for the design of code-based cryptosystems
• Security of VSH in the Real World
• Syndrome Based Collision Resistant Hashing
• Theory of Cryptography
• VSH, an Efficient and Provable Collision-Resistant Hash Function

Cited in

(3)

• scientific article; zbMATH DE number 1583806 (Why is no real title available?)
• Security of the Poseidon hash function against non-binary differential and linear attacks
• Security of VSH in the Real World

Describes a project that uses

Uses Software

• SWIFFTX
• Whirlpool
• SWIFFT

This page was built for publication: Interpreting hash function security proofs

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