A cubic RSA code equivalent to factorization
type: Item
instance of: scholarly article
title: A cubic RSA code equivalent to factorization
zbMATH Open document ID: 0755.94008
DOI: 10.1007/BF00193566
author: David S. P. Khoo
author: Gregory J. Bird
author: John H. Loxton
author: Jennifer Seberry
published in: Journal of Cryptology
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 89643
zbMATH Keywords: Eisenstein integers
zbMATH Keywords: cubic residues
zbMATH Keywords: RSA public-key encryption system
zbMATH Keywords: encryption
zbMATH Keywords: decryption
zbMATH Keywords: factorization
MaRDI profile type: Publication
cites work: Rivest-Shamir-Adleman public key crytosystems do not always conceal messages
cites work: Q3939864
cites work: On the concealability of messages by the Williams public-key encryption scheme
cites work: Q5511421
cites work: A modification of the RSA public-key encryption procedure (Corresp.)
cites work: Q3753922
Recommended article: A cubic analogue of the RSA cryptosystem
Recommended article: Q5369778
Recommended article: Cryptanalysis of the RSA variant based on cubic Pell equation
Recommended article: Factorizing RSA keys, an improved analogue solution
Recommended article: Algorithm for factoring some RSA and Rabin moduli
Recommended article: Q5698135
Recommended article: Q4290420
Recommended article: Enhanced Rabin cryptosystem based on cubic congruence equation
Recommended article: Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
Recommended article: The cubic public-key transformation
description: scientific article; zbMATH DE number 89643