Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

An improvement to Stern's algorithm

In English

Författare

Summary, in English

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.

Publiceringsår

2011

Språk

Engelska

Dokumenttyp

Rapport

Förlag

[Publisher information missing]

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

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

Status

Unpublished

Forskningsgrupp

  • Crypto and Security