Efficient Pairing Computation on Supersingular Abelian Varieties (2004)
by
Paulo S. L. M. Barreto
,
Steven Galbraith
,
Colm O Heigeartaigh
,
Michael Scott
| Venue: | Designs, Codes and Cryptography |
| Citations: | 111 - 20 self |
BibTeX
@INPROCEEDINGS{Barreto04efficientpairing,
author = {Paulo S. L. M. Barreto and Steven Galbraith and Colm O Heigeartaigh and Michael Scott},
title = {Efficient Pairing Computation on Supersingular Abelian Varieties},
booktitle = {Designs, Codes and Cryptography},
year = {2004},
pages = {239--271}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. As particular cases, we describe efficient pairing algorithms for elliptic and hyperelliptic curves in characteristic 2. The latter is faster than all previously known pairing algorithms, and as a bonus also gives rise to faster conventional Jacobian arithmetic.
