生日攻击 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "生日攻击" in Chinese language version.

refsWebsite

Global rank Chinese rank

5web.archive.org

1^st place

1yp.to

low place

7,987^th place

1springer.com

274^th place

320^th place

1doi.org

2^nd place

23^rd place

1mathforum.org

low place

7,588^th place

1webcitation.org

24^th place

29^th place

1iacr.org

5,032^nd place

5,199^th place

1arxiv.org

69^th place

254^th place

1psu.edu

207^th place

628^th place

1mathworks.com

6,214^th place

3,185^th place

arxiv.org

Gray, Jim; van Ingen, Catharine. Empirical Measurements of Disk Failure Rates and Error Rates. 25 January 2007. arXiv:cs/0701166 .

doi.org

Brassard, Gilles; HØyer, Peter; Tapp, Alain. Quantum cryptanalysis of hash and claw-free functions. Springer, Berlin, Heidelberg: 163–169. 20 April 1998 [29 October 2017]. doi:10.1007/BFb0054319. （原始内容存档于2020-08-08）.

iacr.org

eprint.iacr.org

Jacques Patarin, Audrey Montreuil. Benes and Butterfly schemes revisited (PostScript, 可移植文档格式). Université de Versailles. 2005 [2007-03-15]. （原始内容存档于2007-09-29）.

mathforum.org

Math Forum: Ask Dr. Math FAQ: The Birthday Problem. Mathforum.org. [29 October 2017]. （原始内容存档于2013-07-22）.

mathworks.com

Compute log(1+x) accurately for small values of x. Mathworks.com. [29 October 2017]. （原始内容存档于2012-08-30）.

psu.edu

citeseer.ist.psu.edu

Archived copy. [2006-05-02]. （原始内容存档于2008-02-23）.

springer.com

link.springer.com

Brassard, Gilles; HØyer, Peter; Tapp, Alain. Quantum cryptanalysis of hash and claw-free functions. Springer, Berlin, Heidelberg: 163–169. 20 April 1998 [29 October 2017]. doi:10.1007/BFb0054319. （原始内容存档于2020-08-08）.

web.archive.org

Daniel J. Bernstein. Cost analysis of hash collisions : Will quantum computers make SHARCS obsolete? (PDF). Cr.yp.to. [29 October 2017]. （原始内容存档 (PDF)于2017-08-25）.
Brassard, Gilles; HØyer, Peter; Tapp, Alain. Quantum cryptanalysis of hash and claw-free functions. Springer, Berlin, Heidelberg: 163–169. 20 April 1998 [29 October 2017]. doi:10.1007/BFb0054319. （原始内容存档于2020-08-08）.
Jacques Patarin, Audrey Montreuil. Benes and Butterfly schemes revisited (PostScript, 可移植文档格式). Université de Versailles. 2005 [2007-03-15]. （原始内容存档于2007-09-29）.
Archived copy. [2006-05-02]. （原始内容存档于2008-02-23）.
Compute log(1+x) accurately for small values of x. Mathworks.com. [29 October 2017]. （原始内容存档于2012-08-30）.

webcitation.org

Math Forum: Ask Dr. Math FAQ: The Birthday Problem. Mathforum.org. [29 October 2017]. （原始内容存档于2013-07-22）.

yp.to

cr.yp.to

Daniel J. Bernstein. Cost analysis of hash collisions : Will quantum computers make SHARCS obsolete? (PDF). Cr.yp.to. [29 October 2017]. （原始内容存档 (PDF)于2017-08-25）.