Finite field polynomial 16-bit multiplier for power constrained devices

José Antonio Flores Escobar, Moisés Salinas Rosales, José Velázquez López

Research output: Contribution to conferencePaperpeer-review

Abstract

In this work a finite field polynomial multiplier is presented. The multiplier is based on two-step algorithm performing the multiplication with the add and shift algorithm. A FPGA was chosen to implement the multiplier design, resulting the multiplication performed on 256 AND gates.

Original languageEnglish
Pages162-167
Number of pages6
DOIs
StatePublished - 2012
Event22nd Annual International Conference on Electronics, Communications and Computers, CONIELECOMP 2012 - Cholula, Mexico
Duration: 27 Feb 201229 Feb 2012

Conference

Conference22nd Annual International Conference on Electronics, Communications and Computers, CONIELECOMP 2012
Country/TerritoryMexico
CityCholula
Period27/02/1229/02/12

Fingerprint

Dive into the research topics of 'Finite field polynomial 16-bit multiplier for power constrained devices'. Together they form a unique fingerprint.

Cite this