Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves

13 years 10 months ago

Download www.ime.usp.br

We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for 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 pairings save about 20-30% over the usual pairings.

Kirsten Eisenträger, Kristin Lauter, Peter L.

Real-time Traffic

Algorithms | ANTS 2004 | Squared Pairings | Squared Tate | Squared Weil |

claim paper

» Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation

» Ate Pairing on Hyperelliptic Curves

» Efficient pairing computation on supersingular Abelian varieties

» Short Signatures from the Weil Pairing

» PairingBased Cryptography at High Security Levels

» Compressed Pairings

» High Security PairingBased Cryptography Revisited

» Hardware Acceleration of the Tate Pairing in Characteristic Three

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	ANTS
Authors	Kirsten Eisenträger, Kristin Lauter, Peter L. Montgomery

Comments (0)

Sciweavers

Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves

Algorithms | ANTS 2004 | Squared Pairings | Squared Tate | Squared Weil |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers