A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
Algebraic aspects of cryptography
Algebraic aspects of cryptography
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Ate Pairing on Hyperelliptic Curves
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
On the performance of hyperelliptic cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Pairing-Based cryptography at high security levels
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Recent developments on the Tate or Eta pairing computation over hyperelliptic curves by Duursma-Lee and Barreto et al. have focused on degenerate divisors. We present efficient methods that work for general divisors to compute the Eta paring over divisor class groups of the hyperelliptic curves H"d:y^2=x^p-x+d where p is an odd prime. On the curve H"d of genus 3, we provide two efficient methods: The first method generalizes the method of Barreto et al. so that it holds for general divisors, and we call it the pointwise method. For the second method, we take a novel approach using resultant. Our analysis shows that the resultant method is faster than the pointwise method, and our implementation result supports the theoretical analysis. We also emphasize that the Eta pairing technique is generalized to the curve y^2=x^p-x+d,p=1 (mod 4). Furthermore, we provide the closed formula for the Eta pairing computation on general divisors by Mumford representation of the curve H"d of genus 2.