We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a
private key from a given public key. Its running time is subexponential and is effective if the …

Consider the following problem: Given k=2 q random lists of n-bit vectors, L 1 ,…,L k , each
of length m, find x 1 ∈L 1 ,…,x k ∈L k such that x 1 +⋅⋅⋅+x k =0, where + is the XOR …

In the standard consensus problem there are n processes with possibly different input values
and the goal is to eventually reach a point at which all processes commit to exactly one of …

We present a practical expected usually quartic time algorithm to recover the structure of an
algebraic geometry code defined over a hyperelliptic code of genus g≤ 2. Its main …

The idea to use error-correcting codes in order to construct public key cryptosystems was
published in 1978 by McEliece [ME1978]. In his original construction, McEliece used Goppa …

Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channel | IEEE
Conference Publication | IEEE Xplore Probabilistic decoding of interleaved RS-codes on the q-ary …

Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate
Nash equilibrium can be found in polynomial time in two-player games, then it is also …

A liquid system provides durable object storage based on spreading redundantly generated
data across a network of hundreds to thousands of potentially unreliable storage nodes. A …

We analyze a generalization of a recent algorithm of Bleichenbacher et al. for decoding
interleaved codes on the Q-ary symmetric channel for large Q. We will show that for any m and …

It is well-known that a class of “almost integers” can be found using the theory of modular
functions, and a few spectacular examples are given by Ramanujan [5]. They can be generated …