A new version of McEliece PKC based on convolutional codes

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.

• Författare: Carl Löndahl; Thomas Johansson
• Avdelning/ar: Institutionen för elektro- och informationsteknik; ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2012
• Språk: Engelska
• Sidor: 461-470
• Publikation/Tidskrift/Serie: Lecture Notes in Computer Science
• Volym: 7618
• Länkar: http://dx.doi.org/10.1007/978-3-642-34129-8_45
• Dokumenttyp: Konferensbidrag
• Förlag: Springer
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: 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
• Forskningsgrupp: Informations- och kommunikationsteori
• ISBN/ISSN/Övrigt: ISSN: 1611-3349; ISSN: 0302-9743; ISBN: 978-3-642-34128-1; ISBN: 978-3-642-34129-8