1379 search results - page 66 / 276 » The Complexity of the Annihilating Polynomial |
137
click to vote
VLSID
2005
IEEE
16 years 6 months ago
2005
IEEE
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...
165
click to vote
EUROPKI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
162
click to vote
SIAMJO
2008
15 years 6 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
160
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
165
click to vote
EUROCRYPT
2006
Springer
15 years 9 months ago
2006
Springer
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...