A New Construction of Multisender Authentication Codes from Pseudosymplectic Geometry over Finite Fields
Multisender authentication codes allow a group of senders to construct an authenticated message for one receiver such that the receiver can verify authenticity of the received message. In this paper, we construct one multisender authentication code from pseudosymplectic geometry over finite fields....
Main Author: | Xiuli Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/602539 |
Similar Items
-
A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
by: Xiuli Wang
Published: (2013-01-01) -
A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields
by: Shangdi Chen, et al.
Published: (2014-01-01) -
New methods of construction of cartesian authentication codes from geometries over finite commutative rings
by: Jirakitpuwapat Wachirapong, et al.
Published: (2018-09-01) -
Constructions of Polynomial Codes Based on Circular Permutation Over Finite Fields
by: Xiuli Wang, et al.
Published: (2020-01-01) -
Construction of Cyclically Permutable Codes from Finite Geometry
by: Jun-Rui Chen, et al.
Published: (2018)