scholarly journals A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Shangdi Chen ◽  
Chunli Yang
Keyword(s):  
Finite Fields ◽  
Symplectic Geometry ◽  
Authentication Codes ◽  
Sequential Model

Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message. In this paper, we construct multisender authentication codes with sequential model from symplectic geometry over finite fields, and the parameters and the maximum probabilities of deceptions are also calculated.

scholarly journals Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry

2011 ◽  
Vol 2011 ◽  
pp. 1-18
Author(s):  
You Gao ◽  
Huafeng Yu
Keyword(s):  
Probability Distribution ◽  
Finite Fields ◽  
Symplectic Geometry ◽  
Authentication Codes ◽  
Uniform Probability ◽  
Different Types ◽  
Uniform Probability Distribution ◽  
New Construction

A new construction of authentication codes with arbitration and multireceiver from singular symplectic geometry over finite fields is given. The parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of deception are also computed.

Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields

2013 ◽  
Vol 20 (04) ◽  
pp. 701-710 ◽  
Author(s):  
Shangdi Chen ◽  
Dawei Zhao
Keyword(s):  
Finite Fields ◽  
Symplectic Geometry ◽  
Key Distribution ◽  
Authentication Codes ◽  
Authentication Code ◽  
Message Transmission ◽  
Basic Model ◽  
Distribution Phase

As an extension of the basic model of MRA-codes, multi-receiver multi-fold authentication codes can use a single key distribution phase for multiple message transmission. A multi-receiver multi-fold authentication code is constructed from the singular symplectic geometry over finite fields in this paper. The parameters and probabilities of success in impersonation and substitution attacks by malicious groups of receivers of this code are computed.

Constructions of compressed sensing matrices based on the subspaces of symplectic space over finite fields

2015 ◽  
Vol 15 (02) ◽  
pp. 1650025 ◽  
Author(s):  
You Gao ◽  
Xiaojuan Zhang
Keyword(s):  
Compressed Sensing ◽  
Finite Fields ◽  
Symplectic Geometry ◽  
Symplectic Space ◽  
The Matrix ◽  
Compressed Sensing Matrices ◽  
Sensing Matrices

The paper provides two constructions of compressed sensing matrices using the subspaces of symplectic space and singular symplectic space over finite fields. Then we compare the matrices constructed in this paper with the matrix constructed by DeVore, and compare the two matrices based on symplectic geometry and singular symplectic geometry over finite fields.

scholarly journals A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Xiuli Wang
Keyword(s):  
Finite Fields ◽  
Authentication Codes ◽  
Authentication Code ◽  
Polynomials Over Finite Fields ◽  
New Construction

Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify the authenticity of the received message. In this paper, we construct one multisender authentication code from polynomials over finite fields. Some parameters and the probabilities of deceptions of this code are also computed.

Sign in / Sign up

Export Citation Format

Share Document