Abstract
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 of this system is based on the difficulty of factoring n. A digital signature scheme and ID-based key exchange system are also given.
Keywords
CryptosystemElliptic curve cryptographyCurve25519ExponentElliptic Curve Digital Signature AlgorithmElliptic curveDigital signatureMathematicsRing (chemistry)Discrete mathematicsPublic-key cryptographyOrder (exchange)FactoringCryptographyComputer scienceAlgorithmSchoof's algorithmPure mathematicsEncryptionComputer securityHash functionQuarter period
Affiliated Institutions
Related Publications
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
The Tate pairing is used to reduce the discrete logarithm (DL) problem on certain elliptic curves to the DL in the multiplicative group of finite fields.
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...
Reducing elliptic curve logarithms to logarithms in a finite field
Elliptic curve cryptosystems have the potential to provide relatively small block size, high-security public key schemes that can be efficiently implemented. As with other known...
An ID-based cryptosystem based on the discrete logarithm problem
In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a lar...
Publication Info
- Year
- 1997
- Type
- article
- Volume
- 43
- Issue
- 4
- Pages
- 1231-1237
- Citations
- 36
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
36
OpenAlex
Cite This
Scott A. Vanstone,
Robert Zuccherato
(1997).
Elliptic curve cryptosystems using curves of smooth order over the ring Z/sub n/.
IEEE Transactions on Information Theory
, 43
(4)
, 1231-1237.
https://doi.org/10.1109/18.605586
Identifiers
- DOI
- 10.1109/18.605586