Skip to main content
Conference ProceedingsOPEN ACCESS

A new version of McEliece PKC based on convolutional codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7618 LNCS 461-470
DOI: 10.1007/978-3-642-34129-8_45
35Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Löndahl, C., & Johansson, T. (2012). A new version of McEliece PKC based on convolutional codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7618 LNCS, pp. 461–470). https://doi.org/10.1007/978-3-642-34129-8_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free