Abstract: Recently Lobanov’s tight bound of nonlinearity of balanced algebraic immune Boolean functions has received a lot of attention in cryptographic literature. In this study a general construction of balanced algebraic immune Boolean functions was given with the nonlinearity bound. Moreover from the construction, we get a lower bound of the count of balanced algebraic immune functions was got with the nonlinearity bound. As far as we know, this is the first bound about this count.