Sciweavers

Share
3 search results - page 1 / 1
» codcry 2011
Sort
View
CODCRY
2011
Springer
247views Cryptology» more  CODCRY 2011»
7 years 8 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n βˆ’ p n(n βˆ’ 2t βˆ’ 2) err...
Daniel J. Bernstein
CODCRY
2011
Springer
264views Cryptology» more  CODCRY 2011»
7 years 8 months ago
Algorithms for the Shortest and Closest Lattice Vector Problems
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
7 years 8 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
books