Systematic Authentication Codes From Highly Nonlinear Functions
From MaRDI portal
Recommendations
- Authentication schemes from highly nonlinear functions
- Cartesian authentication codes from functions with optimal nonlinearity.
- Systematic authentication codes using additive polynomials
- A coding theory construction of new systematic authentication codes
- scientific article; zbMATH DE number 2170431
- Systematic authentication codes based on a class of bent functions and the Gray map on a Galois ring
- scientific article; zbMATH DE number 1857521
- Linear authentication codes: bounds and constructions
- scientific article; zbMATH DE number 3937111
- Bent functions on a Galois ring and systematic authentication codes
Cited in
(16)- Systematic authentication codes using additive polynomials
- Cartesian authentication codes from functions with optimal nonlinearity.
- New constructions of systematic authentication codes from three classes of cyclic codes
- Algebraic manipulation detection codes via highly nonlinear functions
- On a generalization of planar functions
- A family of planar binomials in characteristic 2
- Some constructions of systematic authentication codes using Galois rings
- Authentication codes based on resilient Boolean maps
- Authentication codes from difference balanced functions
- Optimal authentication codes from difference balanced functions
- A Class of Nonbinary Codes and Sequence Families
- On the relationships between perfect nonlinear functions and universal hash families
- Bent functions on a Galois ring and systematic authentication codes
- New pseudo-planar binomials in characteristic two and related schemes
- The weight distribution of a class of p-ary cyclic codes
- Authentication schemes from highly nonlinear functions
This page was built for publication: Systematic Authentication Codes From Highly Nonlinear Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546800)