RSA: A number of formulas to improve the search for p+qp+q

Breaking RSA is one of the fundamental problems in cryptography. Due to its reliance on the difficulty of the integer factorization problem, no efficient solution has been found despite decades of extensive research. One of the possible ways to break RSA is by finding the value p+q{p+q}, which requires searching the set of all even integers. In this paper, we present a number of formulas for p+q{p+q} that depend on the form of n=p⁢q{n=pq}. These formulas make the set to be searched much smaller than the set of all even integers.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.