Sciweavers

18306 search results - page 26 / 3662
» Algorithmics in Exponential Time
Sort
View
IPL
1998
177views more  IPL 1998»
14 years 9 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
AFRICACRYPT
2009
Springer
15 years 2 months ago
Exponent Recoding and Regular Exponentiation Algorithms
This paper describes methods of recoding exponents to allow for regular implementations of m-ary exponentiation algorithms. Recoding algorithms previously proposed in the literatur...
Marc Joye, Michael Tunstall
STOC
2003
ACM
88views Algorithms» more  STOC 2003»
15 years 10 months ago
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto, Ed...
ICISC
2004
112views Cryptology» more  ICISC 2004»
14 years 11 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...
AINA
2003
IEEE
15 years 3 months ago
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
Chin-Chen Chang, Ying-Tse Kuo, Chu-Hsing Lin