A more efficient and faster pairing computation with cryptographic security

Authors:
I. Praveen;M. Sethumadhavan
Affiliations:
Amrita Vishwa Vidyapeetham, Amritanagar, Coimbatore;Amrita Vishwa Vidyapeetham, Amritanagar, Coimbatore
Venue:
Proceedings of the First International Conference on Security of Internet of Things
Year:
2012

Citing 5
Cited 0

Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
A survey of local and global pairings on elliptic curves and abelian varieties

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Faster pairings using an elliptic curve with an efficient endomorphism

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pairing is one of the main features that elliptic curves possess. Identity Based Encryption (IBE) is one of the most important applications of pairing based cryptography, which is used in low memory devices. Scott improved the speed of pairing computation using non-supersingular curves, which was recommended in IBE scheme. Ionica and Joux extended this method to other classes of curves with small embedding degree and efficiently computable endomorphism. In this paper, we propose this idea can be further extended using another class of elliptic curves, which provides implementation efficiency.