Journal of Cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st 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
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
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
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
International Journal of Information Security
Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
Selected Areas in Cryptography
Efficient and generalized pairing computation on Abelian varieties
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Reducing elliptic curve logarithms to logarithms in a finite field
IEEE Transactions on Information Theory
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Hi-index | 0.89 |
In this paper, new efficient pairings on genus 2 hyperelliptic curves of the form C:y^2=x^5+ax with embedding degree k satisfying 4|k are constructed, that is an improvement for the results of Fan et al. (2008) [10]. Then a variant of Miller@?s algorithm is given to compute our pairings. In this algorithm, we just need to evaluate the Miller function at two divisors for each loop iteration. However, Fan et al. had to compute the Miller function at four divisors. Moreover, compared with Fan et al.@?s algorithm, the exponentiation calculation is simplified. We finally analyze the computational complexity of our pairings, which shows that our algorithm can save 2036m operations in the base field or be 34.1% faster than Fan et al.@?s algorithm. The experimental result shows that our pairing can achieve a better performance.