32 search results - page 6 / 7 » Polynomial Interpolation of the Discrete Logarithm |
SIGMOD
2008
ACM
14 years 6 months ago
2008
ACM
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
ASIACRYPT
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
VIS
2004
IEEE
14 years 7 months ago
2004
IEEE
Computational simulation of time-varying physical processes is of fundamental importance for many scientific and engineering applications. Most frequently, time-varying simulation...
EUROCRYPT
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...