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

Ha'erbin gongye daxue xuebao

Construction of Cartesian authentication code from symplectic geometry

Wang Chun-sen

Published Jan 1, 2001• 0 citations
OpenAlex

Abstract

Letv1,v2be a 2-dimensional totally isotropic subspace, P0 be a fixed subspace of type(m0,s0) with v1 , v2 C P0 c v1 , v2 in 2 v -dimensional symplectic space. The set of source states S is the set of subspaces of type (2s + 1 , s -1) containing v1 ,v2 and contained in P0. The set of encoding rules E is the set of the subspaces of type(3 ,l) which contain v1 ,v2 and are not orthogonal toy2. The set of massages X is the set of the subspaces of type (2s +2,s) which contain v1 ,v2 intersect P0 at a subspace of type (2s + 1 ,s -1) and are not orthogonal to v2. We construct a class of Cartesian authentication code by defining s + e as the message for any s S and e E. Its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probability of a successful impersonation attack PI and that of a successful substitution attack Ps are computed.

Related papers

Construction of Authentication Codes with Arbitration from Pseudo-symplectic Geometry

Xinmei Wang

A construction of authentication codes with arbitration form pseudo-symplectic geometry is given, the parameters are computed. Assuming that the probability distribution of source state and encoding rules are uniform, the probabilities of successful attacks are also computed.

•Jan 1, 2000•0 citations

New construction of authentication codes with arbitration form based on pseudo-symplectic geometry

Gengsheng Zhang

Unconditionally secure authentication codes with arbitration protect against deception from the transmitter or the receiver as well as against fraud from the opponents.A new construction of authentication codes with arbitration form based on pseudo-symplectic geometry is given,and their parameters are computed.Assuming that the probability distributions of source state and encoding rules are uniform,the probabilities of all successful attacks are also computed.

Journal of the University of Shanghai for Science and Technology•Jan 1, 2008•0 citations

New construction of authentication codes with arbitration from symplectic geometry

LI Zhi-mei

The authentication codes with arbitration protect against deceptions from the transmitters and receivers as well as those from the opponents.It can solve the problem that transmitters and receivers dispute in communication.A new construction of authentication codes with arbitration from symplectic geometry is given by new method in this paper.The parameters of the codes are computed.Assuming that the probability distribution of source state and encoding rules are uniform,the probabilities of successful attacks are also computed.

Hebei ke-ji daxue xuebao•Jan 1, 2010•2 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 authentication with unitary coding sets

Esther Pérez, Marcos Curty, David J. Santos +1 more

A general class of authentication schemes for arbitrary quantum messages is proposed. The class is based on the use of sets of unitary quantum operations in both transmission and reception, and on appending a quantum tag to the quantum message used in transmission. The previous secret between partners required for any authentication is a classical key. We obtain the minimal requirements on the unitary operations that lead to a probability of failure of the scheme less than one. This failure may be caused by someone performing a unitary operation on the message in the channel between the communicating partners, or by a potential forger impersonating the transmitter.

arXiv:quant-ph/0209061•Journal of Modern Optics•Jan 1, 2003•5 citations

A Simple Method for Obtaining Expansions of Symplectic Codes Over an Extension Field for Quantum Error Correction

Mitsuru Hamada

•Jan 1, 2012•0 citations
Letv1,v2be a 2-dimensional totally isotropic subspace, P0 be a fixed subspace of type(m0,s0) with v1 , v2 C P0 c v1 , v2 in 2 v -dimensional symplectic space. The set of source states S is the set of subspaces of type (2s + 1 , s -1) containing v1 ,v2 and contained in P0. The set of encoding rules E is the set of the subspaces of type(3 ,l) which contain v1 ,v2 and are not orthogonal toy2. The set of massages X is the set of the subspaces of type (2s +2,s) which contain v1 ,v2 intersect P0 at a subspace of type (2s + 1 ,s -1) and are not orthogonal to v2. We construct a class of Cartesian authentication code by defining s + e as the message for any s S and e E. Its size parameters are computed. Moreover, assume that the encoding rules are chosen according to a uniform probability distribution, the probability of a successful impersonation attack PI and that of a successful substitution attack Ps are computed.
The authentication codes with arbitration protect against deceptions from the transmitters and receivers as well as those from the opponents.It can solve the problem that transmitters and receivers dispute in communication.A new construction of authentication codes with arbitration from symplectic geometry is given by new method in this paper.The parameters of the codes are computed.Assuming that the probability distribution of source state and encoding rules are uniform,the probabilities of successful attacks are also computed.
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 general class of authentication schemes for arbitrary quantum messages is proposed. The class is based on the use of sets of unitary quantum operations in both transmission and reception, and on appending a quantum tag to the quantum message used in transmission. The previous secret between partners required for any authentication is a classical key. We obtain the minimal requirements on the unitary operations that lead to a probability of failure of the scheme less than one. This failure may be caused by someone performing a unitary operation on the message in the channel between the communicating partners, or by a potential forger impersonating the transmitter.