Lenstra's Factorization Algorithm

Thumbnail Image
Lenstra's Factorization Algorithm.pdf (710.4 KB)
Authors
Wiesław, Maleszewski
Date
2017-09-17
Journal Title
Journal ISSN
Volume Title
Publisher
License
Creative Commons License
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Poland License
Abstract
This poster describes Lenstra’s Elliptic Curve Algorithm for factoring large numbers. The authors starts from the definition of elliptic curves over fields of characteristic different than 2 or 3. Then he introduces a construction of the abelian group over the K-rational points of an elliptic curve. Next he reminds Pollard’s p − 1 algorithm and introduces Lenstra's Algorithm. This poster discusses how Lenstra’s improves upon Pollard and it gives a brief note on application.
Description
Keywords
Lenstra's Factorization Algorithm  elliptic curve
Citation
Wiesław Maleszewski, Lenstra's Factorization Algorithm, 20th International Workshop for Young Mathematicians "Number Theory", Jagiellonian University in Kraków,
URI
https://open.icm.edu.pl/handle/123456789/16676
Related research dataset
Belongs to collection
Inne / Other