A cubic RSA code equivalent to factorization

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

doi:10.1007/BF00193566

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 journal › Article › peer-review

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 language	English
Pages (from-to)	139-150
Number of pages	12
Journal	Journal of Cryptology
Volume	5
Issue number	2
DOIs	https://doi.org/10.1007/BF00193566
Publication status	Published - Jan 1992

Keywords

Cubic residues
Eisenstein integers
Encryption
Factorization
Public-key
RSA

Access to Document

10.1007/BF00193566

Cite this

@article{1a4ae8bf414b41fd88c208cbb3496dff,

title = "A cubic RSA code equivalent to factorization",

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.",

keywords = "Cubic residues, Eisenstein integers, Encryption, Factorization, Public-key, RSA",

author = "Loxton, {J. H.} and Khoo, {David S P} and Bird, {Gregory J.} and Jennifer Seberry",

year = "1992",

month = jan,

doi = "10.1007/BF00193566",

language = "English",

volume = "5",

pages = "139--150",

journal = "Journal of Cryptology",

issn = "0933-2790",

publisher = "Springer, Springer Nature",

number = "2",

}

TY - JOUR

T1 - A cubic RSA code equivalent to factorization

AU - Loxton, J. H.

AU - Khoo, David S P

AU - Bird, Gregory J.

AU - Seberry, Jennifer

PY - 1992/1

Y1 - 1992/1

N2 - 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.

AB - 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.

KW - Cubic residues

KW - Eisenstein integers

KW - Encryption

KW - Factorization

KW - Public-key

KW - RSA

UR - http://www.scopus.com/inward/record.url?scp=0026652177&partnerID=8YFLogxK

U2 - 10.1007/BF00193566

DO - 10.1007/BF00193566

M3 - Article

AN - SCOPUS:0026652177

SN - 0933-2790

VL - 5

SP - 139

EP - 150

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 2

ER -

A cubic RSA code equivalent to factorization

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this