Hardware Acceleration of the Tate Pairing in Characteristic Three
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 398-411
- https://doi.org/10.1007/11545262_29
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Algorithms and Architectures for Use in FPGA Implementations of Identity Based Encryption SchemesPublished by Springer Nature ,2004
- Constructing Elliptic Curves with Prescribed Embedding DegreesPublished by Springer Nature ,2003
- Efficient GF(p m ) Arithmetic Architectures for Cryptographic ApplicationsPublished by Springer Nature ,2003
- Tate Pairing Implementation for Hyperelliptic Curves y 2 = x p – x + dPublished by Springer Nature ,2003
- Identity-Based Encryption from the Weil PairingSIAM Journal on Computing, 2003
- Efficient Algorithms for Pairing-Based CryptosystemsPublished by Springer Nature ,2002
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based CryptosystemsLMS Journal of Computation and Mathematics, 2002
- Supersingular Curves in CryptographyPublished by Springer Nature ,2001
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988
- On arithmetic weight for a general radix representation of integers (Corresp.)IEEE Transactions on Information Theory, 1973