### Pairing Computation on Elliptic Curves of Jacobi Quartic Form

Hong Wang, Kunpeng Wang, Lijun Zhang, and Bao Li

##### Abstract

This paper proposes explicit formulae for the addition step and doubling step in Miller's algorithm to compute Tate pairing on Jacobi quartic curves. We present a geometric interpretation of the group law on Jacobi quartic curves, %and our formulae for Miller's %algorithm come from this interpretation. which leads to formulae for Miller's algorithm. The doubling step formula is competitive with that for Weierstrass curves and Edwards curves. Moreover, by carefully choosing the coefficients, there exist quartic twists of Jacobi quartic curves from which pairing computation can benefit a lot. Finally, we provide some examples of supersingular and ordinary pairing friendly Jacobi quartic curves.

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. unpublished
Keywords
elliptic curvepairinggeometric interpretation
Contact author(s)
hwang @ is ac cn
History
2010-10-25: revised
See all versions
Short URL
https://ia.cr/2010/475

CC BY

BibTeX

@misc{cryptoeprint:2010/475,
author = {Hong Wang and Kunpeng Wang and Lijun Zhang and Bao Li},
title = {Pairing Computation on Elliptic Curves of Jacobi Quartic Form},
howpublished = {Cryptology ePrint Archive, Paper 2010/475},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/475}},
url = {https://eprint.iacr.org/2010/475}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.