6 search results - page 1 / 2 » High-Radix Design of a Scalable Modular Multiplier |
CHES
2001
Springer
14 years 11 months ago
2001
Springer
This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and t...
IWSOC
2005
IEEE
15 years 4 days ago
2005
IEEE
This paper describes a very high radix scalable Montgomery multiplier. It extends the radix-2 Tenca-Koç scalable architecture using w × v – bit integer multipliers in place of...
IAJIT
2006
14 years 6 months ago
2006
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
ICCD
2006
IEEE
15 years 3 months ago
2006
IEEE
— High secure cryptographic systems require large bit-length encryption keys which presents a challenge to their efficient hardware implementation especially in embedded devices...
ICCD
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper, an efficient Montgomery multiplier is introduced for the modular exponentiation operation, which is fundamental to numerous public-key cryptosystems. Four aspects a...