Application of sieve methods to factorization and the discrete logarithm problem
Factoring large numbers and computing discrete logarithms are presumed to be hard problems. No polynomial time solution for those problem has yet been found. Those problems have many significant applications, particularly in cryptography. Several cryptosystems base their security on their supposed d...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2002
|
| Online Access: | http://spectrum.library.concordia.ca/1820/1/MQ72887.pdf Khalil, Antoine <http://spectrum.library.concordia.ca/view/creators/Khalil=3AAntoine=3A=3A.html> (2002) Application of sieve methods to factorization and the discrete logarithm problem. Masters thesis, Concordia University. |