Algorithmic Number Theory

DOI10.1007/B98210zbMATH Open1116.11042arXivmath/0311391OpenAlexW2791103999MaRDI QIDQ5465618FDOQ5465618

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

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: We present algorithms for computing the squared Weil and Tate pairings on elliptic curves 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.

Full work available at URL: https://arxiv.org/abs/math/0311391

Recommendations

• Advances in Cryptology - ASIACRYPT 2003
• scientific article; zbMATH DE number 1962162
• Efficient pairing computation on supersingular abelian varieties
• The Weil pairing, and its efficient calculation
• The Eta Pairing Revisited

zbMATH Keywords

squared Tate pairing on hyperelliptic curvessquared Weil and Tate pairings on elliptic curvessquared Weil pairing

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05)

Cited In (15)

• Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five
• Accelerating beta Weil pairing with precomputation and multi-pairing techniques
• Algebraic curves and cryptography
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• Pairings on hyperelliptic curves
• Hyperelliptic Pairings
• Efficient pairing computation with theta functions
• Advances in Cryptology - ASIACRYPT 2003
• Information Security and Cryptology
• The Weil pairing, and its efficient calculation
• On the relationship between squared pairings and plain pairings
• Faster pairing computation on genus \(2\) hyperelliptic curves
• Pairings on Hyperelliptic Curves with a Real Model
• Algorithmic Number Theory
• The Eta Pairing Revisited

This page was built for publication: Algorithmic Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465618)