Pages that link to "Item:Q412332"
From MaRDI portal
The following pages link to Boolean functions optimizing most of the cryptographic criteria (Q412332):
Displayed 12 items.
- The Tu-Deng conjecture holds almost surely (Q668088) (← links)
- New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions (Q778439) (← links)
- A combinatorial condition and Boolean functions with optimal algebraic immunity (Q904950) (← links)
- Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields (Q1730316) (← links)
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost (Q2197451) (← links)
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria (Q2282303) (← links)
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity (Q2440096) (← links)
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation (Q2804904) (← links)
- A lower bound for Cusick’s conjecture on the digits of <i>n</i> + <i>t</i> (Q5019791) (← links)
- Approaching Cusick's conjecture on the sum-of-digits function (Q5244187) (← links)
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator (Q6095188) (← links)
- The binary digits of n+t (Q6098863) (← links)