scientific article; zbMATH DE number 1522640

MaRDI QIDQ4510902zbMATH OpenFDO

Authors Ed Dawson, William Millan, Leonie Simpson

Publication date 10 June 2002

zbMATH Keywords

block cipherBoolean functioncorrelation immunitygenetic algorithmhill-climbing method

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Review text

This review deals with the construction of Boolean functions of \(n\) variables to serve as cryptographic codes and criteria for them to be good. The main criterion used is that the function should be statistically independent of any subset of \(m\) input variables (correlation immunity \(CI(m)\)). The recommended methods are composition of Boolean functions and linear codes, hill-climbing algorithms, and genetic algorithms. For the entire collection see [Zbl 0942.00022].

Recommendations

• Heuristic design of cryptographically strong balanced Boolean functions
• scientific article; zbMATH DE number 6795543
• Boolean functions and their applications in cryptography
• Boolean functions for cryptography and coding theory
• scientific article; zbMATH DE number 2104732

Cited in

(6)

• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• Cryptographic Boolean functions and applications
• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• On influences of Boolean variables and their computation
• Construction of cryptographically important Boolean functions
• A survey of metaheuristic algorithms for the design of cryptographic Boolean functions

This page was built for publication:

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