A Note on Integer Factorization Using Lattices
Antonio Ignacio Vera (INRIA Lorraine - LORIA)
TL;DR
This paper revisits Schnorr's lattice-based integer factorization method, providing effective versions of key theorems and new elementary properties of the associated prime number lattices.
Contribution
It introduces effective versions of Schnorr's theorem and new properties of prime number lattice bases, enhancing understanding of lattice-based factorization.
Findings
Effective versions of Schnorr's Theorem 2 provided
New elementary properties of prime number lattices established
Improved theoretical understanding of lattice-based factorization methods
Abstract
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine approximation" paper, as well as new elementary properties of the Prime Number Lattice bases of Schnorr and Adleman.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Polynomial and algebraic computation · Complexity and Algorithms in Graphs