Efficient pairing computation on supersingular Abelian varieties

By Paulo L. Barreto, Steven D. Galbraith, Colm O'hEigeartaigh, Michael Scott. IACR Cryptology ePrint Archive, 2007

507 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Information Systems

View Paper: https://www.semanticscholar.org/paper/01bcbe417636aa55b4d7d2055ee78fe1343ae7f7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Geometry and Topology

In Information Systems

Citations in the corpus

On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 (2008, methodology): “Pairings such as the Weil pairing (other proposed pairings include the Tate pairing, the Eta pairing [2], or the Ate pairing [7]) are used in many cryptographic applications such as identity based encryption [4], one-round 3-party key agreement protocols [8], and short signature schemes [21].”
NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks (2008, background): “Due to space limitations please refer to [52] for a detailed description and explanation of this method.”
The Eta Pairing Revisited (2006, methodology): “However, other related pairings are available which in certain situations are more efficient, for example the Eta-pairing [1] on certain supersingular elliptic curves, which in itself extended and optimized the Duursma-Lee techniques introduced in [9].”
A Taxonomy of Pairing-Friendly Elliptic Curves (2010, methodology): “The most common pairings used in applications are the Tate and Weil pairings on elliptic curves over finite fields; other proposed pairings include the Eta pairing [4] and the recently discovered Ate pairing [34].”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, background): “Recent advances in the area of bilinear pairings have produced new and more efficient variants of the Tate pairing, known as " Eta " [2] and " Ate " [27].”
An Identity-Based Security System for User Privacy in Vehicular Ad Hoc Networks (2010, background): “Recent progress [40] shows that the computation time of Tate pairing on elliptic curves in characteristic 2 and 3 has been significantly improved, rendering pairing-based cryptosystems more realistic in security applications.”
Pairing-Based Cryptography at High Security Levels (2005, methodology): “We would like to thank Darrel Hankerson and Arjen Lenstra for answering our questions about efficient finite field arithmetic, Oliver Schirokauer for answering questions about the number field sieve, Paulo Barreto and Michael Scott for calling our attention to the papers [47] and [3], and Steven Gal”
Cooperative Provable Data Possession for Integrity Verification in Multicloud Storage (2012, methodology): “We neglect the computation cost of algebraic operations and simple modular arithmetic operations because they run fast enough [16].”