Sciweavers

2767 search results - page 4 / 554
» Universal Exponentiation Algorithm
Sort
View
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
15 years 11 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
COLT
2004
Springer
15 years 11 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter
CRYPTO
1993
Springer
159views Cryptology» more  CRYPTO 1993»
15 years 10 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»
15 years 5 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