Boolean function design using hill climbing methods

DOI10.1007/3-540-48970-3_1MaRDI QIDQ4250624zbMATH OpenFDO

Authors William Millan, A. Clark, Ed Dawson

Publication date 9 September 1999

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

Full work available at URL https://doi.org/10.1007/3-540-48970-3_1

zbMATH Keywords

autocorrelation functionBoolean functionscryptographyglobal autocorrelationhill climbingnonlinearityWalsh-Hadamard transform

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• Heuristic design of cryptographically strong balanced Boolean functions
• Progress in Cryptology - INDOCRYPT 2003
• scientific article; zbMATH DE number 2104732
• scientific article; zbMATH DE number 1955796
• An effective genetic algorithm for finding highly nonlinear Boolean functions

Cited in

(12)

• A note on rotation symmetric S-boxes
• The designs of S-boxes by simulated annealing
• scientific article; zbMATH DE number 1612515 (Why is no real title available?)
• Hill climbing algorithms and Trivium
• The change in linear and differential characteristics of substitution after the multiplication by transposition
• Heuristic design of cryptographically strong balanced Boolean functions
• scientific article; zbMATH DE number 1955796 (Why is no real title available?)
• Automated cryptanalysis of substitution cipher using Hill climbing with well designed heuristic function
• A method for generation of high-nonlinear S-boxes based on gradient descent
• Progress in Cryptology - INDOCRYPT 2003
• A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
• Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)

This page was built for publication: Boolean function design using hill climbing methods

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