An Efficient and High-Speed Overlap-Free Karatsuba-Based Finite-Field Multiplier for FGPA Implementation

Cryptography systems have become inseparable parts of almost every communication device. Among cryptography algorithms, public-key cryptography, and in particular elliptic curve cryptography (ECC), has become the most dominant protocol at this time. In ECC systems, polynomial multiplication is consi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on very large scale integration (VLSI) systems Ročník 29; číslo 4; s. 667 - 676
Hlavní autoři:	Heidarpur, Moslem, Mirhassani, Mitra
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Binary polynomial multiplier Complexity theory Cryptography Curves Delays Elliptic curve cryptography Field programmable gate arrays field-programmable gate array (FPGA) implementation finite-field multiplier Galois field Hardware hardware cryptography Logic gates Multiplication overlap-free Karatsuba Polynomials
ISSN:	1063-8210, 1557-9999
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!