Quantum Cryptosystem

Song Yuan Yan

Hachiro Fujita

The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantum McEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the classical McEliece cryptosystem. We present an explicit construction of the quantum McEliece public-key cryptosystem using Calderbank-Shor-Steane codes based on generalized Reed-Solomon codes. We examine the security of our quantum McEliece cryptosystem and compare it with alternative systems.

Ming-Xing Luo, Xiu‐Bo Chen, Deng Yun +1 more

Zachary Welch

In the near future, general quantum computers could become a reality.Because of this we have a need for updating our public key infrastructure to resist quantum attacks.Among the many proposed cryptosystems that we could use to replace our modern cryptosystems are the four cryptosystems we will be analysing: McEliece, Classic McEliece, McNie, and NTRUEncrypt.We will cover the cryptosystems in full detail before analysing how secure and how efficient the cryptosystems are.

Henry C. Ukwuoma, Arome Junior Gabriel, Aderonke Favour-Bethy Thompson +1 more

The safety and security of various cryptosystems are related to the hardness of the integer factorization problem and discrete logarithm problem, most cryptosystems will be rendered vulnerable to attack and outdated as quantum computers become more advanced.This study examines lattice-based cryptography (the NTRU cryptosystem), compares the suggested variation to other cryptosystems by simulation and presents the execution time for key generation, encryption, and decryption procedures, as well as to highlight the benefits and drawbacks of the proposed cryptosystem.A variant of the NTRU cryptosystem is developed with the purpose of improving the cryptosystem's security by allowing it to withstand attacks in both classical and quantum computing.The simulation revealed that the existing NTRU cryptosystem has a better time complexity compared to the proposed NTRU cryptosystem.The existing NTRU cryptosystem has a time complexity of O(n 2 ) while the proposed variant has O(n 3 ).Though had a better capacity of handling large data because of the introduction of lattice multiplication.