On "Bent" Functions

Abstract Let P ( x ) be a function from GF (2 n ) to GF (2). P ( x ) is called “bent” if all Fourier coefficients of (−1) P(x) are ±1. The polynomial degree of a bent function P ( x ) is studied, as are the properties of the Fourier transform of (−1) P(x) , and a connection with Hadamard matrices.