The algebraic immunity of boolean functions

The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the standard algebraic attacks of the pseudo-random generators using it as a nonlinear filtering or combining function. This survey contains brief description of algebraic attacks and results have been found concerning the algebraic immunity and its relations with the other cryptographic parameters.