期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2018
卷号：10
期号：1
页码：7-13
出版社：Engg Journals Publications
摘要：The security of RSA public key cryptography and RSA digital signature relies on the assumption of the hardness of the factorization of integers. Since the inception of RSA, there have been a series of proposals for factorizing large integers. A handful of integer factorization methods rely on the fact that the prime factor p having smooth p -1 value. Pollard’s p -1 is a method heavily based on this fact. It takes sub-exponential time for certain integers though not suitable for all integers. This paper experiments on the abundance (or scarcity) of smooth p -1 for large primes by examining their availability and suitability.
关键词：B-Smooth Primes; Number Theory; Integer Factorization; RSA Cryptosystem; Pollard’s p -1 Method.
Loading...
