Paper 2007/013 Original: eprint.iacr.org/2007/013 ↗
Optimised versions of the Ate and Twisted Ate Pairings
Abstract
The Ate pairing and the twisted Ate pairing for ordinary elliptic curves which are generalizations of the $\eta_T$ pairing for supersingular curves have previously been proposed. It is not necessarily the case that both pairings are faster than the Tate pairing. In this paper we propose optimized versions of the Ate and twisted Ate pairings with the loop reduction method and show that both pairings are always at least as fast as the Tate pairing. We also provide suitable families of elliptic curves that our optimized Ate and optimized twisted Ate pairings can be computed with half the loop length compared to the Tate pairing.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2007-01-19: last updated
- 2007-01-19: published
- Short URL
- https://ia.cr/2007/013
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/013,
author = {Seiichi Matsuda and Naoki Kanayama and Florian Hess and Eiji Okamoto},
title = {Optimised versions of the Ate and Twisted Ate Pairings},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/013},
year = {2007},
url = {https://eprint.iacr.org/2007/013}
}