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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/320392 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850163676445671424 |
|---|---|
| author | Xiuli Wang |
| author_facet | Xiuli Wang |
| author_sort | Xiuli Wang |
| collection | DOAJ |
| 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. |
| format | Article |
| id | doaj-art-ed910eb4a33e4224a26163b436e929a6 |
| institution | OA Journals |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-ed910eb4a33e4224a26163b436e929a62025-08-20T02:22:10ZengWileyJournal 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 |
| spellingShingle | Xiuli Wang A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields Journal of Applied Mathematics |
| title | 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_short | 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 |
| url | http://dx.doi.org/10.1155/2013/320392 |
| work_keys_str_mv | AT xiuliwang anewconstructionofmultisenderauthenticationcodesfrompolynomialsoverfinitefields AT xiuliwang newconstructionofmultisenderauthenticationcodesfrompolynomialsoverfinitefields |