43 search results - page 2 / 9 » A Fast Finite Field Multiplier |
GLVLSI
1998
IEEE
13 years 9 months ago
1998
IEEE
APCCAS
2006
IEEE
13 years 11 months ago
2006
IEEE
—The Massey-Omura multiplier is a well-known sequential multiplier over finite fields GF(2m ), which can perform multiplication in m clock cycles for the normal basis. In this ar...
CIS
2006
Springer
13 years 8 months ago
2006
Springer
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
TC
2008
13 years 4 months ago
2008
A high performance architecture of elliptic curve scalar multiplication over finite field GF(2m ) is proposed. A pseudo-pipelined word serial finite field multiplier with word siz...
IAJIT
2006
13 years 5 months ago
2006
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...