Accelerating twisted ate pairing with frobenius map, small scalar multiplication, and multi-pairing

5Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the case of Barreto-Naehrig pairing-friendly curves of embedding degree 12 of order r, recent efficient Ate pairings such as R-ate, optimal, and Xate pairings achieve Miller loop lengths of . On the other hand, the twisted Ate pairing requires loop iterations, and thus is usually slower than the recent efficient Ate pairings. This paper proposes an improved twisted Ate pairing using Frobenius maps and a small scalar multiplication. The proposal splits the Miller's algorithm calculation into several independent parts, for which multi-pairing techniques apply efficiently. The maximum number of loop iterations in Miller's algorithm for the proposed twisted Ate pairing is equal to the attained by the most efficient Ate pairings. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Sakemi, Y., Takeuchi, S., Nogami, Y., & Morikawa, Y. (2010). Accelerating twisted ate pairing with frobenius map, small scalar multiplication, and multi-pairing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5984 LNCS, pp. 47–64). https://doi.org/10.1007/978-3-642-14423-3_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free