An upper bound for the linearity of exponential Welch-Costas functions
From MaRDI portal
Publication:439098
Recommendations
- On the nonlinearity of linear recurrence sequences
- Auto-correlations and new bounds on the nonlinearity of Boolean functions
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Maximally nonlinear functions and bent functions.
- New upper bounds on the linear complexity
Cites work
- scientific article; zbMATH DE number 177050 (Why is no real title available?)
- scientific article; zbMATH DE number 503329 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- APN permutations on \(\mathbb Z_n\) and Costas arrays
- Generalized bent functions and their properties
- Highly nonlinear mappings
- Linear Approximations of Addition Modulo 2n-1
- Linear Cryptanalysis of Non Binary Ciphers
- On ``bent functions
- On the Nonlinearity of Exponential Welch Costas Functions
- On the exponential sum
- SAFER K-64: A byte-oriented block-ciphering algorithm
- SAFER K-64: One year later
Cited in
(4)- On the Nonlinearity of Exponential Welch Costas Functions
- Construction of highly nonlinear permutations on \(\mathbb{Z}_{2p}\) with differential uniformity at most 8
- Perfect nonlinear functions and cryptography
- Bounds on the maximum nonlinearity of permutations on the rings \(\mathbb{Z}_p\) and \(\mathbb{Z}_{2p}\)
This page was built for publication: An upper bound for the linearity of exponential Welch-Costas functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439098)
