Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials

DOI10.1109/TIT.2011.2146170zbMath1365.94412OpenAlexW2167161697MaRDI QIDQ5273580

Claude Carlet

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2011.2146170

Mathematics Subject Classification ID

Related Items (10)

Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction ⋮ Secondary constructions of Boolean functions with maximum algebraic immunity ⋮ Properties of a Family of Cryptographic Boolean Functions ⋮ Cryptographic properties of the hidden weighted bit function ⋮ Enhanced Boolean functions suitable for the filter model of pseudo-random generator ⋮ Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers ⋮ Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks ⋮ A construction of Boolean functions with good cryptographic properties

This page was built for publication: Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials