93 search results - page 1 / 19 » Applications of The Montgomery Exponent |
156
Voted
ITCC
2005
IEEE
15 years 9 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...
141
Voted
GLVLSI
2007
IEEE
15 years 7 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...
133
Voted
ARITH
2007
IEEE
15 years 10 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...
106
Voted
PKC
2000
Springer
15 years 7 months ago
2000
Springer
123
Voted
ANTS
2004
Springer
15 years 9 months ago
2004
Springer
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...