Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2005, 412-426
- https://doi.org/10.1007/11545262_30
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Algorithms and Architectures for Use in FPGA Implementations of Identity Based Encryption SchemesLecture Notes in Computer Science, 2004
- Efficient GF(p m ) Arithmetic Architectures for Cryptographic ApplicationsLecture Notes in Computer Science, 2003
- Tate Pairing Implementation for Hyperelliptic Curves y 2 = x p – x + dLecture Notes in Computer Science, 2003
- Efficient Algorithms for Pairing-Based CryptosystemsLecture Notes in Computer Science, 2002
- Implementing the Tate PairingLecture Notes in Computer Science, 2002
- Elliptic Curves in CryptographyPublished by Cambridge University Press (CUP) ,1999
- Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)Lecture Notes in Computer Science, 1997
- Efficient algorithms for elliptic curve cryptosystemsPublished by Springer Science and Business Media LLC ,1997
- A fast software implementation for arithmetic operations in GF(2n)Published by Springer Science and Business Media LLC ,1996
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of CurvesMathematics of Computation, 1994