60 search results - page 9 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
TIT
2002
13 years 7 months ago
2002
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
IACR
2011
12 years 7 months ago
2011
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
PQCRYPTO
2010
13 years 5 months ago
2010
The McEliece public-key cryptosystem is based on the fact that decoding unknown linear binary codes is an NP-complete problem. The interest on implementing post-quantum cryptograph...
INDOCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory pro...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...