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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Quantum message authentication based on algebraic coding theory

Li Yang, Lei Hu, Dengguo Feng

Published Jan 11, 2005• 1 citation
Publisher

Abstract

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.

DOI
10.1117/12.576777

Related papers

Quantum message authentication based on classical NP-complete problem

Li Yang, Lei Hu, Dengguo Feng

This note presents a method to authenticate a quantum message based on classical SN-S authentication code and the computations between different quantum registers. 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.

arXiv:quant-ph/0310078•Oct 12, 2003•3 citations

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•5 citations

Quantum Symmetric Cryptosystem Based on Algebraic Codes

Ali Amerimehr, Massoud Hadian Dehkordi

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.

IEEE Communications Letters•Jun 20, 2018•5 citations

A public-key cryptosystem for quantum message transmission

Li Yang

We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jan 11, 2005•10 citations

Information-Theoretically Secure Data Origin Authentication with Quantum and Classical Resources

Georgios M. Nikolopoulos, Marc Fischlin

In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that a broad class of symmetric prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts.

arXiv:2011.06849•Cryptography•Nov 13, 2020•10 citations

Quantum message authentication scheme based on remote state preparation

Min-Sung Kang, Yeon-Ho Choi, Yong‐Su Kim +4 more

Abstract We propose a quantum message authentication scheme that provides integrity and origin authentication using a remote state preparation. Authentication is one of the security services that must be provided in secure communication. Quantum message authentication is the base scheme for realizing quantum authentication that is known to be a secure technique even in a forthcoming quantum computer environment. The proposed scheme creates a quantum message authentication code (QMAC) with only a single qubit measurement. It is therefore easy to implement and operate compared to existing technology that normally generates a QMAC with a Bell measurement or controlled unitary operation. For security analysis, we design a quantum random oracle model based on the random oracle model and demonstrate the quantum collision resistance with it. From the analysis, the probability of the quantum collision is 0.69 N per qubit, where N is the size of the message sequence. Since the probability of quantum collision in the case of N ≥ 13 becomes extremely low of under 0.8%, we confirm that the proposed scheme guarantees the integrity and origin authentication of the message.

Physica Scripta•Sep 14, 2018•12 citations
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.
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.
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.
We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.
In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that a broad class of symmetric prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts.
Abstract We propose a quantum message authentication scheme that provides integrity and origin authentication using a remote state preparation. Authentication is one of the security services that must be provided in secure communication. Quantum message authentication is the base scheme for realizing quantum authentication that is known to be a secure technique even in a forthcoming quantum computer environment. The proposed scheme creates a quantum message authentication code (QMAC) with only a single qubit measurement. It is therefore easy to implement and operate compared to existing technology that normally generates a QMAC with a Bell measurement or controlled unitary operation. For security analysis, we design a quantum random oracle model based on the random oracle model and demonstrate the quantum collision resistance with it. From the analysis, the probability of the quantum collision is 0.69 N per qubit, where N is the size of the message sequence. Since the probability of quantum collision in the case of N ≥ 13 becomes extremely low of under 0.8%, we confirm that the proposed scheme guarantees the integrity and origin authentication of the message.