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/sup th/ order correlation-immune. Algorithms to generate m/sup th/ and (m+1)/sup st/ order correlation-immune functions of (n+1) variables from a m/sup th/ order correlation-immune function of n variables are also derived.<>