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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 6; s. 38234 - 38242
Hlavní autoři:	Lee, Chiou-Yng, Fan, Chia-Chen, Xie, Jiafeng, Yuan, Shyan-Ming
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.01.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
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!

Buďte první, kdo okomentuje tento záznam!