Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Construction of Cryptographically Strong Elliptic Curves
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Unbelievable Security. Matching AES Security Using Public Key Systems
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Constructing elliptic curves with prescribed embedding degrees
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
IEEE Transactions on Information Theory
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Computing pairings using x-coordinates only
Designs, Codes and Cryptography
Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Faster Pairings on Special Weierstrass Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
Theoretical Computer Science
IEEE Transactions on Information Theory
Computing bilinear pairings on elliptic curves with automorphisms
Designs, Codes and Cryptography
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A method for efficient parallel computation of Tate pairing
International Journal of Grid and Utility Computing
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
Implementing cryptographic pairings
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
An improved twisted ate pairing over KSS curves with k=18
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
A more efficient and faster pairing computation with cryptographic security
Proceedings of the First International Conference on Security of Internet of Things
| Hi-index | 0.06 |
The most significant pairing-based cryptographic protocol to be proposed so far is undoubtedly the Identity-Based Encryption (IBE) protocol of Boneh and Franklin. In their paper [6] they give details of how their scheme might be implemented in practice on certain supersingular elliptic curves of prime characteristic. They also point out that the scheme could as easily be implemented on certain special non-supersingular curves for the same level of security. An obvious question to be answered is – which is most efficient? Motivated by the work of Gallant, Lambert and Vanstone [14] we demonstrate that, perhaps counter to intuition, certain ordinary curves closely related to the supersingular curves originally recommended by Boneh and Franklin, provide better performance. We illustrate our technique by implementing the fastest pairing algorithm to date (on elliptic curves over fields of prime characteristic) for contemporary levels of security, albeit on a rather particular class of curves. We also point out that many of the non-supersingular families of curves recently discovered and proposed for use in pairing-based cryptography can also benefit (to an extent) from the same technique.