On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation

DOI10.1109/TIT.2010.2050801MaRDI QIDQ5281358zbMATH OpenOpenAlexFDO

Authors Panagiotis Rizomiliotis

Publication date 27 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.2010.2050801

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Cited in

(21)

• Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
• A characterization of balanced Boolean functions with optimal algebraic immunity
• New constructions of even-variable rotation symmetric Boolean functions with maximum algebraic immunity
• A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
• Transparency order for Boolean functions: analysis and construction
• Secondary constructions of Boolean functions with maximum algebraic immunity
• Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
• A new method to construct Boolean functions with good cryptographic properties
• A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers
• The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function
• A class of 1-resilient Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks
• Properties of a family of cryptographic Boolean functions
• On computing the immunity of Boolean power functions against fast algebraic attacks
• Cryptographic properties of the hidden weighted bit function
• Concatenations of the hidden weighted bit function and their cryptographic properties
• Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
• A note on the optimal immunity of Boolean functions against fast algebraic attacks
• A construction of Boolean functions with good cryptographic properties
• On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
• Weightwise (almost) perfectly balanced functions based on total orders
• On the immunity of rotation symmetric Boolean functions against fast algebraic attacks

This page was built for publication: On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation

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