27 search results - page 3 / 6 » High-radix modular multiplication for cryptosystems |
168
click to vote
IPL
1998
15 years 7 months ago
1998
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
212
click to vote
ICCD
2006
IEEE
16 years 4 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...
198
Voted
ARITH
2007
IEEE
16 years 1 months ago
2007
IEEE
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
165
click to vote
FIWAC
1993
15 years 11 months ago
1993
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
222
Voted
GLVLSI
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...