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.

A new version of McEliece PKC based on convolutional codes

På svenska

Author

Summary, in English

This paper presents new versions of the McEliece PKC that use time-varying convolutional codes. In opposite to the choice of Goppa codes, the proposed construction uses large parts of randomly generated parity-checks, presumably making structured attacks more difficult. The drawback is that we have a small but nonzero probability of not being successful in decoding, in which case we need to ask for a retransmission.

Publishing year

2012

Language

English

Pages

461-470

Publication/Series

Lecture Notes in Computer Science

Volume

7618

Document type

Conference paper

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Linear code
  • Block code
  • LDPC code
  • Parity check
  • Convolutional code

Conference name

International Conference on Information and Communications Security

Conference date

2012-10-29

Status

Published

Research group

  • Informations- och kommunikationsteori

ISBN/ISSN/Other

  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-642-34128-1
  • ISBN: 978-3-642-34129-8