60 search results - page 4 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
−A class of combinatorial structures, called absorbing sets, strongly influences the performance of low-density paritycheck (LDPC) decoders at low error rates. Past experiments h...
AICT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we describe the design of a highlyavailable Grid data storage system. Increased availability is ensured by data redundancy and file striping. Redundant data is com...
ACNS
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we combine the error correction and encryption functionality into one block cipher, which we call High Diffusion (HD) cipher. The error correcting property of this ci...
DICTA
2007
13 years 9 months ago
2007
Existing asymmetric encryption algorithms require the storage of the secret private key. Stored keys are often protected by poorly selected user passwords that can either be guess...