We observe a natural generalisation of the ate and twisted ate pairings, which allow for performance improvements in non standard applications of pairings to cryptography like composite group orders. We also give a performance comparison of our pairings and the Tate, ate and twisted ate pairings for certain polynomial families based on operation count estimations and on an implementation, showing that our pairings can achieve a speedup of a factor of up to two over the other pairings. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Matsuda, S., Kanayama, N., Hess, F., & Okamoto, E. (2007). Optimised versions of the ate and twisted ate pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4887 LNCS, pp. 302–312). Springer Verlag. https://doi.org/10.1007/978-3-540-77272-9_18
Mendeley helps you to discover research relevant for your work.