Anpassa utseende English Lunds universitet
Institutionen för EIT
toppbild
Utbildning Forskning Kontakt

Referens:
Title:
An improvement to Stern's algorithm
Type:
report
Keywords:
information set decoding, random codes, public-key cryptography, birthday technique, binary codes
Abstract:
The decoding problem is a fundamental problem in computational complexity theory. In particular, the efficiency of which the problem can be decided has implications on the security of cryptosystems based on hard problems in coding theory. Stern's algorithm has long been the best algorithm available, with slight modifications over the years yielding only small speed-ups. This paper describes an improved method of finding low weight codewords in a random code, leading to an improved decoding algorithm.
Year:
2011
MODS XML

Tillbaka

Senast uppdaterad:
Webbansvarig: Henrik Sjöland
Ansvarig utgivare: Prefekt
Institutionen för Elektro- och informationsteknik, LTH, Box 118, 221 00 Lund. Telefon: 046-222 00 00