JAL
1998
13 years 11 months ago
1998
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...
DSD
2007
IEEE
14 years 5 months ago
2007
IEEE
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...