290 search results - page 19 / 58 » Pseudorandom Bits for Polynomials |
TIT
2008
13 years 9 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
ASIACRYPT
2008
Springer
13 years 11 months ago
2008
Springer
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
DCC
2004
IEEE
14 years 9 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
ECCC
1998
13 years 9 months ago
1998
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
ECCC
2000
13 years 9 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...