A cubic RSA code equivalent to factorization

J. H. Loxton*, David S P Khoo, Gregory J. Bird, Jennifer Seberry

*Corresponding author for this work

    Research output: Contribution to journalArticle

    19 Citations (Scopus)

    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.

    Original languageEnglish
    Pages (from-to)139-150
    Number of pages12
    JournalJournal of Cryptology
    Volume5
    Issue number2
    DOIs
    Publication statusPublished - Jan 1992

    Keywords

    • Cubic residues
    • Eisenstein integers
    • Encryption
    • Factorization
    • Public-key
    • RSA

    Fingerprint Dive into the research topics of 'A cubic RSA code equivalent to factorization'. Together they form a unique fingerprint.

  • Cite this

    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. https://doi.org/10.1007/BF00193566