Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
High-Speed Software Multiplication in F2m
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Efficient Implementation of Pairing-Based Cryptosystems
Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
On Software Parallel Implementation of Cryptographic Pairings
Selected Areas in Cryptography
Efficient and generalized pairing computation on Abelian varieties
IEEE Transactions on Information Theory
Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Field inversion and point halving revisited
IEEE Transactions on Computers
IEEE Transactions on Information Theory
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Efficient software implementation of binary field arithmetic using vector instruction sets
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
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
FPGA implementation of pairings using residue number system and lazy reduction
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Optimal eta pairing on supersingular genus-2 binary hyperelliptic curves
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Parallelizing the weil and tate pairings
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Publicly verifiable secret sharing for cloud-based key management
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Secure and fast implementations of two involution ciphers
NordSec'10 Proceedings of the 15th Nordic conference on Information Security Technology for Applications
Faster pairing coprocessor architecture
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Implementing pairings at the 192-bit security level
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Hi-index | 0.00 |
We describe a high-speed software implementation of the ηT pairing over binary supersingular curves at the 128-bit security level. This implementation explores two types of parallelism found in modern multi-core platforms: vector instructions and multiprocessing. We first introduce novel techniques for implementing arithmetic in binary fields with vector instructions. We then devise a new parallelization of Miller's Algorithm to compute pairings. This parallelization provides an algorithm for pairing computation without increasing storage costs significantly. The combination of these acceleration techniques produce serial timings at least 24% faster and parallel timings 66% faster than the best previous result in an Intel Core platform, establishing a new state-of-the-art implementation of this pairing instantiation in this platform.