Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify the authenticity of the received message. In this paper, we construct multireceiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of the two codes are also computed.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.