Improved Implementations of Cryptosystems Based on Tate Pairing

Authors:
Chang-An Zhao;Dongqing Xie;Fangguo Zhang;Chong-Zhi Gao;Jingwei Zhang
Affiliations:
School of Computer Science and Educational Software, Guangzhou University, Guangzhou, P.R. China 510006;School of Computer Science and Educational Software, Guangzhou University, Guangzhou, P.R. China 510006;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, P.R. China 510275;School of Computer Science and Educational Software, Guangzhou University, Guangzhou, P.R. China 510006;School of Information Science and Technology, Sun Yat-sen University, Guangzhou, P.R. China 510275
Venue:
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Year:
2009

Citing 12
Cited 0

A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Elliptic curves in cryptography

Elliptic curves in cryptography
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
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Implementation of cryptosystems based on Tate pairing

Journal of Computer Science and Technology
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
A note on the Ate pairing

International Journal of Information Security
Efficient and generalized pairing computation on Abelian varieties

IEEE Transactions on Information Theory
Optimised versions of the ate and twisted ate pairings

Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
The Eta Pairing Revisited

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

Hu et al . first studied pairing computations on supersingular elliptic curve with odd embedding degree k = 3 and applied them to Identity-based cryptosystems. In this paper, a careful analysis of the pairing computation on this family of supersingular curves is given. Some novel improvements are presented from different points of view and hence speed up the implementation of Identity-based cryptosystems.