scientific article; zbMATH DE number 1522640

From MaRDI portal
Publication:4510902





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].











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)