Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm

DOI10.1007/978-3-540-87477-5_61zbMath1160.90583OpenAlexW1582712263MaRDI QIDQ3627765

Hoai An Le Thi, Tao Pham Dinh, Sarra Bouallagui

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_61

zbMATH Keywords

nonlinearityBoolean functionDC programmingbalanceSADCA (DC algorithm)

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (1)

DC programming and DCA: thirty years of developments

Cites Work

• Exact penalty and error bounds in DC programming
• D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm