Two Constructions of Multireceiver Authentication Codes from Symplectic Geometry over Finite Fields

Abstract

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 two multireceiver authentication codes from symplectic geometry over finite fields. The parameters and the probabilities of deceptions of the codes are also computed.