A new construction of multi-sender authentication codes from polynomials over finite fields. (Q2822836)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new construction of multi-sender authentication codes from polynomials over finite fields. |
scientific article; zbMATH DE number 6632798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new construction of multi-sender authentication codes from polynomials over finite fields. |
scientific article; zbMATH DE number 6632798 |
Statements
5 October 2016
0 references
polynomials
0 references
multi-sender authentication codes
0 references
primitive element
0 references
finite fields
0 references
A new construction of multi-sender authentication codes from polynomials over finite fields. (English)
0 references
0.8837435245513916
0 references
0.8819183111190796
0 references