Implementation of cryptosystems based on Tate pairing

Authors:
Lei Hu;Jun-Wu Dong;Ding-Yi Pei
Affiliations:
State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing, P.R. China;Institute of Information Security, Guangzhou University, Guangzhou, P.R. China;State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2005

Citing 8
Cited 7

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
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
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Comparing the MOV and FR reductions in elliptic curve cryptography

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Constructing elliptic curves with prescribed embedding degrees

SCN'02 Proceedings of the 3rd international conference on Security in communication networks

Pairings on Hyperelliptic Curves with a Real Model

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Efficient ID-based multi-decrypter encryption with short ciphertexts

Journal of Computer Science and Technology
Chameleon hashes without key exposure based on factoring

Journal of Computer Science and Technology
Improved Implementations of Cryptosystems Based on Tate Pairing

ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
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
Pairing calculation on supersingular genus 2 curves

SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Implementing cryptographic pairings

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tate pairings over elliptic curves are important in cryptography since they can be used to construct efficient identity-based cryptosystems, and their implementation dominantly determines the efficiencies of the cryptosystems. In this paper, the implementation of a cryptosystem is provided based on the Tate pairing over a supersingular elliptic curve of MOV degree 3. The implementation is primarily designed to re-use low-level codes developed in implementation of usual elliptic curve cryptosystems. The paper studies how to construct the underlying ground field and its extension to accelerate the finite field arithmetic, and presents a technique to speedup the time-consuming powering in the Tate pairing algorithm.