A Note on Integer Factorization Using Lattices
Résumé
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.
Fichier principal
A_Note_on_Integer_Factorization__Antonio_Vera.pdf (180.9 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...