A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography

DOI10.1007/S10898-009-9481-4MaRDI QIDQ1959232zbMATH OpenOpenAlexFDO

Authors H. M. Le, Le Thi Hoai An, Pascal Bouvry, Pham Dinh Tao

Publication date 6 October 2010

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-009-9481-4

zbMATH Keywords

cryptographygenetic algorithmhybrid geneticmixed 0-1 polyhedral convex programnonlinear balanced boolean functions

Mathematics Subject Classification ID

Boolean programming (90C09) Nonconvex programming, global optimization (90C26)

Review text

In this paper, the authors are concerned with the construction of highly nonlinear balanced Boolean functions, in other words the aim is to find a balanced Boolean function featuring a maximal nonlinearity criterion. This problem is reformulated as a deterministic optimization problem. Due to the large dimension of this problem in the practical applications, the classical methods used in combinatorial optimization such as branch and bound, branch and cut, cutting plans, etc. can not be applied and the authors in order to develop robust numerical solution approaches formulate the problem as a polyhedral DC (difference of convex functions) program by using exact penalty techniques and then there is investigated DC programming and DCA (DC optimization algorithms) for solving the related polyhedral DC program. The described computational results show that the DCA is an efficient approach for this problem and it is superior to the standard heuristic approaches developed for the problem.

Recommendations

• Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
• A genetic algorithm for constructing bijective substitution boxes with high nonlinearity
• The designs of S-boxes by simulated annealing
• A method for generation of high-nonlinear S-boxes based on gradient descent
• Synthesis of highly nonlinear S-boxes satisfying higher order propagation criterion

Cites work

• A continuous approch for globally solving linearly constrained quadratic
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Construction of nonlinear Boolean functions with important cryptographic properties
• scientific article; zbMATH DE number 1279023 (Why is no real title available?)
• scientific article; zbMATH DE number 702365 (Why is no real title available?)
• scientific article; zbMATH DE number 1024044 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Propagation characteristics and correlation-immunity of highly nonlinear Boolean functions
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

Cited in

(6)

• DC programming and DCA: thirty years of developments
• Variations and extension of the convex-concave procedure
• Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
• Exact penalty and error bounds in DC programming
• Generalized lexicographic multiobjective combinatorial optimization. Application to cryptography
• Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)

Describes a project that uses

Uses Software

• Genocop

This page was built for publication: A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography

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