Welcome to the InfoSci Platform
Reference Hub1
Cryptography Based on Error Correcting Codes: A Survey

Cryptography Based on Error Correcting Codes: A Survey

Marek Repka, Pierre-Louis Cayrel
Copyright: © 2014 |Pages: 24
ISBN13: 9781466658080|ISBN10: 1466658088|EISBN13: 9781466658097
DOI: 10.4018/978-1-4666-5808-0.ch005
Cite Chapter Cite Chapter

MLA

Repka, Marek, and Pierre-Louis Cayrel. "Cryptography Based on Error Correcting Codes: A Survey." Multidisciplinary Perspectives in Cryptology and Information Security, edited by Sattar B. Sadkhan Al Maliky and Nidaa A. Abbas, IGI Global, 2014, pp. 133-156. https://doi.org/10.4018/978-1-4666-5808-0.ch005

APA

Repka, M. & Cayrel, P. (2014). Cryptography Based on Error Correcting Codes: A Survey. In S. Sadkhan Al Maliky & N. Abbas (Eds.), Multidisciplinary Perspectives in Cryptology and Information Security (pp. 133-156). IGI Global. https://doi.org/10.4018/978-1-4666-5808-0.ch005

Chicago

Repka, Marek, and Pierre-Louis Cayrel. "Cryptography Based on Error Correcting Codes: A Survey." In Multidisciplinary Perspectives in Cryptology and Information Security, edited by Sattar B. Sadkhan Al Maliky and Nidaa A. Abbas, 133-156. Hershey, PA: IGI Global, 2014. https://doi.org/10.4018/978-1-4666-5808-0.ch005

Export Reference

Mendeley
Favorite

Abstract

Breaking contemporary cryptographic algorithms using any binary computer has at least sub-exponential complexity. However, if a quantum computer was used effectively, then our asymmetric cryptography would not be secure anymore. Since the code-based cryptography (cryptography based on error-correcting codes) relies on different problems, it is not as threatened as, for example, RSA or ECC. Recent years have been crucial in the progress of cryptography based on error-correcting codes. In contrast to the number-theoretic problems typically used in cryptography nowadays, certain instances of the underlying problems of code-based cryptography remain unbroken even employing quantum cryptanalysis. Thus, some code-based cryptography constructions belong to the post-quantum cryptography, especially cryptosystems based on binary irreducible Goppa codes. Many attempts to replace this underlying code in order to reduce the key size already have been proposed. Unfortunately, almost all of them have been broken. For instance, just a while ago, Reed Muller, Generalized Reed-Solomon Codes, and Convolutional codes were broken. Against some rank metric codes, a new attack was introduced. On the other hand, two prospective countermeasures in order to hide the exploitable code structure of the broken codes were fashioned. However, only the choice of binary irreducible Goppa codes remains secure in the post-quantum sense. This chapter surveys the more recent developments in code-based cryptography as well as implementations and side channel attacks. This work also recalls briefly the basic ideas, and provides a roadmap to readers.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.