Generation of binary sequences for cryptographic applications

Probability theory of binary random sequences is used to characterize Boolean memoryless combining functions of n variables producing an output binary sequence Z. This is used to define conditions on the truth table of the function such that the latter is a m^th order correlation-immune. Algorithms to generate m^th and (m+1)^st order correlation-immune functions of (n+1) variables from a m^th order correlation-immune function of n variables are also derived