Publication Type : Conference Paper
Publisher : Proceedings of the First International Conference on Security of Internet of Things
Source : Proceedings of the First International Conference on Security of Internet of Things, ACM, New York, NY, USA, p.145-149 (2012)
Url : http://doi.acm.org/10.1145/2490428.2490448
ISBN : 9781450318228
Keywords : Miller's algorithm, MNT curves, Tate pairing
Campus : Coimbatore
School : School of Engineering
Center : TIFAC CORE in Cyber Security
Department : Computer Science, Mathematics, cyber Security
Verified : Yes
Year : 2012
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.
Cite this Research Publication : I. Praveen and Dr. M. Sethumadhavan, “A More Efficient and Faster Pairing Computation with Cryptographic Security”, in Proceedings of the First International Conference on Security of Internet of Things, New York, NY, USA, 2012, pp. 145-149.