Asset Details
Do you wish to reserve the book?
Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication
Do you wish to request the book?
Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication
2009
Overview
Scalar multiplication nP is the core operation of elliptic curve public-key cryptosystems. Double bases representation of n is proposed to speed up scalar multiplication. Avanzi et al. presented a recoding algorithm for Koblitz curves which works in all cases with optimal constants [
1
]. However, their algorithm may be expensive to implement because it requires many divisions in ℤ[τ]. In this paper, we show that divisions in ℤ[τ] can be replaced by divisions in ℤ. Our improved version of the algorithm runs in about 33% of the time of the Avanzi et al. algorithm on the Koblitz curve K-163, with larger improvements as the size of the curve increases.
Publisher
Taylor & Francis Group,Taylor & Francis Inc
Subject
