DELTA
2006
IEEE
13 years 8 months ago
2006
IEEE
The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multip...
CHES
2000
Springer
13 years 9 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...
DATE
2010
IEEE
2010
IEEE
pSHS: A scalable parallel software implementation of Montgomery multiplication for multicore systems
13 years 9 months ago
—Parallel programming techniques have become one of the great challenges in the transition from single-core to multicore architectures. In this paper, we investigate the parallel...
INDOCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
The Montgomery multiplication is often used for an efficient implementations of public-key cryptosystems. This algorithm occasionally needs an extra subtraction in the final step,...
ITCC
2005
IEEE
13 years 10 months ago
2005
IEEE
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...
ARITH
2007
IEEE
13 years 11 months ago
2007
IEEE
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...