290 search results - page 24 / 58 » Pseudorandom Bits for Polynomials |
DSN
2006
IEEE
14 years 5 days ago
2006
IEEE
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...
CRYPTO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
WINE
2010
Springer
13 years 6 months ago
2010
Springer
We study the information content of equilibrium prices using the market communication model of Deng, Papadimitriou, and Safra [4]. We show that, in the worst case, communicating an...
ARITH
2003
IEEE
14 years 1 months ago
2003
IEEE
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
FOCS
1992
IEEE
14 years 18 days ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...