Journal of Applied Mathematics
Volume 2013 (2013), Article ID 320392, 7 pages
http://dx.doi.org/10.1155/2013/320392
Research Article

A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields

College of Science, Civil Aviation University of China, Tianjin 300300, China

Received 3 February 2013; Accepted 7 April 2013

Academic Editor: Yang Zhang

Copyright © 2013 Xiuli Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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.