I will  present the concept introduced by Solomon Golomb for boolean functions, called invariants of boolean functions in 1959.  This concept is called nonlinearity of boolean functions in modern cryptology. Nonlinearity is an important criterion  for a cryptographic boolean function used in symmetric cryptographic algorithms including stream ciphers, block ciphers and hash functions.   It is a fundamental result  for launching correlation attack.