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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE access Jg. 9; S. 31546 - 31552
Hauptverfasser:	Hai, Huang, Ning, Na, Lin, Xing, Zhiwei, Liu, Bin, Yu, Shilei, Zhao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 2021
Schlagworte:	Addition chains Computational complexity Elliptic curve cryptography Elliptic curves Greedy algorithms prime number precomputation scalar-multiplication algorithm Windows
ISSN:	2169-3536, 2169-3536
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!