27 search results - page 2 / 6 » High-radix modular multiplication for cryptosystems |
ARITH
1993
IEEE
13 years 11 months ago
1993
IEEE
ASIACRYPT
1999
Springer
13 years 11 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
RECONFIG
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of...
IPPS
2003
IEEE
14 years 22 days ago
2003
IEEE
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
IACR
2011
12 years 7 months ago
2011
We describe Charm, an extensible framework designed for rapid prototyping of cryptographic systems that utilize the latest advances in cryptography, such as identity and attribute...