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 paramet...

Full description

Bibliographic Details
Main Author:	Xiuli Wang
Format:	Article
Language:	English
Published:	Hindawi Limited 2013-01-01
Series:	Journal of Applied Mathematics
Online Access:	http://dx.doi.org/10.1155/2013/320392

id	doaj-ed910eb4a33e4224a26163b436e929a6
record_format	Article
spelling	doaj-ed910eb4a33e4224a26163b436e929a62020-11-25T00:45:20ZengHindawi LimitedJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/320392320392A New Construction of Multisender Authentication Codes from Polynomials over Finite FieldsXiuli Wang0College of Science, Civil Aviation University of China, Tianjin 300300, ChinaMultisender 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.http://dx.doi.org/10.1155/2013/320392
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Xiuli Wang
spellingShingle	Xiuli Wang A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields Journal of Applied Mathematics
author_facet	Xiuli Wang
author_sort	Xiuli Wang
title	A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
title_short	A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
title_full	A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
title_fullStr	A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
title_full_unstemmed	A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields
title_sort	new construction of multisender authentication codes from polynomials over finite fields
publisher	Hindawi Limited
series	Journal of Applied Mathematics
issn	1110-757X 1687-0042
publishDate	2013-01-01
description	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.
url	http://dx.doi.org/10.1155/2013/320392
work_keys_str_mv	AT xiuliwang anewconstructionofmultisenderauthenticationcodesfrompolynomialsoverfinitefields AT xiuliwang newconstructionofmultisenderauthenticationcodesfrompolynomialsoverfinitefields
_version_	1725270835569098752

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

Similar Items