Pages that link to "Item:Q2282303"

The following pages link to Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria (Q2282303):

Displaying 8 items.

• Several classes of even-variable 1-resilient rotation symmetric Boolean functions with high algebraic degree and nonlinearity (Q2065926) (← links)
• Construction and count of 1-resilient rotation symmetric Boolean functions (Q2195348) (← links)
• A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost (Q2197451) (← links)
• Improving high-meets-low technique to generate odd-variable resilient Boolean functions with currently best nonlinearity (Q2214052) (← links)
• Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\) (Q2293177) (← links)
• Construction of resilient Boolean functions in odd variables with strictly almost optimal nonlinearity (Q2334450) (← links)
• Constructions of balanced Boolean functions on even number of variables with maximum absolute value in autocorrelation spectra \(< 2^{\frac{n}{2}}\) (Q6066001) (← links)
• Constructions of 2-resilient rotation symmetric Boolean functions with odd number of variables (Q6122603) (← links)