A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511 | IEEE Journals & Magazine | IEEE Xplore

A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511


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 More

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)
Page(s): 367 - 378
Date of Publication: 31 January 1998

ISSN Information:


References

References is not available for this document.