Efficient Computations of the Tate Pairing for the Large MOV Degrees
- 14 March 2003
- book chapter
- Published by Springer Nature
- p. 283-297
- https://doi.org/10.1007/3-540-36552-4_20
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Efficient Algorithms for Pairing-Based CryptosystemsPublished by Springer Nature ,2002
- The Weil and Tate Pairings as Building Blocks for Public Key CryptosystemsPublished by Springer Nature ,2002
- Implementing the Tate PairingPublished by Springer Nature ,2002
- Supersingular Curves in CryptographyPublished by Springer Nature ,2001
- Identity-Based Encryption from the Weil PairingPublished by Springer Nature ,2001
- A One Round Protocol for Tripartite Diffie–HellmanPublished by Springer Nature ,2000
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystemsIEEE Transactions on Information Theory, 1999
- Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201Published by Springer Nature ,1999
- Efficient Elliptic Curve Exponentiation Using Mixed CoordinatesPublished by Springer Nature ,1998
- Elliptic Curve CryptosystemsMathematics of Computation, 1987