Comparative Analysis Of Integer Factorization Algorithms Using Cpu And Gpu
In this work we have evaluated the running time of four integer factorization algorithms, namely, trial division algorithm, Fermat algorithm, Pollard rho and Brent algorithms. Implementation of these algorithms was performed in three ways on c programming language, on c programming language, using...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kyrgyz Turkish Manas University
2017-05-01
|
| Series: | MANAS: Journal of Engineering |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/en/download/article-file/575994 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this work we have evaluated the running time of four integer factorization algorithms, namely, trial division algorithm, Fermat algorithm, Pollard rho and Brent algorithms. Implementation of these algorithms was performed in three ways on c programming language, on c programming language, using GMP 6.0.0 library and on CUDA architecture to run on GPU. Results showed that Fermat algorithm and trivial division algorithm had the fastest running time in parallel implementation on CUDA architecture. The difference of running times between CUDA implementation and GMP implementation was up to 10 times. The difference between c and c implementation was mainly due to difference in these programming languages. |
|---|---|
| ISSN: | 1694-7398 |