Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Integer Factorization Implementations


Affiliations
1 Department of Mathematics and Computer Science, University of Qom, Iran, Islamic Republic of
2 Research Center of Developing Advanced Technologies, Iran, Islamic Republic of
     

   Subscribe/Renew Journal


One difficult problem of mathematics that forms the basics of some public key cryptography systems like RSA, is finding factors of big numbers. To solve this problem, many factorization algorithms have been offered with different complexities. Many attempts have been made today to implement these factorization algorithms. And these implementations are different from various aspects. Each of these factorization algorithms is efficient for numbers with a specific size. These algorithms can be compared with regard to time and memory complexity. In this paper, some of these implementations are studied and compared and consequently the most appropriate one will be introduced.

Keywords

Factorization, GMP-ECM, CADO-NFS, NFS, RSA, ECM.
Subscription Login to verify subscription
User
Notifications
Font Size

Abstract Views: 270

PDF Views: 2




  • Integer Factorization Implementations

Abstract Views: 270  |  PDF Views: 2

Authors

Reza Alimoradi
Department of Mathematics and Computer Science, University of Qom, Iran, Islamic Republic of
Hamid Reza Arkian
Research Center of Developing Advanced Technologies, Iran, Islamic Republic of

Abstract


One difficult problem of mathematics that forms the basics of some public key cryptography systems like RSA, is finding factors of big numbers. To solve this problem, many factorization algorithms have been offered with different complexities. Many attempts have been made today to implement these factorization algorithms. And these implementations are different from various aspects. Each of these factorization algorithms is efficient for numbers with a specific size. These algorithms can be compared with regard to time and memory complexity. In this paper, some of these implementations are studied and compared and consequently the most appropriate one will be introduced.

Keywords


Factorization, GMP-ECM, CADO-NFS, NFS, RSA, ECM.