Computer Science – Data Structures and Algorithms
Scientific paper
2010-03-29
Computer Science
Data Structures and Algorithms
Scientific paper
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.
No associations
LandOfFree
A Note on Integer Factorization Using Lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on Integer Factorization Using Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Integer Factorization Using Lattices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-499467