Abstract:
An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it n...Show MoreMetadata
Abstract:
An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it notably points out some weaknesses in McEliece's (1978) cipher. We also determine with it the minimum distance of some BCH codes of length 511.
Published in: IEEE Transactions on Information Theory ( Volume: 44, Issue: 1, January 1998)
DOI: 10.1109/18.651067