Abstract
In the RSA public-key crypto system a message M (<R) is encrypted by calculating K≡me (mod R), where 0<K<R and R, e are integers which are made public. The recipient of K can decipher it by raising it to a power d and reducing modulo R. Only the recipient knows the values of two large primes p, q such that R=pq; consequently, only he possesses d, as e is preselected such that gcd (e, φ(R))=1 and ed≡1 (mod φ(R)). In this paper we discuss an RSA-like public-key cryptosystem in which we raise a certain quadratic irrational to the power e modulo R. We show that this cryptosystem is as difficult to break as it is to find the factors of R. Further, this scheme, like the RSA scheme, can also be used to produce signatures.
Keywords
ModuloPublic-key cryptographyCryptosystemKey (lock)MathematicsPublic key cryptosystemDiscrete mathematicsInteger factorizationArithmeticFactorizationScheme (mathematics)Irrational numberEncryptionCryptographyComputer scienceAlgorithmComputer security
Related Publications
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
Elliptic curve cryptosystems using curves of smooth order over the ring Z/sub n/
We present a new cryptosystem based on elliptic curves over the ring Z/sub n/, where n=pq, in which the message is held in the exponent and not the group element. The security o...
A public key cryptosystem and a signature scheme based on discrete logarithms
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both s...
Cryptanalysis of the Chor-Rivest cryptosystem
Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before being all broken, all but the Chor-Rivest cryptosystem. We show how to break t...
Publication Info
- Year
- 1985
- Type
- article
- Volume
- 9
- Issue
- 3
- Pages
- 223-237
- Citations
- 24
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
24
OpenAlex
Cite This
Hywel C Williams
(1985).
SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION.
Cryptologia
, 9
(3)
, 223-237.
https://doi.org/10.1080/0161-118591859942
Identifiers
- DOI
- 10.1080/0161-118591859942