Comparative analysis of integer factorization algorithms
Integer factorization problem, which is used as the basis in many public key cryptosystem, is generally thought to be hard problem even on a modern computers. In this work we implement 4 integer factorization algorithms using GMP library on c++ and compare the running time of these algorithms. Algor...
Saved in:
| Main Authors: | G. Kimsanova, R. Ismailova, R. Sultanov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kyrgyz Turkish Manas University
2015-10-01
|
| Series: | MANAS: Journal of Engineering |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/en/download/article-file/575956 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Comparative Analysis Of Integer Factorization Algorithms Using Cpu And Gpu
by: Rita Ismailova, et al.
Published: (2017-05-01) -
MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
by: Sa'aadah Sajjana Carita, et al.
Published: (2022-12-01) -
Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation
by: Global Ilham Sampurno, et al.
Published: (2018-05-01) -
Finding Multiple Optimal Solutions to an Integer Linear Program by Random Perturbations of Its Objective Function
by: Noah Schulhof, et al.
Published: (2025-03-01) -
Heuristic Algorithms for The Problem of Integer Balancing of a Three-dimensional Matrix with Constraints of Second Type
by: A. V. Smirnov
Published: (2014-08-01)