A New Methodology to Find Private Key of RSA Based on Euler Totient Function

          The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition,...

Full description

Bibliographic Details
Main Author: kritsanapong Somsuk
Format: Article
Language:Arabic
Published: College of Science for Women, University of Baghdad 2021-06-01
Series:Baghdad Science Journal
Subjects:
Online Access:https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/4360
id doaj-467a1344e80e4fc5876555202a55213d
record_format Article
spelling doaj-467a1344e80e4fc5876555202a55213d2021-06-07T15:50:08ZaraCollege of Science for Women, University of BaghdadBaghdad Science Journal2078-86652411-79862021-06-0118210.21123/bsj.2021.18.2.0338 A New Methodology to Find Private Key of RSA Based on Euler Totient Functionkritsanapong Somsuk0Udon Thani Rajabhat University, Thailand           The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key is decreased about 66%. On the other hand, the distance is decreased less than 1% when the multiplier is larger than 66. Therefore, to avoid attacking by using the proposed method, the multiplier which is larger than 66 should be chosen. Furthermore, it is shown that if the public key equals 3, the multiplier always equals 2. https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/4360RSA, private key, euler totient function, initial value
collection DOAJ
language Arabic
format Article
sources DOAJ
author kritsanapong Somsuk
spellingShingle kritsanapong Somsuk
A New Methodology to Find Private Key of RSA Based on Euler Totient Function
Baghdad Science Journal
RSA, private key, euler totient function, initial value
author_facet kritsanapong Somsuk
author_sort kritsanapong Somsuk
title A New Methodology to Find Private Key of RSA Based on Euler Totient Function
title_short A New Methodology to Find Private Key of RSA Based on Euler Totient Function
title_full A New Methodology to Find Private Key of RSA Based on Euler Totient Function
title_fullStr A New Methodology to Find Private Key of RSA Based on Euler Totient Function
title_full_unstemmed A New Methodology to Find Private Key of RSA Based on Euler Totient Function
title_sort new methodology to find private key of rsa based on euler totient function
publisher College of Science for Women, University of Baghdad
series Baghdad Science Journal
issn 2078-8665
2411-7986
publishDate 2021-06-01
description           The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key is decreased about 66%. On the other hand, the distance is decreased less than 1% when the multiplier is larger than 66. Therefore, to avoid attacking by using the proposed method, the multiplier which is larger than 66 should be chosen. Furthermore, it is shown that if the public key equals 3, the multiplier always equals 2.
topic RSA, private key, euler totient function, initial value
url https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/4360
work_keys_str_mv AT kritsanapongsomsuk anewmethodologytofindprivatekeyofrsabasedoneulertotientfunction
AT kritsanapongsomsuk newmethodologytofindprivatekeyofrsabasedoneulertotientfunction
_version_ 1721391122340642816