By Topic

A Combination of a New Five-Element JSF and Frobenius Map in Point Multiplication of ECC Over GF(2mn)

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 $13
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

2 Author(s)
Xianwen Yang ; Inf. Sci. & Technol. Inst., Zhengzhou, China ; Zheng Li

Based on the existing researches of joint sparse form (JSF), a new five-element JSF is proposed in this paper. For every pair of integers with / binary representations length, it is proved that the average joint hamming weight of its new five-element JSF is 0.333/. Besides, Lee et al proposed a point multiplication algorithm of elliptic curve over GF(2mn) with 10lesmles20, in which Frobenius map was used to expand the integer k and each coefficient of the expansion is represented as a binary string. In this paper, with the application of the new five-element JSF to the coefficients, some variations of Lee et al's algorithm are proposed, and it can achieve a better performance with a few more storages.

Published in:

Image and Signal Processing, 2009. CISP '09. 2nd International Congress on

Date of Conference:

17-19 Oct. 2009