Sciweavers

JAL
1998
74views more  JAL 1998»
13 years 4 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon
DSD
2007
IEEE
114views Hardware» more  DSD 2007»
13 years 11 months ago
General Digit-Serial Normal Basis Multiplier with Distributed Overlap
We present the architecture of digit-serial normal basis multiplier over GF(2m ). The multiplier was derived from the multiplier of Agnew et al. Proposed multiplier is scalable by...
Martin Novotný, Jan Schmidt