Preprint Review Version 1 Preserved in Portico This version is not peer-reviewed

Code-based Post-Quantum Cryptography

Version 1 : Received: 26 April 2021 / Approved: 28 April 2021 / Online: 28 April 2021 (08:51:11 CEST)

How to cite: Balamurugan, C.; Singh, K.; Ganesan, G.; Rajarajan, M. Code-based Post-Quantum Cryptography. Preprints 2021, 2021040734 (doi: 10.20944/preprints202104.0734.v1). Balamurugan, C.; Singh, K.; Ganesan, G.; Rajarajan, M. Code-based Post-Quantum Cryptography. Preprints 2021, 2021040734 (doi: 10.20944/preprints202104.0734.v1).

Abstract

Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or in transit. Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems based on modular arithmetic to the contemporary cryptosystems based on quantum computing. The emergence of quantum computing imposes a major threat on the modern cryptosystems based on modular arithmetic whereby, even the computationally hard problems which constitute for the strength of the modular arithmetic ciphers could be solved in deterministic time. This threat triggered post-quantum cryptography research in order to design and develop post-quantum algorithms that can withstand quantum computing attacks. This paper provides a review of the various post-quantum cryptography and, in specific, code-based cryptography research dimensions. The research directions that are yet to be explored in code-based cryptography research is another key contribution of this paper.

Subject Areas

Quantum computing; Post-quantum cryptography; Code-based cryptography; cryptosystem; cryptography; Privacy

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.