Presentation 2004-09-17
A trial of GNFS implementation (Part VI) : lattice sieve
Kazumaro AOKI, Yuji KIDA, Hiroki UEDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The number field sieve is considered as the fastest algorithm for factoring an integer which does not include small factors and larger than several hundred bits. The sieving in the number field sieve is the most time-consuming step. The sieving can be done by line sieve which is simple and frequently used nowadays, but lattice sieve is indispensable for factoring an integer which is larger than about 500 bits long by general number field sieve. However, lattice sieve is very complex and no literature writes the detailed implementation method. This manuscript describes lattice sieve in detail.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) integer factoring / number field sieve / lattice sieve / Gauss reduction / binary GCD
Paper # ISEC2004-68
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/9/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A trial of GNFS implementation (Part VI) : lattice sieve
Sub Title (in English)
Keyword(1) integer factoring
Keyword(2) number field sieve
Keyword(3) lattice sieve
Keyword(4) Gauss reduction
Keyword(5) binary GCD
1st Author's Name Kazumaro AOKI
1st Author's Affiliation NTT()
2nd Author's Name Yuji KIDA
2nd Author's Affiliation Department of Mathematics, College of Science, Rikkyo University
3rd Author's Name Hiroki UEDA
3rd Author's Affiliation NTT
Date 2004-09-17
Paper # ISEC2004-68
Volume (vol) vol.104
Number (no) 315
Page pp.pp.-
#Pages 6
Date of Issue