اس‌اچ‌ای-۱ (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "اس‌اچ‌ای-۱" in Persian language version.

refsWebsite

Global rank Persian rank

8iacr.org

5,032^nd place

low place

4web.archive.org

1^st place

3schneier.com

8,888^th place

low place

3doi.org

2^nd place

2tugraz.at

low place

1x5.net

low place

1books.google.com

3^rd place

6^th place

1federalregister.gov

2,474^th place

low place

1stackexchange.com

1,983^rd place

3,947^th place

1phys.org

1,283^rd place

2,082^nd place

1googleblog.com

1,272^nd place

8,775^th place

1shattered.io

low place

1cryptopp.com

low place

1tue.nl

9,054^th place

low place

1noekeon.org

low place

1mit.edu

415^th place

696^th place

1zdnet.com

786^th place

1,499^th place

1heise-online.co.uk

low place

1yp.to

low place

1sharcs.org

low place

1code.google.com

4,942^nd place

low place

1sites.google.com

626^th place

1,898^th place

1marc-stevens.nl

low place

1inria.fr

4,903^rd place

low place

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 Project Hosting".

cryptopp.com

"Crypto++ 5.6.0 Benchmarks". Archived from the original on 15 October 2008. Retrieved 2011-02-27.

doi.org

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. 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). Advances in Cryptology – EUROCRYPT 2019. Lecture Notes in Computer Science. Vol. 11478. pp. 527–555. doi:10.1007/978-3-030-17659-4_18. ISBN 978-3-030-17658-7.

federalregister.gov

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

googleblog.com

security.googleblog.com

"Announcing the first SHA1 collision". Google Online Security Blog. 2017-02-23.

heise-online.co.uk

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

iacr.org

eprint.iacr.org

"Cryptology ePrint Archive: Report 2005/010".
Notes on the Wang et al. 2⁶³ SHA-1 Differential Path
"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). Retrieved 2011-05-19. {{cite journal}}: Cite journal requires |journal= (help)
"Cryptology ePrint Archive: Report 2009/259".
Gaëtan Leurent; Thomas Peyrin (2019-04-24). "From Collisions to Chosen-Prefix Collisions - Application to Full SHA-1" (PDF). Eurocrypt 2019.
Gaëtan Leurent; Thomas Peyrin (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.

iacr.org

"Crypto 2006 Rump Schedule".

inria.fr

hal.inria.fr

Leurent, Gaëtan; Peyrin, Thomas (2019). "From Collisions to Chosen-Prefix Collisions Application to Full SHA-1" (PDF). Advances in Cryptology – EUROCRYPT 2019. Lecture Notes in Computer Science. Vol. 11478. pp. 527–555. doi:10.1007/978-3-030-17659-4_18. ISBN 978-3-030-17658-7.

marc-stevens.nl

Marc Stevens (2012-06-19). "Attacks on Hash Functions and Applications" (PDF). PHD Thesis.

mit.edu

theory.csail.mit.edu

Collision Search Attacks on SHA1 بایگانی‌شده در ۲۰۰۵-۰۲-۱۹ توسط Wayback Machine, Massachusetts Institute of Technology

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.

phys.org

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

schneier.com

sharcs.org

2012.sharcs.org

Cryptanalysis of MD5 & SHA-1

shattered.io

"SHAttered". Retrieved 2017-02-23.

sites.google.com

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

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 (دسامبر ۳۰, ۲۰۰۸). "MD5 considered harmful today: Creating a rogue CA certificate". Retrieved March 29, 2009.