Muhammad Asyraf Asbullah, Normahirah Nek Abd Rahman, M. Ariffin, S. H. Sapar, F. Yunos
{"title":"用连续分式分析小|2q–p|的N=p^2q RSA密钥方程","authors":"Muhammad Asyraf Asbullah, Normahirah Nek Abd Rahman, M. Ariffin, S. H. Sapar, F. Yunos","doi":"10.22452/mjs.vol39no1.6","DOIUrl":null,"url":null,"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.","PeriodicalId":18094,"journal":{"name":"Malaysian journal of science","volume":"39 1","pages":"72-80"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"CRYPTANALYSIS OF RSA KEY EQUATION OF N=p^2q FOR SMALL |2q – p| USING CONTINUED FRACTION\",\"authors\":\"Muhammad Asyraf Asbullah, Normahirah Nek Abd Rahman, M. Ariffin, S. H. Sapar, F. Yunos\",\"doi\":\"10.22452/mjs.vol39no1.6\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":18094,\"journal\":{\"name\":\"Malaysian journal of science\",\"volume\":\"39 1\",\"pages\":\"72-80\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Malaysian journal of science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22452/mjs.vol39no1.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Multidisciplinary\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Malaysian journal of science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22452/mjs.vol39no1.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Multidisciplinary","Score":null,"Total":0}
CRYPTANALYSIS OF RSA KEY EQUATION OF N=p^2q FOR SMALL |2q – p| USING CONTINUED FRACTION
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
