An Efficient Variant of Pollard's p - 1 for the Case That All Prime Factors of the p - 1 in B-Smooth
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14020312
Abstract: Due to the computational limitations at present, there is no efficient integer factorization algorithm that can break at least 2048 bits of RSA with strong prime factors in polynomial time. Although Shor’s algorithm based on… read more here.
Keywords: variant pollard; prime factors; case; method ... See more keywords