dc.contributor.author | Wiesław, Maleszewski | |
dc.date.accessioned | 2019-03-18T12:22:43Z | |
dc.date.available | 2019-03-18T12:22:43Z | |
dc.date.issued | 2017-09-17 | |
dc.identifier.citation | Wiesław Maleszewski, Lenstra's Factorization Algorithm, 20th International Workshop for Young Mathematicians "Number Theory", Jagiellonian University in Kraków, | en |
dc.identifier.uri | https://depot.ceon.pl/handle/123456789/16676 | |
dc.description.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. | en |
dc.language.iso | en | |
dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/pl/ | * |
dc.subject | Lenstra's Factorization Algorithm | en |
dc.subject | elliptic curve | en |
dc.title | Lenstra's Factorization Algorithm | en |
dc.type | conferenceObject | en |
dc.contributor.organization | Państwowa Wyższa Szkoła Informatyki i Przedsiębiorczości w Łomży | en |