A Note on Integer Factorization Using Lattices
Data Structures and Algorithms
2010-03-30 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1003.5461,
title = {A Note on Integer Factorization Using Lattices},
author = {Antonio Ignacio Vera},
journal= {arXiv preprint arXiv:1003.5461},
year = {2010}
}