Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Optimised versions of the ate and twisted ate pairings
Cryptography and Coding'07 Proceedings of the 11th IMA 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
IEEE Transactions on Information Theory
Computing pairings using x-coordinates only
Designs, Codes and 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
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
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
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
Efficient multiplication in finite field extensions of degree 5
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Security of prime field pairing cryptoprocessor against differential power attack
InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
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
Attractive subfamilies of BLS curves for implementing high-security pairings
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Secure dual-core cryptoprocessor for pairings over Barreto-Naehrig curves on FPGA platform
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Inverting the final exponentiation of tate pairings on ordinary elliptic curves using faults
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
In this paper we provide explicit formulæ to compute bilinear pairings in compressed form. We indicate families of curves where the proposed compressed computation method can be applied and where particularly generalized versions of the Eta and Ate pairings due to Zhao et al. are especially efficient. Our approach introduces more flexibility when trading off computation speed and memory requirement. Furthermore, compressed computation of reduced pairings can be done without any finite field inversions. We also give a performance evaluation and compare the new method with conventional pairing algorithms.