The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On the complexity of some cryptographic problems based on the general decoding problem

På svenska

Author

Summary, in English

A new probabilistic algorithm for decoding one received word from a set of many given received words, into a codeword such that the Hamming distance between the received word and the codeword is at most t, is proposed. The new algorithm is applicable to several cryptographic problems, such as the Stern identification scheme, the McEliece public-key cryptosystem, and in correlation attacks on stream ciphers. When applicable, it runs significantly faster than previous algorithms used for attacks on these cryptosystems.

Publishing year

2002

Language

English

Pages

2669-2678

Publication/Series

IEEE Transactions on Information Theory

Volume

48

Issue

10

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Stern identification system
  • cryptosystem
  • McEliece
  • decoding algorithms
  • complexity
  • correlation attack

Status

Published

ISBN/ISSN/Other

  • ISSN: 0018-9448