44 search results - page 2 / 9 » Finite Field Multiplier Using Redundant Representation |
TCAD
2002
13 years 5 months ago
2002
In this paper, the authors propose an algorithm to find all the minimal signed digit (MSD) representations of a constant and present an algorithm to synthesize digital filters base...
ARITH
2009
IEEE
14 years 12 days ago
2009
IEEE
Hardware implementation of all the basic radix-10 arithmetic operations is evolving as a new trend in the design and implementation of general purpose digital processors. Redundan...
TC
2008
13 years 5 months ago
2008
Since redundant number systems allow for constant time addition, they are often at the heart of modular multipliers designed for public key cryptography (PKC) applications. Indeed,...
FDTC
2006
Springer
13 years 9 months ago
2006
Springer
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 ...
ARITH
2007
IEEE
13 years 12 months ago
2007
IEEE
This paper introduces two novel architectures for parallel decimal multipliers. Our multipliers are based on a new algorithm for decimal carry–save multioperand addition that us...