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....
Saved in:
Main Author: | Xiuli Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/602539 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields
by: Shangdi Chen, et al.
Published: (2014-01-01) -
Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry
by: You Gao, et al.
Published: (2011-01-01) -
Constructing irreducible polynomials with prescribed level curves over finite fields
by: Mihai Caragiu
Published: (2001-01-01) -
More on Codes Over Finite Quotients of Polynomial Rings
by: Emad Kadhim Al-Lami, et al.
Published: (2025-01-01) -
MDS and MHDR Cyclic Codes over Finite Chain Rings
by: Monika Dalal, et al.
Published: (2024-01-01)