By Topic

Improved base-φ expansion method for Koblitz curves over optimal extension fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
B. Chung ; Dept. of Electr. Eng. & Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Daejeon ; H. Kim ; H. Yoon

An improved base-phi expansion method is proposed, in which the bit-length of coefficients is shorter and the number of coefficients is smaller than in Kobayashi's expansion method. The proposed method meshes well with efficient multi-exponentiation algorithms. In addition, two efficient algorithms based on the proposed expansion method, named phi-wNAF and phi-SJSF, are presented which significantly reduce the computational effort involved in online precomputation by using the property of Frobenius endomorphism. The proposed algorithms noticeably accelerate computation of a scalar multiplication on Koblitz curves over optimal extension fields (OEFs). In particular, for OEFs where the characteristic is close to 32 bits or 64 bits, the required number of additions is reduced up to 50% in comparison with Kobayashi's base-phi scalar multiplication algorithm. Finally, a method that significantly reduces the memory usage of the precomputation table at the expense of slightly more computation is presented

Published in:

IET Information Security  (Volume:1 ,  Issue: 1 )