Sciweavers

1449 search results - page 1 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
13 years 10 months ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
DAGSTUHL
2007
13 years 6 months ago
On the Properties of Moments of Matrix Exponential Distributions and Matrix Exponential Processes
In this paper we provide properties of moments of matrix exponential distributions and joint moments of matrix exponential processes. Based on the provided properties, an algorith...
Levente Bodrog, András Horváth, Mikl...
CRYPTO
1993
Springer
159views Cryptology» more  CRYPTO 1993»
13 years 9 months ago
Comparison of Three Modular Reduction Functions
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...
Antoon Bosselaers, René Govaerts, Joos Vand...
IPL
1998
177views more  IPL 1998»
13 years 4 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
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...
JaeCheol Ha, Sang-Jae Moon
ICISC
2004
112views Cryptology» more  ICISC 2004»
13 years 6 months ago
Improvement on Ha-Moon Randomized Exponentiation Algorithm
Randomized recoding on the exponent of an exponentiation computation into a signed-digit representation has been a well known countermeasure against some side-channel attacks. Howe...
Sung-Ming Yen, Chien-Ning Chen, Sang-Jae Moon, Jae...