Presentation 1999/11/8
Remarks on the Lattice Factoring Method
Naoki KANAYAMA, Shigenori UCHIYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Recently, Boneh et al. proposed the algorithm for factoring integers, the so-called LFM (Lattice Factoring Method). This algorithm employs the LLL algorithm. The LFM is for the integers of the form N=p^γq, and this algorithm is very effective for large γ, namely it runs in polynomial time in logN for large γ, in particular. Although for small γ, e.g. N=pq, p^2q, this is an exponential time algorithm in logN. In this paper, we give some remarks on this algorithm and propose a certain method for improvement of the LFM. Furthermore, by experimental results, we show that the running time of the proposed algorithm is shorter than that of the original LFM.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Integer Factorization Problem / LLL algorithm / LFM
Paper # ISEC99-61
Date of Issue

Conference Information
Committee ISEC
Conference Date 1999/11/8(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) Remarks on the Lattice Factoring Method
Sub Title (in English)
Keyword(1) Integer Factorization Problem
Keyword(2) LLL algorithm
Keyword(3) LFM
1st Author's Name Naoki KANAYAMA
1st Author's Affiliation Graduate School of Science & Engineering, Waseda University()
2nd Author's Name Shigenori UCHIYAMA
2nd Author's Affiliation NTT Laboratories
Date 1999/11/8
Paper # ISEC99-61
Volume (vol) vol.99
Number (no) 414
Page pp.pp.-
#Pages 8
Date of Issue