Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ARC
2007
Springer

favoriteEmaildiscussreport

140views Hardware» more ARC 2007»

A Fast Finite Field Multiplier

13 years 10 months ago

A Fast Finite Field Multiplier

Download cuhwww.upr.clu.edu

We present a method for implementing a fast multiplier for ﬁnite ﬁelds GF(2m ) generated by irreducible trinomials of the form αm + αn

Edgar Ferrer, Dorothy Bollman, Oscar Moreno

Real-time Traffic

ARC 2007 | Fast Multiplier | Hardware | Irreducible Trinomials |

claim paper

Related Content

» Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis

» A New FiniteField Multiplier Using Redundant Representation

» Finite Field Multiplier Using Redundant Representation

» A high speed word level finite field multiplier using reordered normal basis

» LowPower Design of Finite Field Multipliers for Wireless Applications

» Another Look at the Sequential Multiplier over Normal Bases

» A New Parallel Multiplier for Type II Optimal Normal Basis

» HighPerformance Architecture of Elliptic Curve Scalar Multiplication

» Fast 160Bits GF P Elliptic Curve Crypto Hardware of HighRadix Scalable Multipliers

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	ARC
Authors	Edgar Ferrer, Dorothy Bollman, Oscar Moreno

Comments (0)