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

DOI10.1109/TIT.2011.2146170MaRDI QIDQ5273580zbMATH OpenOpenAlexFDO

Authors 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

Boolean functions (06E30) Cryptography (94A60)

Cited in

(12)

• Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
• A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
• Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
• Secondary constructions of Boolean functions with maximum algebraic immunity
• A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers
• 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 construction of Boolean functions with good cryptographic properties
• Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks
• Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273580)