Faster Pairings on Special Weierstrass Curves

Authors:
Craig Costello;Huseyin Hisil;Colin Boyd;Juan Gonzalez Nieto;Kenneth Koon-Ho Wong
Affiliations:
Information Security Institute, Queensland University of Technology, Brisbane, Australia 4001;Information Security Institute, Queensland University of Technology, Brisbane, Australia 4001;Information Security Institute, Queensland University of Technology, Brisbane, Australia 4001;Information Security Institute, Queensland University of Technology, Brisbane, Australia 4001;Information Security Institute, Queensland University of Technology, Brisbane, Australia 4001
Venue:
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Year:
2009

Citing 18
Cited 12

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient Implementation of Pairing-Based Cryptosystems

Journal of Cryptology
A One Round Protocol for Tripartite Diffie–Hellman

Journal of Cryptology
Short Signatures from the Weil Pairing

Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
Elliptic Curves Suitable for Pairing Based Cryptography

Designs, Codes and Cryptography
Rational simplification modulo a polynomial ideal

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Exponentiation in Pairing-Friendly Groups Using Homomorphisms

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Constructing elliptic curves with prescribed embedding degrees

SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Optimised versions of the ate and twisted ate pairings

Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Faster pairings using an elliptic curve with an efficient endomorphism

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Pairing-Based cryptography at high security levels

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Pairing-Friendly elliptic curves of prime order

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
The Eta Pairing Revisited

IEEE Transactions on Information Theory

Fixed argument pairings

LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Delaying mismatched field multiplications in pairing computations

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
An analysis of affine coordinates for pairing computation

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A variant of Miller's formula and algorithm

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A family of implementation-friendly BN elliptic curves

Journal of Systems and Software
Another elliptic curve model for faster pairing computation

ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Efficient pairing computation on Elliptic curves in Hessian form

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Faster pairing computations on curves with high-degree twists

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Avoiding full extension field arithmetic in pairing computations

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Attractive subfamilies of BLS curves for implementing high-security pairings

INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Fast tate pairing computation on twisted Jacobi intersections curves

Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Tate pairing computation on jacobi's elliptic curves

Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3 + 1 over fields of large characteristic. We provide examples of pairing-friendly elliptic curves of this form which are of interest for efficient pairing implementations.