Improved Implementations of Cryptosystems Based on Tate Pairing

摘要

Hu et al. first studied pairing computations on supersingu-lar 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.