Cartesian authentication codes from functions with optimal nonlinearity
Authors:
- 1 January 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 290 (3) , 1737-1752
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Almost Perfect Nonlinear Power Functions on GF(2n): The Niho CaseInformation and Computation, 1999
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch caseIEEE Transactions on Information Theory, 1999
- Universal Hashing and Geometric CodesDesigns, Codes and Cryptography, 1997
- Planar Functions and Planes of Lenz-Barlotti Class IIDesigns, Codes and Cryptography, 1997
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings1996
- A new construction of circulant GH(p2;Zp)Discrete Mathematics, 1993
- CirculantGH(p 2; Z p ) exist for all primespGraphs and Combinatorics, 1992
- Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback1992
- Codes Which Detect DeceptionBell System Technical Journal, 1974
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)IEEE Transactions on Information Theory, 1968