Algorithms for factoring large integers
Integer factorization is a problem of great interest considering that it allows us to better understand numbers and compute certain arithmetic functions more easily. Furthermore, safety of the famous RSA cryptosystem is based on the complexity of this problem, which makes the finding of new methods...
- Autores:
-
Escobar Sarmiento, Camilo Andrés
- Tipo de recurso:
- Trabajo de grado de pregrado
- Fecha de publicación:
- 2020
- Institución:
- Universidad de los Andes
- Repositorio:
- Séneca: repositorio Uniandes
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.uniandes.edu.co:1992/49078
- Acceso en línea:
- http://hdl.handle.net/1992/49078
- Palabra clave:
- Factorización (Matemáticas)
Programación entera
Algoritmo de Pollard
Ecuaciones integrales
Matemáticas
- Rights
- openAccess
- License
- http://creativecommons.org/licenses/by-nc-sa/4.0/
| Summary: | Integer factorization is a problem of great interest considering that it allows us to better understand numbers and compute certain arithmetic functions more easily. Furthermore, safety of the famous RSA cryptosystem is based on the complexity of this problem, which makes the finding of new methods of factorization an interesting chal- lenge. In this work we present some of the applications of integer factorization as well as some of the current methods of factorization such as Pollard?s p-1 algorithm, the elliptic curve method and the continued fraction factoring algoritm. We also implement these algorithms and do an analysis on their complexities. Finally, we explore the future of this problem |
|---|