A new version of McEliece PKC based on convolutional codes
(2012) International Conference on Information and Communications Security In Lecture Notes in Computer Science 7618. p.461-470- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/2971902
- author
- Löndahl, Carl LU and Johansson, Thomas LU
- organization
- publishing date
- 2012
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Linear code, Block code, LDPC code, Parity check, Convolutional code
- host publication
- Information and Communications Security : 14th International Conference, ICICS 2012, Hong Kong, China, October 29-31, 2012. Proceedings - 14th International Conference, ICICS 2012, Hong Kong, China, October 29-31, 2012. Proceedings
- series title
- Lecture Notes in Computer Science
- volume
- 7618
- pages
- 10 pages
- publisher
- Springer
- conference name
- International Conference on Information and Communications Security
- conference dates
- 2012-10-29
- external identifiers
-
- scopus:84868307945
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 978-3-642-34129-8
- 978-3-642-34128-1
- DOI
- 10.1007/978-3-642-34129-8_45
- language
- English
- LU publication?
- yes
- id
- 7eac14b0-a140-4385-ab05-68b173e4697f (old id 2971902)
- date added to LUP
- 2016-04-04 11:37:00
- date last changed
- 2024-10-13 13:07:43
@inproceedings{7eac14b0-a140-4385-ab05-68b173e4697f, 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.}}, author = {{Löndahl, Carl and Johansson, Thomas}}, booktitle = {{Information and Communications Security : 14th International Conference, ICICS 2012, Hong Kong, China, October 29-31, 2012. Proceedings}}, isbn = {{978-3-642-34129-8}}, issn = {{1611-3349}}, keywords = {{Linear code; Block code; LDPC code; Parity check; Convolutional code}}, language = {{eng}}, pages = {{461--470}}, publisher = {{Springer}}, series = {{Lecture Notes in Computer Science}}, title = {{A new version of McEliece PKC based on convolutional codes}}, url = {{http://dx.doi.org/10.1007/978-3-642-34129-8_45}}, doi = {{10.1007/978-3-642-34129-8_45}}, volume = {{7618}}, year = {{2012}}, }