Bent Functions: Results and Applications to Cryptography offers a unique survey of the objects of discrete mathematics known as Boolean bent functions. As these maximal nonlinear Boolean functions and their generalizations have many theoretical and practical applications in combinatorics coding theory and cryptography the text provides a detailed survey of their main results presenting a systematic overview of their generalizations and applications and considering open problems in classification and systematization of bent functions. The text is appropriate for novices and advanced researchers discussing proofs of several results including the automorphism group of bent functions the lower bound for the number of bent functions and more.