27 search results - page 4 / 6 » High-radix modular multiplication for cryptosystems |
CTRSA
2004
Springer
14 years 26 days ago
2004
Springer
This paper presents a scalable hardware implementation of both commonly used public key cryptosystems, RSA and Elliptic Curve Cryptosystem (ECC) on the same platform. The introduce...
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
Elliptic Curve Cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the ...
CEE
2007
13 years 7 months ago
2007
It is a challenge to implement large word length public-key algorithms on embedded systems. Examples are smartcards, RF-ID tags and mobile terminals. This paper presents a HW/SW c...
AINA
2003
IEEE
14 years 23 days ago
2003
IEEE
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
CHES
2000
Springer
13 years 11 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...