首页 | 本学科首页   官方微博 | 高级检索  
     


Efficient Computation of Eta Pairing over Binary Field with Vandermonde Matrix
Authors:Masaaki Shirase  Tsuyoshi Takagi  Dooho Choi  DongGuk Han  Howon Kim
Abstract:This paper provides an efficient algorithm for computing the ηT pairing on supersingular elliptic curves over fields of characteristic two. In the proposed algorithm, we deploy a modified multiplication in urn:x-wiley:12256463:etr20129:equation:etr20129-math-0001 using the Vandermonde matrix. For urn:x-wiley:12256463:etr20129:equation:etr20129-math-0002, the proposed multiplication method computes β · F · G instead of F · G with some urn:x-wiley:12256463:etr20129:equation:etr20129-math-0003 because β is eliminated by the final exponentiation of the ηT pairing computation. The proposed multiplication method asymptotically requires only 7 multiplications in urn:x-wiley:12256463:etr20129:equation:etr20129-math-0004 as n → ∞, while the cost of the previously fastest Karatsuba method is 9 multiplications in urn:x-wiley:12256463:etr20129:equation:etr20129-math-0005. Consequently, the cost of the ηT pairing computation is reduced by 14.3%.
Keywords:Cryptography  η  T pairing  finite field  loop unrolling  Vandermonde matrix
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号