Skip to main content
placeholder image

A cubic RSA code equivalent to factorization

Journal Article


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. © 1992 International Association for Cryptologic Research.

Publication Date


  • 1992

Citation


  • Loxton, J. H., Khoo, D. S. P., Bird, G. J., & Seberry, J. (1992). A cubic RSA code equivalent to factorization. Journal of Cryptology, 5(2), 139-150. doi:10.1007/BF00193566

Scopus Eid


  • 2-s2.0-0026652177

Web Of Science Accession Number


Start Page


  • 139

End Page


  • 150

Volume


  • 5

Issue


  • 2

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. © 1992 International Association for Cryptologic Research.

Publication Date


  • 1992

Citation


  • Loxton, J. H., Khoo, D. S. P., Bird, G. J., & Seberry, J. (1992). A cubic RSA code equivalent to factorization. Journal of Cryptology, 5(2), 139-150. doi:10.1007/BF00193566

Scopus Eid


  • 2-s2.0-0026652177

Web Of Science Accession Number


Start Page


  • 139

End Page


  • 150

Volume


  • 5

Issue


  • 2