Birthday attack (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Birthday attack" in English language version.

refsWebsite

Global rank English rank

4doi.org

2^nd place

2arxiv.org

69^th place

59^th place

1wellesley.edu

low place

7,324^th place

1yp.to

low place

8,415^th place

1semanticscholar.org

11^th place

8^th place

1ietf.org

214^th place

176^th place

1brilliant.org

low place

8,871^st place

1ucdavis.edu

1,873^rd place

1,347^th place

1springer.com

274^th place

309^th place

1iacr.org

5,032^nd place

3,357^th place

1web.archive.org

1^st place

1psu.edu

207^th place

136^th place

1mathworks.com

6,214^th place

4,509^th place

arxiv.org

Brassard, Gilles; HØyer, Peter; Tapp, Alain (20 April 1998). "Quantum cryptanalysis of hash and claw-free functions". LATIN'98: Theoretical Informatics. Lecture Notes in Computer Science. Vol. 1380. Springer, Berlin, Heidelberg. pp. 163–169. arXiv:quant-ph/9705002. doi:10.1007/BFb0054319. ISBN 978-3-540-64275-6. S2CID 118940551.
Gray, Jim; van Ingen, Catharine (25 January 2007). "Empirical Measurements of Disk Failure Rates and Error Rates". arXiv:cs/0701166.

brilliant.org

"Birthday Problem". Brilliant.org. Brilliant_(website). Retrieved 28 July 2023.

doi.org

Brassard, Gilles; HØyer, Peter; Tapp, Alain (20 April 1998). "Quantum cryptanalysis of hash and claw-free functions". LATIN'98: Theoretical Informatics. Lecture Notes in Computer Science. Vol. 1380. Springer, Berlin, Heidelberg. pp. 163–169. arXiv:quant-ph/9705002. doi:10.1007/BFb0054319. ISBN 978-3-540-64275-6. S2CID 118940551.
R. Shirey (August 2007). Internet Security Glossary, Version 2. Network Working Group. doi:10.17487/RFC4949. RFC 4949. Informational.
Flajolet, Philippe; Odlyzko, Andrew M. (1990). "Random Mapping Statistics". In Quisquater, Jean-Jacques; Vandewalle, Joos (eds.). Advances in Cryptology — EUROCRYPT '89. Lecture Notes in Computer Science. Vol. 434. Berlin, Heidelberg: Springer. pp. 329–354. doi:10.1007/3-540-46885-4_34. ISBN 978-3-540-46885-1.

dx.doi.org

Dang, Q H (2012). Recommendation for applications using approved hash algorithms (Report). Gaithersburg, MD: National Institute of Standards and Technology.

iacr.org

eprint.iacr.org

Jacques Patarin, Audrey Montreuil (2005). "Benes and Butterfly schemes revisited" (PostScript, PDF). Université de Versailles. Retrieved 2007-03-15. {{cite journal}}: Cite journal requires |journal= (help)

ietf.org

datatracker.ietf.org

R. Shirey (August 2007). Internet Security Glossary, Version 2. Network Working Group. doi:10.17487/RFC4949. RFC 4949. Informational.

mathworks.com

"Compute log(1+x) accurately for small values of x". Mathworks.com. Retrieved 29 October 2017.

psu.edu

citeseer.ist.psu.edu

"CiteSeerX". Archived from the original on 2008-02-23. Retrieved 2006-05-02.

semanticscholar.org

api.semanticscholar.org

Brassard, Gilles; HØyer, Peter; Tapp, Alain (20 April 1998). "Quantum cryptanalysis of hash and claw-free functions". LATIN'98: Theoretical Informatics. Lecture Notes in Computer Science. Vol. 1380. Springer, Berlin, Heidelberg. pp. 163–169. arXiv:quant-ph/9705002. doi:10.1007/BFb0054319. ISBN 978-3-540-64275-6. S2CID 118940551.

springer.com

link.springer.com

Flajolet, Philippe; Odlyzko, Andrew M. (1990). "Random Mapping Statistics". In Quisquater, Jean-Jacques; Vandewalle, Joos (eds.). Advances in Cryptology — EUROCRYPT '89. Lecture Notes in Computer Science. Vol. 434. Berlin, Heidelberg: Springer. pp. 329–354. doi:10.1007/3-540-46885-4_34. ISBN 978-3-540-46885-1.

ucdavis.edu

web.cs.ucdavis.edu

Bellare, Mihir; Rogaway, Phillip (2005). "The Birthday Problem". Introduction to Modern Cryptography (PDF). pp. 273–274. Retrieved 2023-03-31.

web.archive.org

"CiteSeerX". Archived from the original on 2008-02-23. Retrieved 2006-05-02.

wellesley.edu

cs.wellesley.edu

"Avoiding collisions, Cryptographic hash functions" (PDF). Foundations of Cryptography, Computer Science Department, Wellesley College.

yp.to

cr.yp.to

Daniel J. Bernstein. "Cost analysis of hash collisions : Will quantum computers make SHARCS obsolete?" (PDF). Cr.yp.to. Retrieved 29 October 2017.