The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Faster Pairings on Special Weierstrass Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
A Taxonomy of Pairing-Friendly Elliptic Curves
Journal of Cryptology
Constructing elliptic curves with prescribed embedding degrees
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
On compressible pairings and their computation
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
IEEE Transactions on Information Theory
New software speed records for cryptographic pairings
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Constructing tower extensions of finite fields for implementation of pairing-based cryptography
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
High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves
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
Faster explicit formulas for computing pairings over ordinary curves
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Faster squaring in the cyclotomic subgroup of sixth degree extensions
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
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
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
On the efficient implementation of pairing-based protocols
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
SP 800-57. Recommendation for Key Management, Part 1: General (revised)
SP 800-57. Recommendation for Key Management, Part 1: General (revised)
IEEE Transactions on Information Theory
Implementing pairings at the 192-bit security level
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Hi-index | 0.00 |
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. This paper shows that particular choices of the pairing-friendly search parameter give rise to four subfamilies of BLS curves, all of which offer highly efficient and implementation-friendly pairing instantiations. Curves from these particular subfamilies are defined over prime fields that support very efficient towering options for the full extension field. The coefficients for a specific curve and its correct twist are automatically determined without any computational effort. The choice of an extremely sparse search parameter is immediately reflected by a highly efficient optimal ate Miller loop and final exponentiation. As a resource for implementors, we give a list with examples of implementation-friendly BLS curves through several high-security levels.