Heuristic design of cryptographically strong balanced Boolean functions

DOI10.1007/BFB0054148MaRDI QIDQ4249660zbMATH OpenFDO

Authors William Millan, A. Clark, Ed Dawson

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0054148

zbMATH Keywords

Boolean functionscorrelation immunitygenetic algorithmHill climbing techniquesnonlinear balanced Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2104732
• Boolean function design using hill climbing methods
• Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
• Nonlinearity and propagation characteristics of balanced Boolean functions
• Methods for design of balanced Boolean functions satisfying Strict Avalanche Criterion (SAC)

Cited in

(18)

• How to use metaheuristics for design of symmetric-key primitives
• Connections among nonlinearity, avalanche and correlation immunity
• Classification of Boolean functions where affine functions are uniformly distributed
• A note on rotation symmetric S-boxes
• The designs of S-boxes by simulated annealing
• Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read
• Boolean function design using hill climbing methods
• scientific article; zbMATH DE number 1955796 (Why is no real title available?)
• scientific article; zbMATH DE number 1522640 (Why is no real title available?)
• Generalized lexicographic multiobjective combinatorial optimization. Application to cryptography
• scientific article; zbMATH DE number 2104732 (Why is no real title available?)
• Progress in Cryptology - INDOCRYPT 2003
• Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
• A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
• Heuristic search of (semi-)bent functions based on cellular automata
• Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)
• Generating cryptographically strong Boolean functions using partial information
• Hybrid classes of balanced Boolean functions with good cryptographic properties

This page was built for publication: Heuristic design of cryptographically strong balanced Boolean functions

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