Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Communications Letters

Quantum Symmetric Cryptosystem Based on Algebraic Codes

Ali Amerimehr, Massoud Hadian Dehkordi

Published Jun 20, 2018• 5 citations
Publisher

Abstract

A quantum cryptosystem based on algebraic codes, which uses single photons as quantum message carriers, is given. The cryptosystem is equipped with authentication, data integrity, and non-repudiation. There is no need for a parallel classical channel since public conversation is omitted. Indeed by using a suitable algebraic error-correcting code, Alice and Bob do not need to share a string of common bases. Therefore, they already share only one secret key for encryption. The secret key can be reused many times also in a noisy environment. The encryption and the decryption are similar, so the cryptosystem can be thought symmetric. Analysis shows that the cryptosystem is secure, low cost, and more practical compared with the previous ones.

DOI
10.1109/lcomm.2018.2844245

Related papers

Quantum authentication scheme based on algebraic coding

Rex A. C. Medeiros, Francisco de Assis, Júior, Bernardo L. +1 more

This paper presents a simple, but efficient class of non-interactive protocols for quantum authentication of $m$-length clas sical messages. The message is encoded using a classical linear algebraic code $C[n,m,t]$. We assume that Alice and Bob share a classical secret key, $x_{AB}$, of $n$ bits. Alice creates $n$ qubits based on the code word and the key, that indicates the bases used to create each qubit. The quantum states are sent to Bob through a noiseless quantum channel. We calculate the failure probability of the protocol considering several types of attacks.

arXiv:quant-ph/0307095•Jul 14, 2003•4 citations

A quantum authenticated encryption scheme

Xin Lü, Zhi Ma, Dengguo Feng

Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme.

International Conference on Signal Processing•Jun 28, 2005•3 citations

Quantum McEliece public-key cryptosystem

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.

Quantum Information and Computation•Mar 1, 2012•17 citations

Quantum Public-Key Cryptosystem Using Non-orthogonal States

Xiaoyu Li, Lei Li

In this paper we provide a quantum public-key cryptosystem using non-orthogonal states. A user Alice uses a set of particles which are in non-orthogonal quantum states as the public key kept by a key management center (KMC) while the she keeps the states of the particles secret as the private key. By the help of KMC any other user can send encrypted message to Alice. Any one including KMC except Alice can’t get the message. On the other hand digital signature can also be achieved by this public-key cryptosystem. There are no entangled states and complex operations needed in our cryptosystem. So it’s easier to carry out in practice and more robust against possible attacks.

Journal of Software•Jul 27, 2013•2 citations

Quantum message authentication based on algebraic coding theory

Li Yang, Lei Hu, Dengguo Feng

We present a new type of authentication scheme for quantum message based on algebraic coding theory and quantum computation operations between different quantum registers. The results are that if the pre-coding generator matrix in SN-S code is public, the quantum scheme is a public-key data integrity scheme; if it is secret, the quantum scheme is a hybrid data origin authentication scheme. The advantage of this scheme is that the public and secret keys are merely some classical data.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jan 11, 2005•1 citation

Quantum Public-key Cryptosystem without Quantum Channels between Any Two Users using Non-orthogonal States

Xiaoyu Li, Yuwen Chen

A quantum public-key cryptosystem without quantum channels between any two users using non-orthogonal states is provided in this paper. Every user keeps a set of quantum particles in non-orthogonal states in a key management center (KMC) as the public key while he or she keeps the states of them as the private key. By the help of KMC users can accomplish secret communication and message authentication. The laws of quantum physics guarantee the unconditional security of this cryptosystem. No entangled states or complex quantum operations are needed. On the other hand there are no quantum channels needed to connecting any two users. So the public-key cryptosystem is easier to carry out and more robust in practice.

International Journal of Security and Its Applications•Sep 30, 2015•1 citation
A quantum cryptosystem based on algebraic codes, which uses single photons as quantum message carriers, is given. The cryptosystem is equipped with authentication, data integrity, and non-repudiation. There is no need for a parallel classical channel since public conversation is omitted. Indeed by using a suitable algebraic error-correcting code, Alice and Bob do not need to share a string of common bases. Therefore, they already share only one secret key for encryption. The secret key can be reused many times also in a noisy environment. The encryption and the decryption are similar, so the cryptosystem can be thought symmetric. Analysis shows that the cryptosystem is secure, low cost, and more practical compared with the previous ones.
This paper presents a simple, but efficient class of non-interactive protocols for quantum authentication of mmm-length clas sical messages. The message is encoded using a classical linear algebraic code C[n,m,t]C[n,m,t]C[n,m,t]. We assume that Alice and Bob share a classical secret key, xABx_{AB}xAB​, of nnn bits. Alice creates nnn qubits based on the code word and the key, that indicates the bases used to create each qubit. The quantum states are sent to Bob through a noiseless quantum channel. We calculate the failure probability of the protocol considering several types of attacks.
Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme.
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.
In this paper we provide a quantum public-key cryptosystem using non-orthogonal states. A user Alice uses a set of particles which are in non-orthogonal quantum states as the public key kept by a key management center (KMC) while the she keeps the states of the particles secret as the private key. By the help of KMC any other user can send encrypted message to Alice. Any one including KMC except Alice can’t get the message. On the other hand digital signature can also be achieved by this public-key cryptosystem. There are no entangled states and complex operations needed in our cryptosystem. So it’s easier to carry out in practice and more robust against possible attacks.
A quantum public-key cryptosystem without quantum channels between any two users using non-orthogonal states is provided in this paper. Every user keeps a set of quantum particles in non-orthogonal states in a key management center (KMC) as the public key while he or she keeps the states of them as the private key. By the help of KMC users can accomplish secret communication and message authentication. The laws of quantum physics guarantee the unconditional security of this cryptosystem. No entangled states or complex quantum operations are needed. On the other hand there are no quantum channels needed to connecting any two users. So the public-key cryptosystem is easier to carry out and more robust in practice.