290 search results - page 46 / 58 » Pseudorandom Bits for Polynomials |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
INDOCRYPT
2007
Springer
14 years 2 months ago
2007
Springer
Saarinen recently proposed a chosen IV statistical attack, called the d-monomial test, and used it to find weaknesses in several proposed stream ciphers. In this paper we generali...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
INDOCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we propose a new variant of the NTRU public key cryptosystem − the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosy...
TCC
2005
Springer
14 years 1 months ago
2005
Springer
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...