Conference ProceedingsOPEN ACCESS

Finding collisions in the full SHA-1

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3621 LNCS 17-36
DOI: 10.1007/11535218_2
781Citations
Citations of this article
262Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound. © International Association for Cryptologic Research 2005.

Author supplied keywords

Cite

CITATION STYLE

APA

Wang, X., Yin, Y. L., & Yu, H. (2006). Finding collisions in the full SHA-1. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3621 LNCS, pp. 17–36). https://doi.org/10.1007/11535218_2

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