A cubic RSA code equivalent to factorization

  title={A cubic RSA code equivalent to factorization},
  author={John H. Loxton and David S. P. Khoo and Gregory J. Bird and Jennifer Seberry},
  journal={Journal of Cryptology},
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. 
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-7 of 7 references

On the concealability of messages by the Williams public-key encryption

  • S. Kothari, S. Lakshmivarahan
  • scheme. Comput. Math. Appl
  • 1984

On the concealability of messages by the Williams public - key encryption scheme

  • Kothari, S. Lakshmivarahan
  • A Classical Introduction to Modern Number Theory
  • 1982


  • K. Ireland, M. Rosen. A Classical Introduction to Modern Number Theory
  • New York.
  • 1982
1 Excerpt

A modification of the RSA public-key procedure

  • H. C. Williams
  • IEEE Trans. Inform. Theory
  • 1980

Rivest-Shamir-Adelman public key cryptosystem do not always conceal massages

  • G. R. Blakley, I. Borosh
  • Comput. Math. Appl
  • 1979

Technical Report LCS{fR-212

  • M. O. Rabin. Digitized signatures, public-key functions as intractable as factorization
  • M.I.T. Laboratory for Computer Science.
  • 1979
2 Excerpts


  • B. L. van der Waerden. Algebra. vol
  • Ungar. New York.
  • 1970

Similar Papers

Loading similar papers…