Bell inequalities, classical cryptography and fractals

The relation between the boolean functions and Bell inequalities for qubits is analyzed. The connection between the maximal quantum violation of a Bell inequality and the nonlinearity of the corresponding boolean function is discussed. A visualization scheme of boolean functions is proposed. An attempt to classify Bell inequalities for qubits is made, a weaker result (classification with respect to Jevons group) is obtained. The fractal structure of the classification is shown. All constructs are illustrated by Mathematica code.