The following pages link to Fast Software Encryption (Q5473582):
Displaying 31 items.
- Balanced \(2p\)-variable rotation symmetric Boolean functions with optimal algebraic immunity, good nonlinearity, and good algebraic degree (Q394926) (← links)
- Cryptographic properties of the hidden weighted bit function (Q400509) (← links)
- Concatenations of the hidden weighted bit function and their cryptographic properties (Q476337) (← links)
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks (Q498981) (← links)
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation (Q662198) (← links)
- Hybrid classes of balanced Boolean functions with good cryptographic properties (Q726405) (← links)
- Some lower bounds on the algebraic immunity of functions given by their trace forms (Q734262) (← links)
- Further properties of several classes of Boolean functions with optimum algebraic immunity (Q735033) (← links)
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity (Q851733) (← links)
- A construction of 1-resilient Boolean functions with good cryptographic properties (Q1621194) (← links)
- A characterization of balanced Boolean functions with optimal algebraic immunity (Q1671334) (← links)
- Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions (Q1944083) (← links)
- On extended algebraic immunity (Q1960218) (← links)
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks (Q1960219) (← links)
- A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions (Q1999897) (← links)
- Simpler proof for nonlinearity of majority function (Q2022506) (← links)
- A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code (Q2249793) (← links)
- Boolean functions of an odd number of variables with maximum algebraic immunity (Q2385400) (← links)
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity (Q2440096) (← links)
- A new method to construct Boolean functions with good cryptographic properties (Q2444771) (← links)
- A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers (Q2510577) (← links)
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions (Q2515558) (← links)
- Properties of a Family of Cryptographic Boolean Functions (Q2945065) (← links)
- A class of rotation symmetric Boolean functions with optimum algebraic immunity (Q3403216) (← links)
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction (Q3546654) (← links)
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks (Q3593094) (← links)
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity (Q3600389) (← links)
- Sequences, DFT and Resistance against Fast Algebraic Attacks (Q3600442) (← links)
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations (Q3600455) (← links)
- Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity (Q5386105) (← links)
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator (Q6095188) (← links)
