A more efficient and faster pairing computation with cryptographic security

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.