Abstract
The RSA public-key encryption system of Rivest, Shamir, and Adelman can be broken if the modulus, R say, can be factorized. However, it is still not known if this system can be broken without factorizing R. A version of the RSA scheme is presented with encryption exponent e ≡ 3 (mod 6). For this modified version, the equivalence of decryption and factorization of R can be demonstrated.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
G. R. Blakley and I. Borosh, Rivest-Shamir-Adelman public key cryptosystem do not always conceal massages, Comput. Math. Appl. 5 (1979), 169–178.
K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, Springer-Verlag, New York, 1982.
S. Kothari and S. Lakshmivarahan, On the concealability of messages by the Williams public-key encryption scheme, Comput. Math. Appl. 10 (1984), 15–24.
M. O. Rabin, Digitized signatures and public-key functions as intractable as factorization, Technical Report LCS/TR-212, M.I.T. Laboratory for Computer Science, 1979.
B. L. van der Waerden, Algebra, vol. 1, Ungar, New York, 1970.
H. C. Williams, A modification of the RSA public-key procedure, IEEE Trans. Inform. Theory 26 (1980), 726–729.
H. C. Williams, An M 3 public-key encryption scheme, Advances in Cryptology, CRYPTO '85, Lecture Notes in Computer Science, vol. 218, Springer-Verlag, Berlin, pp. 358–368.
Author information
Authors and Affiliations
Additional information
Communicated by Ernest F. Brickell
Research supported in part by a grant from the ATERB.
Research supported in part by a grant from the ACRB.
Rights and permissions
About this article
Cite this article
Loxton, J.H., Khoo, D.S.P., Bird, G.J. et al. A cubic RSA code equivalent to factorization. J. Cryptology 5, 139–150 (1992). https://doi.org/10.1007/BF00193566
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00193566