Home > Papers

 
 
Refinement of Miller's Algorithm over Huff Curves
Gu Haihua 1,Gu Dawu 1 *,Xie Wenlu 2
1.Computer Science and Engineering Department, Shanghai Jiao Tong University
2.Shanghai Huahong Integrated Circuit Co.,Ltd.
*Correspondence author
#Submitted by
Subject:
Funding: Specialized Research Fund for the Doctoral Program of HigherEducation （No.No. 200802480019）, National Natural Science Foundation ofChina （No.No. 61073150）
Opened online: 4 November 2011
Accepted by: none
Citation: Gu Haihua,Gu Dawu ,Xie Wenlu.Refinement of Miller's Algorithm over Huff Curves[OL]. [ 4 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4447520
 
 
Pairings on elliptic curvesare currently of great interest due to their applications in anumber of cryptographic protocols such as identity-based encryption,group signatures, short signatures and the tripartite Diffie Hellman. The Miller's algorithm is the most commonly used method of computing pairing. Denominator elimination can improve the Miller's algorithm when the embedding degree with the form 2i3j. However, if the embedding degree don't have the above form, how to speed up the Miller's algorithm This work gives a refinement to Miller's algorithm over Huff curves. It is about 20.38% faster than the original Miller's algorithm over Huff curves.
Keywords:Cryptography; Elliptic curve; Pairing; Huff curves
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 570
Bookmarked 0
Recommend 5
Comments Array
Submit your papers