Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p
Department of Computer Science, US Air Force Academy, Colorado Springs, CO 80840, USA
Received: 13 August 2018 / Revised: 23 August 2018 / Accepted: 25 August 2018 / Published: 28 August 2018
RSA key pairs are normally generated from two large primes p
. We consider what happens if they are generated from two integers s
, where r
is prime, but unbeknownst to the user, s
is not. Under most circumstances, the correctness of encryption and decryption depends on the choice of the public and private exponents e
. In some cases, specific
pairs can be found for which encryption and decryption will be correct for any
exponent pair. Certain s
exist, however, for which encryption and decryption are correct for any odd prime
. We give necessary and sufficient conditions for s
with this property.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Fagin, B. Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p. Information 2018, 9, 216.
Fagin B. Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p. Information. 2018; 9(9):216.
Fagin, Barry. 2018. "Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p." Information 9, no. 9: 216.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.