A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to BCH codes of length 511
A. Canteaut, F. Chaband · 2002
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.