Abstract
Polar codes discovered by Arikan form a very powerful family of codes attaining many information theoretic limits in the fields of error correction and source coding. They have in particular much better decoding capabilities than Goppa codes which places them as a serious alternative in the design of both a public-key encryption scheme à la McEliece and a very efficient signature scheme. Shrestha and Kim pro-posed in 2014 to use them in order to come up with a new code-based public key cryptosystem. We present a key-recovery attack that makes it possible to recover a description of the permuted polar code providing all the information required for decrypting any message.
Cite
CITATION STYLE
Bardet, M., Chaulet, J., Dragoi, V., Otmani, A., & Tillich, J. P. (2016). Cryptanalysis of the McEliece public key cryptosystem based on polar codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9606, pp. 118–143). Springer Verlag. https://doi.org/10.1007/978-3-319-29360-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
