IEICE TRANSACTIONS on Fundamentals
Optimised Versions of the Ate and Twisted Ate Pairings
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E92-A No.7 pp.1660-1667
- Publication Date
- 2009/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E92.A.1660
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Seiichi MATSUDA, Naoki KANAYAMA, Florian HESS, Eiji OKAMOTO, "Optimised Versions of the Ate and Twisted Ate Pairings" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 7, pp. 1660-1667, July 2009, doi: 10.1587/transfun.E92.A.1660.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.1660/_p
Copy
@ARTICLE{e92-a_7_1660,
author={Seiichi MATSUDA, Naoki KANAYAMA, Florian HESS, Eiji OKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimised Versions of the Ate and Twisted Ate Pairings},
year={2009},
volume={E92-A},
number={7},
pages={1660-1667},
abstract={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.},
keywords={},
doi={10.1587/transfun.E92.A.1660},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Optimised Versions of the Ate and Twisted Ate Pairings
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1660
EP - 1667
AU - Seiichi MATSUDA
AU - Naoki KANAYAMA
AU - Florian HESS
AU - Eiji OKAMOTO
PY - 2009
DO - 10.1587/transfun.E92.A.1660
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2009
AB - 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.
ER -
English
