\(\phi (pq)\)-评估算法：一种新的方法，为一个有效的检索欧拉的RSA模量

IF 0.8 Q2 MATHEMATICS

Afrika Matematika Pub Date : 2026-08-21 DOI:10.1007/s13370-026-01500-3

Jay Mehta, Hitarth Rana

{"title":"\\(\\phi (pq)\\)-评估算法：一种新的方法，为一个有效的检索欧拉的RSA模量","authors":"Jay Mehta, Hitarth Rana","doi":"10.1007/s13370-026-01500-3","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we propose an algorithm to efficiently retrieve the value of Euler’s totient function of an RSA modulus, consequently voiding the RSA encryption. Furthermore, we show that the proposed algorithm is significantly faster and more effective when the prime factors of an RSA modulus are closer to each other. We conjecture a relation between the difference of two prime factors of the RSA modulus and the required number of steps for the algorithm.</p></div>","PeriodicalId":46107,"journal":{"name":"Afrika Matematika","volume":"37 3","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2026-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"\\\\(\\\\phi (pq)\\\\)-evaluation algorithm: a novel approach for an efficient retrieval of Euler’s totient of an RSA modulus\",\"authors\":\"Jay Mehta, Hitarth Rana\",\"doi\":\"10.1007/s13370-026-01500-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we propose an algorithm to efficiently retrieve the value of Euler’s totient function of an RSA modulus, consequently voiding the RSA encryption. Furthermore, we show that the proposed algorithm is significantly faster and more effective when the prime factors of an RSA modulus are closer to each other. We conjecture a relation between the difference of two prime factors of the RSA modulus and the required number of steps for the algorithm.</p></div>\",\"PeriodicalId\":46107,\"journal\":{\"name\":\"Afrika Matematika\",\"volume\":\"37 3\",\"pages\":\"\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2026-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Afrika Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s13370-026-01500-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Afrika Matematika","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1007/s13370-026-01500-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了一种算法来有效地检索RSA模的欧拉全局性函数的值，从而使RSA加密无效。此外，我们表明，当RSA模的素数因子彼此更接近时，所提出的算法显着更快和更有效。我们推测了RSA模的两个素数因子的差与算法所需的步数之间的关系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

\(\phi (pq)\)-evaluation algorithm: a novel approach for an efficient retrieval of Euler’s totient of an RSA modulus

In this paper, we propose an algorithm to efficiently retrieve the value of Euler’s totient function of an RSA modulus, consequently voiding the RSA encryption. Furthermore, we show that the proposed algorithm is significantly faster and more effective when the prime factors of an RSA modulus are closer to each other. We conjecture a relation between the difference of two prime factors of the RSA modulus and the required number of steps for the algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Afrika Matematika MATHEMATICS-

CiteScore

2.00

自引率

9.10%

发文量