International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 21 May 2012

Steven D. Galbraith, Chang-An Zhao
ePrint Report ePrint Report
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings are used in some cryptographic schemes and protocols. In this paper, we show how to compute the Tate-Lichtenbaum pairing (D,\\phi(D)) on a curve more efficiently than the general case. The speedup is obtained by requiring a simpler final exponentiation. We also discuss how to use this pairing in cryptographic applications.

Expand

Additional news items may be found on the IACR news page.