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

DOI10.1007/s10898-009-9481-4zbMath1229.90091OpenAlexW1984174940MaRDI QIDQ1959232

Hoai Minh Le, Pascal Bouvry, Hoai An Le Thi, Tao Pham Dinh

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

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

Related Items (4)

Variations and extension of the convex-concave procedure ⋮ Exact penalty and error bounds in DC programming ⋮ DC programming and DCA: thirty years of developments ⋮ Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm

Uses Software

• Genocop

Cites Work

• 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
• A continuous approch for globally solving linearly constrained quadratic
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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