60 search results - page 5 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
80
Voted
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract−Several high performance LDPC codes have paritycheck matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any str...
106
click to vote
ACNS
2006
Springer
15 years 1 months ago
2006
Springer
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
133
click to vote
IACR
2011
13 years 9 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
101
click to vote
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...