Concept

Collision resistance

OpenAlex ID: C150909736

Universal classes of hash functions

1979 · J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 2,540

How to Break MD5 and Other Hash Functions

2005 · Xiaoyun Wang, Hongbo Yu · Lecture notes in computer science · 1,465

Finding Collisions in the Full SHA-1

2005 · Xiaoyun Wang, Yiqun Lisa Yin, et al. · Lecture notes in computer science · 1,443

Universal one-way hash functions and their cryptographic applications

1989 · M. Naor, M. Yung · ACM Symposium on Theory of Computing (STOC) · 982

PDF

SHA-3 standard :

2015 · 940

PDF

Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance

2004 · Phillip Rogaway, Thomas Shrimpton · Lecture notes in computer science · 630

The PHOTON Family of Lightweight Hash Functions

2011 · Jian Guo, Thomas Peyrin, et al. · Lecture notes in computer science · 580

An Efficient Signature Scheme from Bilinear Pairings and Its Applications

2004 · Fangguo Zhang, Reihaneh Safavi-Naini, et al. · Lecture notes in computer science · 529

Merkle-Damgård Revisited: How to Construct a Hash Function

2005 · Jean-Sébastien Coron, Yevgeniy Dodis, et al. · Lecture notes in computer science · 512

Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD

2004 · Xiaoyun Wang, Dengguo Feng, et al. · IACR Cryptology ePrint Archive · 455

Cryptanalysis of the Hash Functions MD4 and RIPEMD

2005 · Xiaoyun Wang, Xuejia Lai, et al. · Lecture notes in computer science · 445

Efficient Collision Search Attacks on SHA-0

2005 · Xiaoyun Wang, Hongbo Yu, et al. · Lecture notes in computer science · 412

PDF

Cryptographic Hash Functions from Expander Graphs

2007 · Denis X. Charles, Kristin E. Lauter, et al. · Journal of Cryptology · 395

PDF

Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions

2008 · Martijn Stam · Lecture notes in computer science · 359

Quantum lower bounds for the collision and the element distinctness problems

2004 · Scott Aaronson, Yaoyun Shi · Journal of the ACM · 356

New Proofs for NMAC and HMAC: Security Without Collision-Resistance

2006 · Mihir Bellare · Lecture notes in computer science · 349

PDF

Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV

2002 · John Black, Phillip Rogaway, et al. · Lecture notes in computer science · 338

Generalized Compact Knapsacks Are Collision Resistant

2006 · Vadim Lyubashevsky, Daniele Micciancio · Lecture notes in computer science · 291

Quark: A Lightweight Hash

2010 · Jean-Philippe Aumasson, Luca Henzen, et al. · Lecture notes in computer science · 290

Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?

1998 · Daniel R. Simon · Lecture notes in computer science · 287

Hash Functions Based on Block Ciphers

2007 · Xucjia Lai, James L. Massey · Springer eBooks · 247

Locality-sensitive hashing scheme based on dynamic collision counting

2012 · Junhao Gan, Jianlin Feng, et al. · ACM SIGMOD International Conference on Management of Data (SIGMOD) · 242

XMSS: eXtended Merkle Signature Scheme

2018 · A. Huelsing, D. Butin, et al. · 235

Herding Hash Functions and the Nostradamus Attack

2006 · John Kelsey, Tadayoshi Kohno · Lecture notes in computer science · 220

PDF

Finding Preimages in Full MD5 Faster Than Exhaustive Search

2009 · Yu Sasaki, Kazumaro Aoki · Lecture notes in computer science · 219

Works count: 1,731

Citation count: 30,050