FASTER FACTORING OF INTEGERS OF A SPECIAL FORM

Citation
R. Peralta et E. Okamoto, FASTER FACTORING OF INTEGERS OF A SPECIAL FORM, IEICE transactions on fundamentals of electronics, communications and computer science, E79A(4), 1996, pp. 489-493
Citations number
13
Categorie Soggetti
Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Information Systems
ISSN journal
09168508
Volume
E79A
Issue
4
Year of publication
1996
Pages
489 - 493
Database
ISI
SICI code
0916-8508(1996)E79A:4<489:FFOIOA>2.0.ZU;2-F
Abstract
A speedup of Lenstra's Elliptic Curve Method of factorization is prese nted. The speedup works for integers of the form N = PQ(2) where P is a prime sufficiently smaller than Q. The result is of interest to cryp tographers, since integers with secret factorization of this form are being used in digital signatures. The algorithm makes use of what we c all ''Jacobi signatures''. We believe these to be of independent inter est.