Open AccessA Practical Analysis of the Fermat Factorization and Pollard Rho Method for Factoring Integers
Author(s) -
Aminudin Aminudin,
Eko Budi Cahyono
Publication year - 2021
Publication title -
lontar komputer/lontar komputer
Language(s) - English
Resource type - Journals
eISSN - 2541-5832
pISSN - 2088-1541
DOI - 10.24843/lkjiti.2021.v12.i01.p04
Subject(s) - factoring , factorization , prime factor , integer factorization , public key cryptography , cryptography , key (lock) , fermat's last theorem , mersenne prime , mathematics , computer science , byte , prime number , fermat number , algorithm , prime (order theory) , discrete mathematics , encryption , combinatorics , computer security , operating system , finance , economics
The development of public-key cryptography generation using the factoring method is very important in practical cryptography applications. In cryptographic applications, the urgency of factoring is very risky because factoring can crack public and private keys, even though the strength in cryptographic algorithms is determined mainly by the key strength generated by the algorithm. However, solving the composite number to find the prime factors is still very rarely done. Therefore, this study will compare the Fermat factorization algorithm and Pollard rho by finding the key generator public key algorithm's prime factor value. Based on the series of test and analysis factoring integer algorithm using Fermat's Factorization and Pollards' Rho methods, it could be concluded that both methods could be used to factorize the public key which specifically aimed to identify the prime factors. During the public key factorizing process within 16 bytes – 64 bytes, Pollards' Rho's average duration was significantly faster than Fermat's Factorization.