Efficient Implementation of Karatsuba Algorithm Based Three-Operand Multiplication Over Binary Extension Field

Three-operation multiplication (TOM) over binary extension field is frequently encountered in cryptosystems such as elliptic curve cryptography. Though digit-serial polynomial basis multipliers are usually preferred for the realization of TOM due to their efficient tradeoff in implementation complex...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 6; S. 38234 - 38242
Hauptverfasser:	Lee, Chiou-Yng, Fan, Chia-Chen, Xie, Jiafeng, Yuan, Shyan-Ming
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.01.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Complexity Complexity theory Computer architecture Computer systems Cryptography Curves Delays Digit-level serial-in parallel-out (DL-SIPO) multiplier Elliptic curve cryptography Karatsuba-algorithm (KA) decomposition Logic gates low-complexity Multiplication Polynomials Pulse width modulation three-operand multiplication (TOM)
ISSN:	2169-3536, 2169-3536
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!