Toward quantum computer resistant cryptographic schemes

Currently, we rely on cryptographic algorithms such as elliptic curve cryptosystems (ECCs) as basic building blocks to secure the communication in the IoT. However, public key schemes like ECC can easily be broken by the upcoming quantum computers. Due to recent advances in quantum computing, we should act now to prepare the IoT for the quantum world. In this article, we focus on the current state of the art and recent developments in the area of quantum-resistant cryptosystems for securing the IoT. We first demonstrate the impacts of quantum computers on the security of the cryptographic schemes used today, and then give an overview of the recommendations for cryptographic schemes that can be secure under the attacks of both classical and quantum computers. After that, we present the existing implementations of quantum-resistant cryptographic schemes on constrained devices suitable for the IoT. Finally, we give an introduction to ongoing projects for quantum-resistant schemes that will help develop future security solutions for the IoT.Currently, we rely on cryptographic algorithms such as elliptic curve cryptosystems (ECCs) as basic building blocks to secure the communication in the IoT. However, public key schemes like ECC can easily be broken by the upcoming quantum computers. Due to recent advances in quantum computing, we should act now to prepare the IoT for the quantum world. In this article, we focus on the current state of the art and recent developments in the area of quantum-resistant cryptosystems for securing the IoT. We first demonstrate the impacts of quantum computers on the security of the cryptographic schemes used today, and then give an overview of the recommendations for cryptographic schemes that can be secure under the attacks of both classical and quantum computers. After that, we present the existing implementations of quantum-resistant cryptographic schemes on constrained devices suitable for the IoT. Finally, we give an introduction to ongoing projects for quantum-resistant schemes that will help develop future security solutions for the IoT.

IEEE Communications MagazineFeb 1, 2017231 citations

Quantum Cryptography at the Computational Frontier

Romain Alléaume

Jun 1, 20180 citations

A Quantum-Resistant Advanced Metering Infrastructure

Vinícius Lagrota, Mateus de L. Filomeno, Leonardo de M. B. A. Dib +2 more

This paper focuses on quantum-resistant cryptographic schemes to enhance the security of smart metering against threats from both quantum and classical computers. In this sense, we consider FrodoKEM and CRYSTALS-Kyber quantum-resistant as asymmetric cryptographic schemes and AES-GCM as a symmetric one. Moreover, we detail the design and implementation of a dedicated cryptographic module customized to ensure quantum-resistant advanced metering infrastructure (QR-AMI). Analysis based on experimental implementation shows the viability of a QR-AMI anchored on dedicated cryptographic modules implemented on a microcontroller (low-power processor) or a system-on-a-chip device.This paper focuses on quantum-resistant cryptographic schemes to enhance the security of smart metering against threats from both quantum and classical computers. In this sense, we consider FrodoKEM and CRYSTALS-Kyber quantum-resistant as asymmetric cryptographic schemes and AES-GCM as a symmetric one. Moreover, we detail the design and implementation of a dedicated cryptographic module customized to ensure quantum-resistant advanced metering infrastructure (QR-AMI). Analysis based on experimental implementation shows the viability of a QR-AMI anchored on dedicated cryptographic modules implemented on a microcontroller (low-power processor) or a system-on-a-chip device.

Simpósio Brasileiro de Cibersegurança (SBSeg)Sep 1, 20251 citation

Cryptographic Properties of the Quantum Hashing Based on Expander Graphs

I. Zinnatullin

Quantum hashing is a useful technique in different computational and cryptographic scenarios in the quantum world. A set of random parameters is required to construct a quantum hashing scheme. For instance, random walks on expander graphs (expanders) are known to be efficient randomness generators in many areas of computer science. We analyze a scheme based on expanders. Collision resistance and preimage resistance of this scheme are considered. We show that quantum hashing based on expanders is collision-resistant (in quantum sense), and the considered scheme’s accessible information is $O(1)$ .Quantum hashing is a useful technique in different computational and cryptographic scenarios in the quantum world. A set of random parameters is required to construct a quantum hashing scheme. For instance, random walks on expander graphs (expanders) are known to be efficient randomness generators in many areas of computer science. We analyze a scheme based on expanders. Collision resistance and preimage resistance of this scheme are considered. We show that quantum hashing based on expanders is collision-resistant (in quantum sense), and the considered scheme’s accessible information is $$O(1)$$ .

Lobachevskii Journal of MathematicsFeb 1, 20234 citations

Quantum Computational Cryptography

Akinori Kawachi, Takeshi Koshiba

Springer eBooksJun 15, 20060 citations

O(1)