154
Voted
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
120
Voted
COCO
2007
Springer
15 years 9 months ago
2007
Springer
170
Voted
PQCRYPTO
2010
15 years 9 months ago
2010
Abstract. In this paper a new structural attack on the McEliece/Niederreiter public key cryptosystem based on subcodes of generalized ReedSolomon codes proposed by Berger and Loidr...
115
Voted
COCO
2007
Springer
15 years 9 months ago
2007
Springer
130
Voted
PQCRYPTO
2010
15 years 9 months ago
2010
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...