104 search results - page 1 / 21 » A Survey of Fast Exponentiation Methods |
JAL
1998
13 years 4 months ago
1998
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
AUSSOIS
2001
Springer
13 years 9 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
IPL
1998
13 years 4 months ago
1998
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...
SIGPRO
2010
13 years 3 months ago
2010
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
CGF
2011
13 years 5 days ago
2011
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard