一般数体篩法 (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "一般数体篩法" in Japanese language version.

refsWebsite

Global rank Japanese rank

2^nd place

6^th place

451^st place

1,252^nd place

2web.archive.org

1^st place

1^st place

low place

low place

942^nd place

3,490^th place

102^nd place

78^th place

1hyperelliptic.org

low place

low place

low place

low place

ams.org

Pomerance, Carl (December 1996). “A Tale of Two Sieves” (PDF). Notices of the AMS 43 (12): pp. 1473–1485
Kleinjung, Thorsten (October 2006). “On polynomial selection for the general number field sieve”. Mathematics of Computation 75 (256): 2037–2047. doi:10.1090/S0025-5718-06-01870-9 2007年12月13日閲覧。.

anu.edu.au

digitalcollections.anu.edu.au

Murphy, Brian and Brent, Richard P and others (1997). On quadratic polynomials for the issue field sieve. The Australian National University. hdl:1885/40747.

cwi.nl

homepages.cwi.nl

Paul Leyland (December 12, 2003). “NFSNET: the first year”. Presentation at EIDMA-CWI Workshop on Factoring Large Numbers. August 9, 2011閲覧。

doi.org

伊豆, 哲也、小暮, 淳、下山, 武司「近年の素因数分解について」『電子情報通信学会基礎・境界ソサイエティ Fundamentals Review』第1巻第3号、電子情報通信学会、2008年、3_58–3_70、doi:10.1587/essfr.1.3_58。
Kleinjung, Thorsten (October 2006). “On polynomial selection for the general number field sieve”. Mathematics of Computation 75 (256): 2037–2047. doi:10.1090/S0025-5718-06-01870-9 2007年12月13日閲覧。.

handle.net

hdl.handle.net

Murphy, Brian and Brent, Richard P and others (1997). On quadratic polynomials for the issue field sieve. The Australian National University. hdl:1885/40747.

hyperelliptic.org

Franke, Jens (2006), On RSA 200 and larger projects

nfsnet.org

“Welcome to NFSNET” (April 23, 2007). October 22, 2007時点のオリジナルよりアーカイブ。August 9, 2011閲覧。
“About NFSNET”. May 9, 2008時点のオリジナルよりアーカイブ。August 9, 2011閲覧。

web.archive.org

“Welcome to NFSNET” (April 23, 2007). October 22, 2007時点のオリジナルよりアーカイブ。August 9, 2011閲覧。
“About NFSNET”. May 9, 2008時点のオリジナルよりアーカイブ。August 9, 2011閲覧。