Open AccessOn using Euler’s Factorization Algorithm to Factor RSA Modulus
Author(s) -
Mohammad Andri Budiman,
Muhammad Zarlis,
Opim Salim Sitompul,
Herman Mawengkang
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1566/1/012063
Subject(s) - factorization , prime factor , algorithm , factoring , cryptosystem , mathematics , euler's formula , integer factorization , moduli , computer science , public key cryptography , prime (order theory) , encryption , cryptography , combinatorics , mathematical analysis , physics , finance , quantum mechanics , economics , operating system
The RSA public key cryptosystem was among the first algorithms to implement the Diffie-Hellman key exchange protocol. At the core of RSA’s security is the problem of factoring its modulus, a very large integer, into its prime factors. In this study, we show a step-by-step tutorial on how to factor the RSA modulus using Euler’s factorization algorithm, an algorithm that belongs to the class of exact algorithms. The Euler’s factorization algorithm is implemented in Python programming language. In this experiment, we also record the relation between the length of the RSA moduli and its factorization time. As a result, this study shows that the Euler’s factorization algorithm can be used to factor small modulus of RSA, the correlation between the factoring time and the size of RSA modulus is directly proportional, and better selection of some Euler’s parameters may lead to lower factoring time.