106
click to vote
AAECC
15 years 4 months ago
2006 Springer 
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
168
click to vote
AAECC
15 years 10 months ago
2006 Springer
The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...
147
click to vote
AAECC
15 years 4 months ago
2006 Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
148
click to vote
AAECC
15 years 4 months ago
2006 Springer
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...
124
Voted
AAECC
15 years 4 months ago
2006 Springer 
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
|
Algorithms