Abstract
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.
Keywords
Discrete logarithmPairingLogarithmMultiplicative functionElliptic curveMathematicsSchoof's algorithmElliptic curve point multiplicationMultiplicative groupElliptic curve cryptographyFinite fieldHessian form of an elliptic curveSupersingular elliptic curveCryptosystemDiscrete mathematicsPure mathematicsCryptographyMathematical analysisComputer scienceAlgorithmPublic-key cryptographyQuarter periodPhysicsEncryptionComputer security
Affiliated Institutions
Related Publications
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...
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...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 45
- Issue
- 5
- Pages
- 1717-1719
- Citations
- 238
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
238
OpenAlex
Cite This
Gerhard Frey,
Markus Müller,
H.-G. Rück
(1999).
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems.
IEEE Transactions on Information Theory
, 45
(5)
, 1717-1719.
https://doi.org/10.1109/18.771254
Identifiers
- DOI
- 10.1109/18.771254