A new version of mceliece PKC based on convolutional codes

Authors:
Carl Löndahl;Thomas Johansson
Affiliations:
Dept. of Electrical and Information Technology, Lund University, Lund, Sweden;Dept. of Electrical and Information Technology, Lund University, Lund, Sweden
Venue:
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Year:
2012

Citing 10
Cited 1

Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
A method for finding codewords of small weight

Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Improving the Security of the McEliece Public-Key Cryptosystem

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
How to Achieve a McEliece-Based Digital Signature Scheme

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Error Control Coding, Second Edition

Error Control Coding, Second Edition
Attacking and Defending the McEliece Cryptosystem

PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
A family of fast syndrome based cryptographic hash functions

Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Algebraic cryptanalysis of mceliece variants with compact keys

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Decoding random linear codes in Õ(20.054n)

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques

Computational aspects of retrieving a representation of an algebraic geometry code

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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.