Du är här

An improvement to Stern's algorithm

Publiceringsår: 2011
Språk: Engelska
Dokumenttyp: Rapport

Sammanfattning

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.

Disputation

Nyckelord

  • Mathematics and Statistics
  • information set decoding
  • random codes
  • public-key cryptography
  • birthday technique
  • binary codes

Övriga

Unpublished
  • Crypto and Security

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

LERU logotype U21 logotype

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen