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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on very large scale integration (VLSI) systems Vol. 29; no. 4; pp. 667 - 676
Main Authors:	Heidarpur, Moslem, Mirhassani, Mitra
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!