A cubic RSA code equivalent to factorization

DOI10.1007/BF00193566MaRDI QIDQ1196900zbMATH OpenFDO

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

Publication date 16 January 1993

Published in Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

factorizationencryptiondecryptionEisenstein integerscubic residuesRSA public-key encryption system

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A cubic analogue of the RSA cryptosystem
• Analogue of the RSA-cryptosystem in quadratic unique factorization domains
• Cryptanalysis of the RSA variant based on cubic Pell equation
• Factorizing RSA keys, an improved analogue solution
• Algorithm for factoring some RSA and Rabin moduli
• scientific article; zbMATH DE number 2219412
• scientific article; zbMATH DE number 562223
• Enhanced Rabin cryptosystem based on cubic congruence equation
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• The cubic public-key transformation

Cites work

• scientific article; zbMATH DE number 3991413 (Why is no real title available?)
• scientific article; zbMATH DE number 3756556 (Why is no real title available?)
• scientific article; zbMATH DE number 3222940 (Why is no real title available?)
• A modification of the RSA public-key encryption procedure (Corresp.)
• On the concealability of messages by the Williams public-key encryption scheme
• Rivest-Shamir-Adleman public key crytosystems do not always conceal messages

Cited in

(4)

• M mod 3 security of RSA
• Breaking RSA Generically Is Equivalent to Factoring
• A public-key cryptosystem utilizing cyclotomic fields
• Proof of soundness (integrity) of cryptographic protocols

This page was built for publication: A cubic RSA code equivalent to factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196900)