Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On lattice reduction for polynomial matrices
Journal of Symbolic Computation
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Ate Pairing on Hyperelliptic Curves
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based 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
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
Fast Hashing to G2 on Pairing-Friendly 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
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
High security pairing-based cryptography revisited
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
An Artificial Immune System Heuristic for Generating Short Addition Chains
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Information Theory
Implementing cryptographic pairings over barreto-naehrig curves
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Proceedings of the 2012 ACM conference on Computer and communications security
Using SMT solvers to automate design tasks for encryption and signature schemes
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
Pairing-Based Cryptography has become relevant in industry mainly because of the increasing interest in Identity-Based protocols. A major deterrent to the general use of pairing-based protocols is the complex nature of such protocols; efficient implementation of pairing functions is often difficult as it requires more knowledge than previous cryptographic primitives. In this paper we present a tool for automatically generating optimized code for pairing functions. Our cryptographic compiler chooses the most appropriate pairing function for the target family of curves, either the Tate, ate, R-ate or Optimal pairing function, and generates its code. It also generates optimized code for the final exponentiation using the parameterisation of the chosen pairing-friendly elliptic curve.