Authentication schemes from highly nonlinear functions

DOI10.1007/s10623-005-6407-0zbMath1192.94113MaRDI QIDQ851735

Harald Niederreiter, Cunsheng Ding, Claude Carlet

Publication date: 22 November 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-6407-0

zbMATH Keywords

Cryptography; Authentication scheme; Highly nonlinear function

Mathematics Subject Classification ID

94A62: Authentication, digital signatures and secret sharing

Related Items

Quadratic zero-difference balanced functions, APN functions and strongly regular graphs, On the relationships between perfect nonlinear functions and universal hash families, Systematic authentication codes using additive polynomials, Authentication codes based on resilient Boolean maps, Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields, Some functions with low differential uniformity, A Class of Nonbinary Codes and Sequence Families

Cites Work

• Unnamed Item
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Cartesian authentication codes from functions with optimal nonlinearity.
• Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
• Systematic Authentication Codes From Highly Nonlinear Functions
• Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences