Skip to main content
Conference ProceedingsOPEN ACCESS

Efficient collision search attacks on SHA-0

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3621 LNCS 1-16
DOI: 10.1007/11535218_1
153Citations
Citations of this article
84Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find collisions of the full 80-step SHA-0 with complexity less than 239 hash operations. © International Association for Cryptologic Research 2005.

Author supplied keywords

Cite

CITATION STYLE

APA

Wang, X., Yu, H., & Yin, Y. L. (2006). Efficient collision search attacks on SHA-0. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3621 LNCS, pp. 1–16). https://doi.org/10.1007/11535218_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free