The following pages link to On a Combinatorial Conjecture (Q2999536):
Displayed 11 items.
- Boolean functions optimizing most of the cryptographic criteria (Q412332) (← links)
- The Tu-Deng conjecture holds almost surely (Q668088) (← links)
- Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields (Q1730316) (← links)
- A note on two classes of Boolean functions with optimal algebraic immunity (Q2341577) (← links)
- On a Conjecture of Cusick Concerning the Sum of Digits of $n$ and $n+t$ (Q2801335) (← links)
- Properties of a Family of Cryptographic Boolean Functions (Q2945065) (← 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)
- Algebraic immunity of bent functions of the Dillon class (Q5264762) (← links)
- An infinite family of 0-APN monomials with two parameters (Q6088859) (← links)
- The binary digits of n+t (Q6098863) (← links)