Autor:	Zülfükar Saygı
Předmět:	POLYNOMIALS ENCODING FINITE fields CRYPTOGRAPHY ADDITIVE functions RATIONAL points (Geometry) CIPHERS
Zdroj:	Designs, Codes & Cryptography; Dec2008, Vol. 49 Issue 1-3, p61-77, 17p
Abstrakt:	Abstract Using additive polynomials related to some curves over finite fields, we construct two families of systematic authentication codes. We use tight bounds for the number of rational points of these curves in estimating the probabilities of the systematic authentication codes. We compare their parameters with some existing codes in the literature. We observe that the parameters are better than the existing ones in some cases. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu Full text from SpringerLink