Self-pairings on hyperelliptic curves

Journal of mathematical cryptology

article

Steven D. Galbraith¹  Chang-An Zhao² 

[1] Mathematics Department, University of Auckland, Private Bag 92019;Department of Mathematics, Sun Yat-sen University

关键词: Tate pairing;    Weil pairing;    self-pairing;    pairing based cryptography;   

DOI  :  10.1515/jmc-2012-0009

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

Abstract. 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 on a curve more efficiently than the general case. The speedup is obtained by using a simpler final exponentiation. We also discuss how to use this pairing in cryptographic applications.

【 授权许可】

CC BY|CC BY-NC-ND