Proceedings of the 2016 International Conference on Sensor Network and Computer Engineering

<Previous Article In Volume
Next Article In Volume>

Pairing Computation in Jacobi Quartic Curves Using Weight Projective Coordinates

Authors
Yajuan Ren
Corresponding Author
Yajuan Ren
Available Online July 2016.
DOI
10.2991/icsnce-16.2016.18How to use a DOI?
Keywords
Elliptic curve; Jacobi quartic curve; Tate pairing; Miller function; Cryptography
Abstract

In this paper, we present the pairing computation on Jacobi quadric curves using weight projective coordinates. In our algorithm, the cost of addition step reduced to 1M+(k+9)m+3s+1mt, and the cost of doubling step is 1M+1S+(k+3)m+8s+2ma+1md.

Copyright
© 2016, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2016 International Conference on Sensor Network and Computer Engineering
Series
Advances in Engineering Research
Publication Date
July 2016
ISBN
10.2991/icsnce-16.2016.18
ISSN
2352-5401
DOI
10.2991/icsnce-16.2016.18How to use a DOI?
Copyright
© 2016, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Yajuan Ren
PY  - 2016/07
DA  - 2016/07
TI  - Pairing Computation in Jacobi Quartic Curves Using Weight Projective Coordinates
BT  - Proceedings of the 2016 International Conference on Sensor Network and Computer Engineering
PB  - Atlantis Press
SP  - 93
EP  - 97
SN  - 2352-5401
UR  - https://doi.org/10.2991/icsnce-16.2016.18
DO  - 10.2991/icsnce-16.2016.18
ID  - Ren2016/07
ER  -