An improvement to Stern's algorithm
Author
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.
Department/s
Publishing year
2011
Language
English
Full text
- Available as PDF - 184 kB
- Download statistics
Document type
Report
Publisher
[Publisher information missing]
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Keywords
- information set decoding
- random codes
- public-key cryptography
- birthday technique
- binary codes
Status
Unpublished
Research group
- Crypto and Security