1. Braeken, A., Wolf, C., Preneel, B.: A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions. In: Levy, J., Mayr, E.W., Mitchell, J.C. (eds.) 3rd International Conference on Theoretical Computer Science 2004, pp. 51–66. Kluwer, Dordrecht (2004)
2. Braeken, A., Daum, M., Leander, G., Wolf, C.: An Algorithm for Checking Total Non-Normality (2004) (preprint)
3. Canteaut, A.: private communication (June 2004)
4. Canteaut, A., Daum, M., Dobbertin, H., Leander, G.: Normal and Non-Normal Bent Functions. In: Proceedings of the Workshop on Coding and Cryptography (WCC 2003), Versailles, France, March 2003, pp. 91–100 (2003)
5. Canteaut, A., Daum, M., Dobbertin, H., Leander, G.: Finding Non-Normal Bent Functions, special issue on Coding and Cryptography, Discrete Applied Mathematics (to appear)