Open AccessEfficient Pairing Computation on Twisted Weierstrass Curves
Author(s) -
Wang Bei,
Ouyang Yi,
Hu Honggang
Publication year - 2018
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2018.05.004
Subject(s) - pairing , computation , mathematics , loop (graph theory) , combinatorics , algorithm , physics , quantum mechanics , superconductivity
In this paper, we construct the twists of twisted Edwards curves in Weierstrass form. Then we define a new twisted Ate pairing on twisted Weierstrass curves named the Tx‐Ate pairing. Following Miller's algorithm, we give a computation of the Tx‐Ate pairing on high degree twisted Weierstrass curves, where the point operations are over Edwards form, and the computation of Miller function is over Weierstrass form. Although, in one doubling loop, our method to compute the Tx‐Ate pairing is a litter slower than the previously fastest method. By twists, the Tx‐Ate pairing can be calculated on more twisted Weierstrass curves with short loop length. The Tx‐Ate pairing is even competitive with optimal Ate pairing when they have the same short loop length.