Please use this identifier to cite or link to this item:
|Title:||Improved precomputation scheme for scalar multiplication on elliptic curves||Authors:||Le, D.-P.
|Keywords:||elliptic curve cryptography
|Issue Date:||2011||Citation:||Le, D.-P.,Tan, C.H. (2011). Improved precomputation scheme for scalar multiplication on elliptic curves. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7089 LNCS : 327-343. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-25516-8_20||Abstract:||Precomputation is essential for window-based scalar multiplications which are the most important operation of elliptic curve cryptography. This precomputation stage may require a significant amount of time due to the expensive inversions over finite fields of large characteristic. Hence, the existing state-of-the-art precomputation schemes try to reduce the number of inversions as much as possible. However, our analysis show that the performance of precomputation schemes not only depends on the cost of field inversions, but also on the cost ratio of inversion to multiplication (i.e. I/M). In this paper, we present a new scheme to precompute all odd multiples P,..., [2k - 1]P, k ≥ 2 on standard elliptic curves in affine coordinates. Our precomputation scheme strikes a balance between the number of inversions and multiplications. We show that our scheme requiring only 2(k - 1) registers, offers the best performance in the case of k ≥ 8 if the I/M-ratio is around 10. © 2011 Springer-Verlag.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/115439||ISBN:||9783642255151||ISSN:||03029743||DOI:||10.1007/978-3-642-25516-8_20|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 26, 2020
checked on Nov 28, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.