Sciweavers

28 search results - page 5 / 6
» Strengthening McEliece Cryptosystem
Sort
View
CRYPTO
2011
Springer
179views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
15 years 1 months ago
Information-Set Decoding for Linear Codes over Fq
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...
Christiane Peters
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
15 years 1 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut
IJACT
2008
158views more  IJACT 2008»
14 years 9 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
SP
2003
IEEE
15 years 2 months ago
Random Key Predistribution Schemes for Sensor Networks
Key establishment in sensor networks is a challenging problem because asymmetric key cryptosystems are unsuitable for use in resource constrained sensor nodes, and also because th...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song