Sciweavers

129 search results - page 7 / 26
» iacr 2011
Sort
View
IACR
2011
133views more  IACR 2011»
13 years 9 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti
IACR
2011
122views more  IACR 2011»
13 years 9 months ago
On Authenticated Encryption Using Stream Ciphers Supporting an Initialisation Vector
We describe a systematic framework for using a stream cipher supporting an initialisation vector (IV) to perform various tasks of authentication and authenticated encryption. These...
Palash Sarkar
IACR
2011
152views more  IACR 2011»
13 years 9 months ago
Rational distance-bounding protocols over noisy channels
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
Long H. Nguyen
IACR
2011
88views more  IACR 2011»
13 years 9 months ago
GCM, GHASH and Weak Keys
The Galois/Counter Mode (GCM) of operation has been standardized by NIST to provide single-pass authenticated encryption. The GHASH authentication component of GCM belongs to a cla...
Markku-Juhani O. Saarinen
IACR
2011
110views more  IACR 2011»
13 years 9 months ago
Decoding One Out of Many
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...
Nicolas Sendrier