Improved Weil and Tate pairings for elliptic and hyperelliptic curves

Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing on hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our algorithm to evaluate the squared Weil pairing is about 20% more efficient than the standard Weil pairing. Our algorithm for the squared Tate pairing on elliptic curves matches the efficiency of the algorithm given by Barreto, Lynn, and Scott in the case of arbitrary base points where their denominator cancellation technique does not apply. Our algorithm for the squared Tate pairing for hyperelliptic curves is the first detailed implementation of the pairing for general hyperelliptic curves of genus 2, and saves an estimated 30% over the standard algorithm.

Original languageEnglish (US)
Pages (from-to)169-183
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3076
StatePublished - Dec 1 2004

Fingerprint

Weil Pairing
Tate Pairing
Hyperelliptic Curves
Elliptic Curves
Pairing
Denominator
Cancellation
Genus
Computing
Evaluate
Arbitrary

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{c72e7085b840434a8eaa1d077d76798c,
title = "Improved Weil and Tate pairings for elliptic and hyperelliptic curves",
abstract = "We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing on hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our algorithm to evaluate the squared Weil pairing is about 20{\%} more efficient than the standard Weil pairing. Our algorithm for the squared Tate pairing on elliptic curves matches the efficiency of the algorithm given by Barreto, Lynn, and Scott in the case of arbitrary base points where their denominator cancellation technique does not apply. Our algorithm for the squared Tate pairing for hyperelliptic curves is the first detailed implementation of the pairing for general hyperelliptic curves of genus 2, and saves an estimated 30{\%} over the standard algorithm.",
author = "Kirsten Eisentr{\"a}ger and Kristin Lauter and Montgomery, {Peter L.}",
year = "2004",
month = "12",
day = "1",
language = "English (US)",
volume = "3076",
pages = "169--183",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Improved Weil and Tate pairings for elliptic and hyperelliptic curves

AU - Eisenträger, Kirsten

AU - Lauter, Kristin

AU - Montgomery, Peter L.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing on hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our algorithm to evaluate the squared Weil pairing is about 20% more efficient than the standard Weil pairing. Our algorithm for the squared Tate pairing on elliptic curves matches the efficiency of the algorithm given by Barreto, Lynn, and Scott in the case of arbitrary base points where their denominator cancellation technique does not apply. Our algorithm for the squared Tate pairing for hyperelliptic curves is the first detailed implementation of the pairing for general hyperelliptic curves of genus 2, and saves an estimated 30% over the standard algorithm.

AB - We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing on hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for evaluating them are deterministic and do not depend on a random choice of points. Our algorithm to evaluate the squared Weil pairing is about 20% more efficient than the standard Weil pairing. Our algorithm for the squared Tate pairing on elliptic curves matches the efficiency of the algorithm given by Barreto, Lynn, and Scott in the case of arbitrary base points where their denominator cancellation technique does not apply. Our algorithm for the squared Tate pairing for hyperelliptic curves is the first detailed implementation of the pairing for general hyperelliptic curves of genus 2, and saves an estimated 30% over the standard algorithm.

UR - http://www.scopus.com/inward/record.url?scp=35048886487&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048886487&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048886487

VL - 3076

SP - 169

EP - 183

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -