### Optimised versions of the Ate and Twisted Ate Pairings

Seiichi Matsuda, Naoki Kanayama, Florian Hess, and Eiji Okamoto

##### 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.

Note: I have modified the definition of $c_S$ and $c_{T^e}$ in section 2 and corrected the abstract.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Ordinary curveTate pairingAte pairingTwisted Ate pairing
Contact author(s)
seichi @ cipher risk tsukuba ac jp
History
Short URL
https://ia.cr/2007/013

CC BY

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},
note = {\url{https://eprint.iacr.org/2007/013}},
url = {https://eprint.iacr.org/2007/013}
}

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