A new construction of multisender authentication codes from polynomials over finite fields

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. © 2013 xiuli wang.