Abstract
We report about recent results and methods in the study of bent functions. Here we focus on normality and trace expansions of bent functions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Braeken, A., Daum, M., Leander, G., Wolf, C.: An Algorithm for Checking Total Non-Normality (2004) (preprint)
Canteaut, A.: private communication (June 2004)
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)
Canteaut, A., Daum, M., Dobbertin, H., Leander, G.: Finding Non-Normal Bent Functions, special issue on Coding and Cryptography, Discrete Applied Mathematics (to appear)
Carlet, C.: A construction of bent functions. In: Finite Fields and Applications, London Mathematical Society. Lecture Series, vol. 233, pp. 47–58. Cambridge University Press, Cambridge (1996)
Carlet, C.: On cryptographic complexity of boolean functions. In: Finite Fields with Applications to Coding Theory, Cryptography and Related Areas (Proceedings of Fq6), pp. 53–69. Springer, Heidelberg (2002)
Carlet, C.: Codes de Reed-Muller, codes de Kerdock et de Preparata. PhD thesis, Université Paris 6 (1990)
Carlet, C.: On the secondary constructions of resilient and bent functions. In: Proceedings of the Workshop on Coding, Cryptography and Combinatorics 2003. BirkHauser, Basel (2004)
Carlet, C., Dobbertin, H., Leander, G.: Normal Extensions of Bent Functions. IEEE Transactions on Information Theory 50(11) (November 2004)
Daum, M., Dobbertin, H., Leander, G.: An algorithm for checking normality of Boolean functions. In: Proceedings of the Workshop on Coding and Cryptography (WCC 2003), Versailles, France, March 2003, pp. 133–142 (2003)
Dillon, J.F.: Elementary Hadamard Difference sets, PhD thesis, University of Maryland (1974)
Dillon, J.F.: Elementary Hadamard difference sets. In: Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, Congressus Numerantium No. XIV, pp. 237–249. Utilitas Math, Winnipeg (1975)
Dillon, J.F., Dobbertin, H.: New Cyclic Difference Sets with Singer Parameters, Finite Fields And Applications, pp. 342–389 (2004)
Dobbertin, H., Leander, G., Canteaut, A., Carlet, C., Felke, P., Gaborit, P.: Construction of Bent Functions via Niho Power Functions (submitted)
Dobbertin, H.: Construction of bent functions and highly nonlinear balanced Boolean functions. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 61–74. Springer, Heidelberg (1995)
Dobbertin, H.: Uniformly representable permutation polynomials. In: Helleseth, T., Kumar, P.V., Yang, K. (eds.) Proceedings of “Sequences and their applications–SETA 2001, pp. 1–22. Springer, Heidelberg (2002)
Dobbertin, H., Felke, P., Helleseth, T., Rosendahl, P.: Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums. IEEE Transactions on Information Theory (submitted)
Dubuc-Camus, S.: Etude des fonctions Booléennes dégénérées et sans corrélation, PhD thesis, Université de Caen (1998)
Hollmann, H., Xiang, Q.: On binary cyclic codes with few weights. In: Jungnickel, D., Niederreiter, H. (eds.) Proceedings of the Fifth Conference on Finite Fields and Their Applications, Augsburg, Germany, pp. 251–275. Springer, Heidelberg (1999)
Gangopadhyay, S., Maitra, S.: personal communication
Lachaud, G., Wolfmann, J.: The Weights of the Orthogonals of the Extended Quadratic Binary Goppa. IEEE Transactions on Information Theory 36(3), 686–692 (1990)
Leander, G.: Monomial Bent Functions (2004) (submitted)
Leander, G.: Non Normal Bent Functions, Monomial and Binomial Bent Functions, Ph.D. Thesis, Ruhr University Bochum (2004)
Niho, Y.: Multivalued cross-correlation functions between two maximal linear recursive sequences, Ph.D. Thesis, University of Southern California (1972)
Nyberg, K.: Perfect nonlinear S-boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378–386. Springer, Heidelberg (1991)
Rothaus, O.S.: On bent functions. Journal of Combinatorial Theory, Ser. A 20, 300–305 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dobbertin, H., Leander, G. (2005). A Survey of Some Recent Results on Bent Functions. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_1
Download citation
DOI: https://doi.org/10.1007/11423461_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26084-4
Online ISBN: 978-3-540-32048-7
eBook Packages: Computer ScienceComputer Science (R0)