Handbook of Applied Cryptography
Handbook of Applied Cryptography
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Efficient computations of the Tate pairing for the large MOV degrees
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Fast elliptic curve arithmetic and improved weil pairing evaluation
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
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 Computation on Twisted Edwards Form Elliptic Curves
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Computing pairings using x-coordinates only
Designs, Codes and Cryptography
On the application of pairing based cryptography to wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Delaying mismatched field multiplications in pairing computations
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Computing bilinear pairings on elliptic curves with automorphisms
Designs, Codes and Cryptography
High speed flexible pairing cryptoprocessor on FPGA platform
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Another elliptic curve model for faster pairing computation
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Efficient pairing computation on Elliptic curves in Hessian form
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
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 pairing computations on curves with high-degree twists
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Avoiding full extension field arithmetic in pairing computations
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Fast tate pairing computation on twisted Jacobi intersections curves
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Secure dual-core cryptoprocessor for pairings over Barreto-Naehrig curves on FPGA platform
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-and-line computation and add-and-line computation has been introduced. We also describe the encapsulated version of iterated doubling. Detailed algorithms are presented in each case and memory requirement has been considered. The inherent parallelism in each of the algorithms have been identified leading to optimal two-multiplier algorithm. The cost comparison of our algorithm with previously best known algorithms shows an efficiency improvement of around 33% in the general case and an efficiency improvement of 20% for the case of the curve parameter a = –3.