Efficient Algorithms for Pairing-Based Cryptosystems
Top Cited Papers
- 13 September 2002
- book chapter
- Published by Springer Nature
- p. 354-369
- https://doi.org/10.1007/3-540-45708-9_23
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The implementation of elliptic curve cryptosystemsPublished by Springer Nature ,2005
- Identity-Based Encryption from the Weil PairingPublished by Springer Nature ,2001
- A One Round Protocol for Tripartite Diffie–HellmanPublished by Springer Nature ,2000
- Elliptic Curves in CryptographyPublished by Cambridge University Press (CUP) ,1999
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystemsIEEE Transactions on Information Theory, 1999
- An elliptic curve implementation of the finite field digital signature algorithmPublished by Springer Nature ,1998
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- A Course in Computational Algebraic Number TheoryPublished by Springer Nature ,1993
- Elliptic Curve Public Key CryptosystemsPublished by Springer Nature ,1993
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988