Title :
A new algorithm for finding minimum-weight words in a linear code: application to McEliece´s cryptosystem and to BCH codes of length 511
Author :
Canteaut, Anne ; Chaband, F.
Author_Institution :
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fDate :
29 Jun-4 Jul 1997
Abstract :
An algorithm for finding minimum-weight words in large linear codes is developed. It is pointed out that the original McEliece (1978) cryptosystem is not secure. We also determine the minimum distance of some BCH codes of length 511
Keywords :
BCH codes; cryptography; decoding; iterative methods; linear codes; security of data; BCH codes; McEliece´s cryptosystem; code length; decoding; iterative algorithm; linear code; minimum distance; minimum-weight words; Artificial intelligence; Binary codes; Circuits; Cryptography; Iterative algorithms; Iterative decoding; Linear code; Random variables; Workstations;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613255
