Keywords
Discrete logarithmDiffie–Hellman key exchangeElliptic curve cryptographyLogarithmElliptic curveProtocol (science)Computer scienceCryptographyFinite fieldDiscrete mathematicsTheoretical computer scienceMathematicsPublic-key cryptographyAlgorithmPure mathematicsKey exchangeComputer securityMathematical analysisEncryption
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...
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.
Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups.
In many cases, the security of a cryptographic scheme based on Diffie-Hellman does in fact rely on the hardness of...
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...
Publication Info
- Year
- 2000
- Type
- book-chapter
- Pages
- 385-393
- Citations
- 1037
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1037
OpenAlex
Cite This
Antoine Joux
(2000).
A One Round Protocol for Tripartite Diffie–Hellman.
Lecture notes in computer science
, 385-393.
https://doi.org/10.1007/10722028_23
Identifiers
- DOI
- 10.1007/10722028_23