Sciweavers

Share
43 search results - page 1 / 9
» A Fast Finite Field Multiplier
Sort
View
ARC
2007
Springer
140views Hardware» more  ARC 2007»
11 years 5 months ago
A Fast Finite Field Multiplier
We present a method for implementing a fast multiplier for finite fields GF(2m ) generated by irreducible trinomials of the form αm + αn
Edgar Ferrer, Dorothy Bollman, Oscar Moreno
ISDA
2006
IEEE
11 years 5 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- 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...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
TC
2008
10 years 11 months ago
A New Finite-Field Multiplier Using Redundant Representation
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...
Ashkan Hosseinzadeh Namin, Huapeng Wu, Majid Ahmad...
TC
2002
10 years 11 months ago
Finite Field Multiplier Using Redundant Representation
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...
Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhon...
ISCAS
2008
IEEE
287views Hardware» more  ISCAS 2008»
11 years 6 months ago
A high speed word level finite field multiplier using reordered normal basis
— 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 ...
Ashkan Hosseinzadeh Namin, Huapeng Wu, Majid Ahmad...
books