A new construction of multisender authentication codes from polynomials over finite fields
From MaRDI portal
Summary: 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.
Recommendations
- A new construction of multi-sender authentication codes from polynomials over finite fields.
- A new construction of multisender authentication codes from symplectic geometry over finite fields.
- A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields
- A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
- A construction of multi-sender authentication codes from pseudo-symplectic geometry over finite fields
Cites work
- Codes Which Detect Deception
- scientific article; zbMATH DE number 1302798 (Why is no real title available?)
- scientific article; zbMATH DE number 1303147 (Why is no real title available?)
- scientific article; zbMATH DE number 1772585 (Why is no real title available?)
- Multisender authentication systems with unconditional security
Cited in
(3)
This page was built for publication: A new construction of multisender authentication codes from polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375496)
