Authentication schemes from highly nonlinear functions

DOI10.1007/S10623-005-6407-0MaRDI QIDQ851735zbMATH OpenOpenAlexFDO

Authors Claude Carlet, Cunsheng Ding, Harald Niederreiter

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

CryptographyAuthentication schemeHighly nonlinear function

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Systematic Authentication Codes From Highly Nonlinear Functions
• Cartesian authentication codes from functions with optimal nonlinearity.
• scientific article; zbMATH DE number 1870511
• Highly nonlinear mappings
• Construction of highly nonlinear functions

Cites work

• scientific article; zbMATH DE number 1088929 (Why is no real title available?)
• Cartesian authentication codes from functions with optimal nonlinearity.
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Systematic Authentication Codes From Highly Nonlinear Functions
• Universal hash functions from exponential sums over finite fields and Galois rings
• Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences

Cited in

(12)

• Construction and Analysis of Cryptographic Functions
• Algebraic manipulation detection codes via highly nonlinear functions
• Systematic Authentication Codes From Highly Nonlinear Functions
• On the relationships between perfect nonlinear functions and universal hash families
• Some functions with low differential uniformity
• Construction of multi-receiver multi-fold authentication codes from singular symplectic geometry over finite fields
• A Class of Nonbinary Codes and Sequence Families
• scientific article; zbMATH DE number 7300318 (Why is no real title available?)
• Quadratic zero-difference balanced functions, APN functions and strongly regular graphs
• Systematic authentication codes using additive polynomials
• A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
• Authentication codes based on resilient Boolean maps

This page was built for publication: Authentication schemes from highly nonlinear functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851735)