vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff38501f0000004b4c010001000500 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.
Reza Alimoradi1, Hamid Reza Arkian2
University of Qom, Iran1, Research Center of Developing Advanced Technologies, Iran2
Factorization, GMP-ECM, CADO-NFS, NFS, RSA, ECM
| January | February | March | April | May | June | July | August | September | October | November | December |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 2 |
| Published By :
ICTACT
Published In :
ICTACT Journal on Communication Technology
( Volume: 7 , Issue: 2 , Pages: 1310-1314 )
Date of Publication :
June 2016
Page Views :
180
Full Text Views :
3
|