A new algorithm for finding minimum-weight in large linear codes

被引：0
|
作者：
Canteaut, A
机构：
来源：
CRYPTOGRAPHY AND CODING: 5TH IMA CONFERENCE | 1995年 / 1025卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256,57]-linear binary codes in 9 hours on a DEC alpha computer. We improve with it the previously best known attacks on some public-key cryptosystems and identification schemes based on error-correcting codes: for example we reduce the work factor involved in breaking McELiece's cryptosystem, since our algorithm requires 2(64) elementary operations that is 128 times less than Lee-Brickell's attack.
引用
收藏
页码：205 / 212
页数：8
相关论文
共 50 条
12345