A Note on Integer Factorization Using Lattices

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-499467

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.