Multiplicador escalable de cuerpos finitos (A Scalable Finite Field Multiplier)

Joan Josep Climent (jcliment@ua.es)1, Federico García Crespi (fedeg@umh.es)2, Angel Grediaga (angel.grediaga@ua.es)3


1Universidad Alicante
2Universidad Miguel Hernández de Elche
3Universidad de Alicante

This paper appears in: Revista IEEE América Latina

Publication Date: Dec. 2008
Volume: 6,   Issue: 7 
ISSN: 1548-0992


Abstract:
The hardware ‑ software codesign of cryptosistems, is the best solution to reach a reasonable yield in systems with resources limitation. In the last years, the cryptosistems based on elliptic curves (CEE) have acquired an increasing importance, managing at present to form a part of the industrial standards. In the underlying finite field of an CEE squaring and field multiplication is the next computational costly operations other than field inversion. This paper presents an algorithm for multiplication in binary fields GF(2^m) using a polynomial basis representation and with interleaving reduction. The finite field multiplier operates over a variety of binary fields and it is scalable.

Index Terms:
finite field arithmetic, FPGA, binary field, scalable multiplier, interleaving reduction, polynomial representation.   


Documents that cite this document
This function is not implemented yet.


[PDF Full-Text (317)]