An Improved wNAF Scalar-Multiplication Algorithm With Low Computational Complexity by Using Prime Precomputation

To reduce the computational complexity of scalar multiplication, an improved wNAF scalar-multiplication algorithm is proposed by using prime precomputation. It replaces odd number with prime number in the precomputation stage, and makes up the difference between prime and odd by building the tiny mu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 9; s. 31546 - 31552
Hlavní autoři: Hai, Huang, Ning, Na, Lin, Xing, Zhiwei, Liu, Bin, Yu, Shilei, Zhao
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 2021
Témata:
Addition chains
Computational complexity
Elliptic curve cryptography
Elliptic curves
Greedy algorithms
prime number precomputation
scalar-multiplication algorithm
Windows
ISSN:2169-3536, 2169-3536
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:To reduce the computational complexity of scalar multiplication, an improved wNAF scalar-multiplication algorithm is proposed by using prime precomputation. It replaces odd number with prime number in the precomputation stage, and makes up the difference between prime and odd by building the tiny multi-base chains. Thanks to the proposed algorithm, the computational complexity, the cost of precomputation and the creation time of addition chains are all reduced. Compared with the wNAF, the computational complexity and the running speed are optimized by 28.37% and 77.38% respectively at the fittest case. Also, lower computational complexity and higher running speed are outstanding features of the introduced algorithm than other existing algorithms.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2021.3061124