Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Factorization of Square-Free Integers with High Bits Known
verfasst von : Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Kazuo Ohta
Erschienen in: Progress in Cryptology - VIETCRYPT 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.