Implementing the Tate pairing

Galbraith, Steven D. ; Harrison, Keith ; Soldera, David

HP Development Company

关键词: Tate pairing;    bilinear pairing;    implementing characteristic 3;   

RP-ID  :  HPL-2002-23

学科分类：计算机科学（综合）

美国|英语

来源: HP Labs

【 摘 要 】

The Weil and Tate pairings have found several new applications in cryptography. To efficiently implement these cryptosystems it is necessary to optimise the computation time for the Tate pairing. This paper provides methods to achieve fast computation of the Tate pairing. We also give division-free formulae for point tripling on a family of elliptic curves in characteristic three. Examples of the running time for these methods are given. Notes: Steven D. Galbraith, Mathematics Department, Royal Holloway University of London, Egham, Surrey TW20 0EX, UK 14 Pages