Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

Publiceringsår: 2002
Språk: Engelska
Sidor: 2669-2678
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 48
Nummer: 10
Dokumenttyp: Artikel i tidskrift
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Stern identification system
  • cryptosystem
  • McEliece
  • decoding algorithms
  • complexity
  • correlation attack


  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen