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

Podrobná bibliografia

Vydané v:	IEEE access Ročník 9; s. 31546 - 31552
Hlavní autori:	Hai, Huang, Ning, Na, Lin, Xing, Zhiwei, Liu, Bin, Yu, Shilei, Zhao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 2021
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!