Sciweavers

Share
83 search results - page 1 / 17
» A New Finite-Field Multiplier Using Redundant Representation
Sort
View
TC
2008
11 years 1 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
11 years 1 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 7 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...
CIS
2006
Springer
11 years 5 months ago
A New Parallel Multiplier for Type II Optimal Normal Basis
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...
Chang Han Kim, Yongtae Kim, Sung Yeon Ji, IlWhan P...
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
11 years 5 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
Gunnar Gaubatz, Berk Sunar
books