Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
From MaRDI portal
Cited in
(28)- Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
- A characterization of balanced Boolean functions with optimal algebraic immunity
- New constructions of even-variable rotation symmetric Boolean functions with maximum algebraic immunity
- On the affine equivalence relation between two classes of Boolean functions with optimal algebraic immunity
- A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
- Transparency order for Boolean functions: analysis and construction
- Secondary constructions of Boolean functions with maximum algebraic immunity
- On algebraic immunity of trace inverse functions on finite fields of characteristic two
- Construction of 1-resilient Boolean functions with optimal algebraic immunity and good non\-linearity
- A matrix construction of Boolean functions with maximum algebraic immunity
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- A new method to construct Boolean functions with good cryptographic properties
- The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function
- An algorithm for the spectral immunity of binary sequence with period 2ⁿ
- Properties of a family of cryptographic Boolean functions
- Cryptographic properties of the hidden weighted bit function
- Boolean functions optimizing most of the cryptographic criteria
- On the construction of multi-output Boolean functions with optimal algebraic immunity
- scientific article; zbMATH DE number 1955795 (Why is no real title available?)
- Concatenations of the hidden weighted bit function and their cryptographic properties
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
- Construction of balanced rotation symmetric Boolean functions with optimal algebraic immunity
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- Hybrid classes of balanced Boolean functions with good cryptographic properties
- On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\)
- New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions
- Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
This page was built for publication: Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281477)