Advertisement
Published in:
2006 | OriginalPaper | Chapter
Factorization of Square-Free Integers with High Bits Known
Authors : Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Kazuo Ohta
Published in: Progress in Cryptology - VIETCRYPT 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we propose an algorithm of factoring any integer
N
which has
k
different prime factors with the same bit-length, when
$(\frac{1}{k+2}+\frac{\epsilon}{k(k-1)})\log N$
high-order bits of each prime factor are given. For a fixed
ε
, the running time of our algorithm is heuristic polynomial in (log
N
). Our factoring algorithm is based on a new lattice-based algorithm of solving any
k
-variate polynomial equation over ℤ, which might be an independent interest.