A Note on Integer Factorization Using Lattices

Antonio Vera 1, *
* Corresponding author
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
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.
Document type :
Reports
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00467590
Contributor : Antonio Vera <>
Submitted on : Saturday, March 27, 2010 - 4:02:03 AM
Last modification on : Tuesday, December 18, 2018 - 4:18:25 PM
Long-term archiving on : Monday, June 28, 2010 - 8:07:14 PM

Files

A_Note_on_Integer_Factorizatio...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00467590, version 1
  • ARXIV : 1003.5461

Collections

Citation

Antonio Vera. A Note on Integer Factorization Using Lattices. [Research Report] 2010, pp.12. ⟨inria-00467590⟩

Share

Metrics

Record views

411

Files downloads

563