Referenced Items are not available for this document.
We improve the greedy algorithm which converts integers into double-base chains by introducing tree structure. The new method accelerates the convergence of greedy algorithm, which makes the double-base expansions shorter than before. And it reduces the cost of computing scalar multiplication on elliptic curves. Furthermore, new algorithm performs well in flexibility. We could adjust it to return more efficient expansions for scalar multiplication on special curves. We also discuss the impact of parameters on the performance of new method.
Published in:
Information Assurance and Security, 2009. IAS '09. Fifth International Conference on
(Volume:1
)
Date of Conference: 18-20 Aug. 2009
- Page(s):
- 445 - 450
- Print ISBN:
- 978-0-7695-3744-3
- INSPEC Accession Number:
- 10915594
- Conference Location :
- Xi'an
- Digital Object Identifier :
- 10.1109/IAS.2009.207
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.
