SHA-1 (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "SHA-1" in English language version.

refsWebsite

Global rank English rank

10iacr.org

5,032^nd place

3,357^th place

8web.archive.org

1^st place

8doi.org

2^nd place

6schneier.com

8,888^th place

6,276^th place

6nist.gov

355^th place

454^th place

2shattered.io

low place

2googleblog.com

1,272^nd place

837^th place

2noekeon.org

low place

2springer.com

274^th place

309^th place

2semanticscholar.org

11^th place

8^th place

2tugraz.at

low place

2yp.to

low place

8,415^th place

1marc-stevens.nl

low place

1handle.net

102^nd place

76^th place

1worldcat.org

5^th place

1mozilla.org

1,686^th place

1,293^rd place

1ntu.edu.sg

low place

1venturebeat.com

616^th place

430^th place

1sites.google.com

626^th place

690^th place

1arstechnica.com

388^th place

265^th place

1phys.org

1,283^rd place

1,130^th place

1microsoft.com

153^rd place

151^st place

1x5.net

low place

1books.google.com

3^rd place

1federalregister.gov

2,474^th place

1,469^th place

1stackexchange.com

1,983^rd place

1,330^th place

1youtube.com

9^th place

13^th place

1marc.info

low place

8,542^nd place

1gitlab.com

low place

9,569^th place

1docs.rs

low place

1tue.nl

9,054^th place

6,363^rd place

1freedom-to-tinker.com

low place

1sdu.edu.cn

low place

1mit.edu

415^th place

327^th place

1zdnet.com

786^th place

558^th place

1heise-online.co.uk

low place

1sharcs.org

low place

1code.google.com

4,942^nd place

4,061^st place

1inria.fr

4,903^rd place

3,679^th place

1faqs.org

4,871^st place

4,382^nd place

1intel.com

1,118^th place

825^th place

1github.com

383^rd place

320^th place

1github.blog

low place

arstechnica.com

Goodin, Dan (2016-05-04). "Microsoft to retire support for SHA1 certificates in the next 4 months". Ars Technica. Retrieved 2019-05-29.

books.google.com

Selvarani, R.; Aswatha, Kumar; T V Suresh, Kumar (2012). Proceedings of International Conference on Advances in Computing. Springer Science & Business Media. p. 551. ISBN 978-81-322-0740-5.

code.google.com

"Google Code Archive – Long-term storage for Google Code Project Hosting". code.google.com.

docs.rs

Walfield, Neal H. (2020). "openpgp: Pass the hash algo's security reqs to Policy::signature". gitlab.com/sequoia-pgp. – see section "Background" in the rendered documentation

doi.org

Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik (2017). Katz, Jonathan; Shacham, Hovav (eds.). The First Collision for Full SHA-1 (PDF). Advances in Cryptology – CRYPTO 2017. Lecture Notes in Computer Science. Vol. 10401. Springer. pp. 570–596. doi:10.1007/978-3-319-63688-7_19. ISBN 9783319636870. Archived from the original (PDF) on May 15, 2018. Retrieved February 23, 2017.
- Marc Stevens; Elie Bursztein; Pierre Karpman; Ange Albertini; Yarik Markov; Alex Petit Bianco; Clement Baisse (February 23, 2017). "Announcing the first SHA1 collision". Google Security Blog.
- "Secure Hash Standard (SHS)" (PDF). National Institute of Standards and Technology. 2015. doi:10.6028/NIST.FIPS.180-4. Federal Information Processing Standards Publication 180-4. Archived from the original (PDF) on 2020-01-07. Retrieved 2019-09-23.
- Barker, Elaine (May 2020). Recommendation for Key Management: Part 1 – General, Table 3 (Technical Report). NIST. p. 56. doi:10.6028/NIST.SP.800-57pt1r5.
- Chabaud, Florent; Joux, Antoine (October 3, 1998). "Differential collisions in SHA-0". In Krawczyk, Hugo (ed.). Advances in Cryptology – CRYPTO '98. Lecture Notes in Computer Science. Vol. 1462. Springer. pp. 56–71. doi:10.1007/BFb0055720. ISBN 978-3-540-64892-5 – via Springer Link.
- Manuel, Stéphane; Peyrin, Thomas (2008-02-11). Collisions on SHA-0 in One Hour (PDF). Fast Software Encryption 2008. Lecture Notes in Computer Science. Vol. 5086. pp. 16–35. doi:10.1007/978-3-540-71039-4_2. ISBN 978-3-540-71038-7.
- De Cannière, Christophe; Rechberger, Christian (2006-11-15). "Finding SHA-1 Characteristics: General Results and Applications". Advances in Cryptology – ASIACRYPT 2006. Lecture Notes in Computer Science. Vol. 4284. pp. 1–20. doi:10.1007/11935230_1. ISBN 978-3-540-49475-1.
- Manuel, Stéphane (2011). "Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1". Designs, Codes and Cryptography. 59 (1–3): 247–263. doi:10.1007/s10623-010-9458-9. S2CID 47179704. the most efficient disturbance vector is Codeword2 first reported by Jutla and Patthak
- Leurent, Gaëtan; Peyrin, Thomas (2019). "From Collisions to Chosen-Prefix Collisions Application to Full SHA-1" (PDF). In Yuval Ishai; Vincent Rijmen (eds.). Advances in Cryptology – EUROCRYPT 2019 (PDF). 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019. Lecture Notes in Computer Science. Vol. 11478. Springer. pp. 527–555. doi:10.1007/978-3-030-17659-4_18. ISBN 978-3-030-17658-7. S2CID 153311244.

faqs.org

"RFC 3174 - US Secure Hash Algorithm 1 (SHA1) (RFC3174)". www.faqs.org.

federalregister.gov

Kramer, Samuel (11 July 1994). "Proposed Revision of Federal Information Processing Standard (FIPS) 180, Secure Hash Standard". Federal Register.

freedom-to-tinker.com

"Report from Crypto 2004". Archived from the original on 2004-08-21. Retrieved 2004-08-23.

github.blog

King, Jeff (10 May 2017). "Git 2.13 has been released". The GitHub Blog.

github.com

Stevens, Marc (2017). "cr-marcstevens/sha1collisiondetection: Library and command line tool to detect SHA-1 collision in a file".

gitlab.com

Walfield, Neal H. (2020). "openpgp: Pass the hash algo's security reqs to Policy::signature". gitlab.com/sequoia-pgp. – see section "Background" in the rendered documentation

googleblog.com

security.googleblog.com

Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik (2017). Katz, Jonathan; Shacham, Hovav (eds.). The First Collision for Full SHA-1 (PDF). Advances in Cryptology – CRYPTO 2017. Lecture Notes in Computer Science. Vol. 10401. Springer. pp. 570–596. doi:10.1007/978-3-319-63688-7_19. ISBN 9783319636870. Archived from the original (PDF) on May 15, 2018. Retrieved February 23, 2017.
- Marc Stevens; Elie Bursztein; Pierre Karpman; Ange Albertini; Yarik Markov; Alex Petit Bianco; Clement Baisse (February 23, 2017). "Announcing the first SHA1 collision". Google Security Blog.
- Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik. The first collision for full SHA-1 (PDF) (Technical report). Google Research.
  - Marc Stevens; Elie Bursztein; Pierre Karpman; Ange Albertini; Yarik Markov; Alex Petit Bianco; Clement Baisse (February 23, 2017). "Announcing the first SHA1 collision". Google Security Blog.

handle.net

hdl.handle.net

Stevens, Marc (June 19, 2012). Attacks on Hash Functions and Applications (PDF) (PhD thesis). Leiden University. hdl:1887/19093. ISBN 9789461913173. OCLC 795702954.

heise-online.co.uk

"heise online – IT-News, Nachrichten und Hintergründe". heise online. 27 August 2023.

iacr.org

eprint.iacr.org

Leurent, Gaëtan; Peyrin, Thomas (2020-01-05). "SHA-1 is a Shambles First Chosen-Prefix Collision on SHA-1 and Application to the PGP Web of Trust" (PDF). Cryptology ePrint Archive, Report 2020/014.
Rijmen, Vincent; Oswald, Elisabeth (2005). "Update on SHA-1". Cryptology ePrint Archive.
Cochran, Martin (2007). "Notes on the Wang et al. 2⁶³ SHA-1 Differential Path". Cryptology ePrint Archive.
"Collisions for 72-step and 73-step SHA-1: Improvements in the Method of Characteristics". Retrieved 2010-07-24.
Manuel, Stéphane. "Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1" (PDF). Cryptology ePrint Archive. Retrieved 2011-05-19.
McDonald, Cameron; Hawkes, Philip; Pieprzyk, Josef (2009). "Differential Path for SHA-1 with complexity O(²⁵²)". Cryptology ePrint Archive. (withdrawn)
Leurent, Gaëtan; Peyrin, Thomas (2019). "From Collisions to Chosen-Prefix Collisions Application to Full SHA-1" (PDF). In Yuval Ishai; Vincent Rijmen (eds.). Advances in Cryptology – EUROCRYPT 2019 (PDF). 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019. Lecture Notes in Computer Science. Vol. 11478. Springer. pp. 527–555. doi:10.1007/978-3-030-17659-4_18. ISBN 978-3-030-17658-7. S2CID 153311244.
Tao, Xie; Liu, Fanbao; Feng, Dengguo (2013). Fast Collision Attack on MD5 (PDF). Cryptology ePrint Archive (Technical report). IACR.

iacr.org

Biham, Eli; Chen, Rafi. "Near-Collisions of SHA-0" (PDF).
"Crypto 2006 Rump Schedule". www.iacr.org.

inria.fr

hal.inria.fr

Leurent, Gaëtan; Peyrin, Thomas (2019). "From Collisions to Chosen-Prefix Collisions Application to Full SHA-1" (PDF). In Yuval Ishai; Vincent Rijmen (eds.). Advances in Cryptology – EUROCRYPT 2019 (PDF). 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019. Lecture Notes in Computer Science. Vol. 11478. Springer. pp. 527–555. doi:10.1007/978-3-030-17659-4_18. ISBN 978-3-030-17658-7. S2CID 153311244.

intel.com

Locktyukhin, Max (2010-03-31), "Improving the Performance of the Secure Hash Algorithm (SHA-1)", Intel Software Knowledge Base, retrieved 2010-04-02

marc-stevens.nl

Stevens, Marc (June 19, 2012). Attacks on Hash Functions and Applications (PDF) (PhD thesis). Leiden University. hdl:1887/19093. ISBN 9789461913173. OCLC 795702954.

marc.info

Torvalds, Linus. "Re: Starting to think about sha-256?". marc.info. Retrieved 30 May 2016.

microsoft.com

techcommunity.microsoft.com

"SHA-1 Windows content to be retired August 3, 2020". techcommunity.microsoft.com. Retrieved 2024-02-28.

mit.edu

theory.csail.mit.edu

Collision Search Attacks on SHA1 Archived 2005-02-19 at the Wayback Machine, Massachusetts Institute of Technology

mozilla.org

blog.mozilla.org

"The end of SHA-1 on the Public Web". Mozilla Security Blog. 23 February 2017. Retrieved 2019-05-29.

nist.gov

csrc.nist.gov

"NIST.gov – Computer Security Division – Computer Security Resource Center". Archived from the original on 2011-06-25. Retrieved 2019-01-05.
Computer Security Division, Information Technology Laboratory (2017-01-04). "NIST Policy on Hash Functions – Hash Functions". CSRC, NIST. Retrieved 2023-08-27.
Computer Security Division, Information Technology Laboratory (2017-01-04). "NIST Policy on Hash Functions – Hash Functions". CSRC, NIST. Retrieved 2023-08-27.
"NIST Brief Comments on Recent Cryptanalytic Attacks on Secure Hashing Functions and the Continued Security Provided by SHA-1". 23 August 2017. Retrieved 2022-03-16.

nvlpubs.nist.gov

"Secure Hash Standard (SHS)" (PDF). National Institute of Standards and Technology. 2015. doi:10.6028/NIST.FIPS.180-4. Federal Information Processing Standards Publication 180-4. Archived from the original (PDF) on 2020-01-07. Retrieved 2019-09-23.

nist.gov

"NIST Retires SHA-1 Cryptographic Algorithm" (Press release). NIST. 2022-12-15.

noekeon.org

keccak.noekeon.org

"Strengths of Keccak – Design and security". The Keccak sponge function family. Keccak team. Retrieved 20 September 2015. Unlike SHA-1 and SHA-2, Keccak does not have the length-extension weakness, hence does not need the HMAC nested construction. Instead, MAC computation can be performed by simply prepending the message with the key.
"The Keccak sponge function family". Retrieved 2016-01-27.

ntu.edu.sg

"Critical flaw demonstrated in common digital security algorithm". Nanyang Technological University, Singapore. 24 January 2020.

phys.org

"CWI, Google announce first collision for Industry Security Standard SHA-1". Retrieved 2017-02-23.

schneier.com

"SHA-1 Broken – Schneier on Security". www.schneier.com.
"New Cryptanalytic Results Against SHA-1 – Schneier on Security". www.schneier.com.
Schneier, Bruce (February 18, 2005). "Schneier on Security: Cryptanalysis of SHA-1".
Schneier, Bruce (8 October 2015). "SHA-1 Freestart Collision". Schneier on Security.
"Schneier on Security: Cryptography Engineering". www.schneier.com. Retrieved 2023-08-27.
"When Will We See Collisions for SHA-1? – Schneier on Security". www.schneier.com.

sdu.edu.cn

infosec.sdu.edu.cn

Efficient Collision Search Attacks on SHA-0 Archived 2005-09-10 at the Wayback Machine, Shandong University

semanticscholar.org

api.semanticscholar.org

Manuel, Stéphane (2011). "Classification and Generation of Disturbance Vectors for Collision Attacks against SHA-1". Designs, Codes and Cryptography. 59 (1–3): 247–263. doi:10.1007/s10623-010-9458-9. S2CID 47179704. the most efficient disturbance vector is Codeword2 first reported by Jutla and Patthak
Leurent, Gaëtan; Peyrin, Thomas (2019). "From Collisions to Chosen-Prefix Collisions Application to Full SHA-1" (PDF). In Yuval Ishai; Vincent Rijmen (eds.). Advances in Cryptology – EUROCRYPT 2019 (PDF). 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019. Lecture Notes in Computer Science. Vol. 11478. Springer. pp. 527–555. doi:10.1007/978-3-030-17659-4_18. ISBN 978-3-030-17658-7. S2CID 153311244.

sharcs.org

2012.sharcs.org

"Cryptanalysis of MD5 & SHA-1" (PDF).

shattered.io

Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik (2017). Katz, Jonathan; Shacham, Hovav (eds.). The First Collision for Full SHA-1 (PDF). Advances in Cryptology – CRYPTO 2017. Lecture Notes in Computer Science. Vol. 10401. Springer. pp. 570–596. doi:10.1007/978-3-319-63688-7_19. ISBN 9783319636870. Archived from the original (PDF) on May 15, 2018. Retrieved February 23, 2017.
- Marc Stevens; Elie Bursztein; Pierre Karpman; Ange Albertini; Yarik Markov; Alex Petit Bianco; Clement Baisse (February 23, 2017). "Announcing the first SHA1 collision". Google Security Blog.
- Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik. The first collision for full SHA-1 (PDF) (Technical report). Google Research.
  - Marc Stevens; Elie Bursztein; Pierre Karpman; Ange Albertini; Yarik Markov; Alex Petit Bianco; Clement Baisse (February 23, 2017). "Announcing the first SHA1 collision". Google Security Blog.

sites.google.com

Stevens, Marc; Karpman, Pierre; Peyrin, Thomas. "The SHAppening: freestart collisions for SHA-1". Retrieved 2015-10-09.

springer.com

link.springer.com

Chabaud, Florent; Joux, Antoine (October 3, 1998). "Differential collisions in SHA-0". In Krawczyk, Hugo (ed.). Advances in Cryptology – CRYPTO '98. Lecture Notes in Computer Science. Vol. 1462. Springer. pp. 56–71. doi:10.1007/BFb0055720. ISBN 978-3-540-64892-5 – via Springer Link.
Manuel, Stéphane; Peyrin, Thomas (2008-02-11). Collisions on SHA-0 in One Hour (PDF). Fast Software Encryption 2008. Lecture Notes in Computer Science. Vol. 5086. pp. 16–35. doi:10.1007/978-3-540-71039-4_2. ISBN 978-3-540-71038-7.

stackexchange.com

crypto.stackexchange.com

fgrieu. "Where can I find a description of the SHA-0 hash algorithm?". Cryptography Stack Exchange.

tue.nl

win.tue.nl

Sotirov, Alexander; Stevens, Marc; Appelbaum, Jacob; Lenstra, Arjen; Molnar, David; Osvik, Dag Arne; de Weger, Benne (December 30, 2008). "MD5 considered harmful today: Creating a rogue CA certificate". Retrieved March 29, 2009.