Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

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.

Publiceringsår

2002

Språk

Engelska

Sidor

2669-2678

Publikation/Tidskrift/Serie

IEEE Transactions on Information Theory

Volym

48

Issue

10

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

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

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0018-9448