Referenced Items are not available for this document.
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
- Page(s):
- 1 - 4
- E-ISBN :
- 978-1-4244-4131-0
- Print ISBN:
- 978-1-4244-4129-7
- INSPEC Accession Number:
- 10956019
- Conference Location :
- Tianjin
- Digital Object Identifier :
- 10.1109/CISP.2009.5301338
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
