43 search results - page 1 / 9 » A Fast Finite Field Multiplier |
ARC
2007
Springer
13 years 10 months ago
2007
Springer
We present a method for implementing a fast multiplier for finite fields GF(2m ) generated by irreducible trinomials of the form αm + αn
ISDA
2006
IEEE
13 years 10 months ago
2006
IEEE
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
TC
2008
13 years 4 months ago
2008
A novel serial-in parallel-out finite field multiplier using redundant representation is proposed. It is shown that the proposed architecture has either a significantly lower compl...
TC
2002
13 years 4 months ago
2002
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclo...
ISCAS
2008
IEEE
13 years 11 months ago
2008
IEEE
— Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered ...