A New Version of McEliece PKC Based on Convolutional Codes

摘要

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.