ƕ学 Continued Fraction Diverged to Nan Ə峁¯

Main Article Content

Normahirah Nek Abd Rahman

Muhammad Rezal Kamel Ariffin

Siti Hasana Sapar

Faridah Yunos

Abstract

This paper presents a new factoring technique on the modulus , where  and  are large prime numbers. Suppose there exists an integer  satisfies the equation , for some unknown integer  and  is the Euler's totient function. Our method exploits the term  to be the closest integer to the unknown parameter . Hence we show that the unknown parameters  and  can be recovered from the list of the continued fractions expansion of Furthermore, we present an algorithm to compute the prime factors of  in polynomial time after obtaining the correct tuple  and.

Downloads

Download data is not yet available.

Article Details

How to Cite

Asbullah, M. A., Abd Rahman, N. N., Kamel Ariffin, M. R., Sapar, S. H., & Yunos, F. (2020). CRYPTANALYSIS OF RSA KEY EQUATION OF N=p^2q FOR SMALL |2q â€" p| USING CONTINUED FRACTION. Malaysian Journal of Science, 39(1), 72–80. https://doi.org/10.22452/mjs.vol39no1.6

Section

Original Articles

lundyevens1953.blogspot.com

Source: https://mjs.um.edu.my/index.php/MJS/article/view/17186

0 Response to "ƕ学 Continued Fraction Diverged to Nan Ə峁¯"

Post a Comment

Iklan Atas Artikel

Iklan Tengah Artikel 1

Iklan Tengah Artikel 2

Iklan Bawah Artikel