@conference {Wang05findingcollisions,
	title = {Finding Collisions in the Full SHA-1},
	booktitle = {In Proceedings of Crypto},
	year = {2005},
	pages = {17{\textendash}36},
	publisher = {Springer},
	organization = {Springer},
	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 2 69 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 2 80 theoretical bound. Keywords: Hash functions, collision search attacks, SHA-1, SHA-0. 1},
	keywords = {cryptography},
	isbn = {978-3-540-28114-6},
	doi = {10.1007/11535218},
	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4261},
	author = {Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu}
}

{"_id":"EaBREJaAu98PAiivi","bibbaseid":"wang-yin-yu-findingcollisionsinthefullsha1-2005","downloads":0,"creationDate":"2018-07-03T04:50:28.639Z","title":"Finding Collisions in the Full SHA-1","author_short":["Wang, X.","Yin, Y. L.","Yu, H."],"year":2005,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Finding Collisions in the Full SHA-1","booktitle":"In Proceedings of Crypto","year":"2005","pages":"17\\textendash36","publisher":"Springer","organization":"Springer","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 2 69 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 2 80 theoretical bound. Keywords: Hash functions, collision search attacks, SHA-1, SHA-0. 1","keywords":"cryptography","isbn":"978-3-540-28114-6","doi":"10.1007/11535218","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4261","author":[{"firstnames":["Xiaoyun"],"propositions":[],"lastnames":["Wang"],"suffixes":[]},{"firstnames":["Yiqun","Lisa"],"propositions":[],"lastnames":["Yin"],"suffixes":[]},{"firstnames":["Hongbo"],"propositions":[],"lastnames":["Yu"],"suffixes":[]}],"bibtex":"@conference {Wang05findingcollisions,\n\ttitle = {Finding Collisions in the Full SHA-1},\n\tbooktitle = {In Proceedings of Crypto},\n\tyear = {2005},\n\tpages = {17{\\textendash}36},\n\tpublisher = {Springer},\n\torganization = {Springer},\n\tabstract = {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 2 69 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 2 80 theoretical bound. Keywords: Hash functions, collision search attacks, SHA-1, SHA-0. 1},\n\tkeywords = {cryptography},\n\tisbn = {978-3-540-28114-6},\n\tdoi = {10.1007/11535218},\n\turl = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4261},\n\tauthor = {Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu}\n}\n","author_short":["Wang, X.","Yin, Y. L.","Yu, H."],"key":"Wang05findingcollisions","id":"Wang05findingcollisions","bibbaseid":"wang-yin-yu-findingcollisionsinthefullsha1-2005","role":"author","urls":{"Paper":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.4261"},"keyword":["cryptography"],"downloads":0},"search_terms":["finding","collisions","full","sha","wang","yin","yu"],"keywords":["cryptography"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}