Skip to main content Accessibility help
×
Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-23T22:49:36.068Z Has data issue: false hasContentIssue false

3 - Bent functions and their connections to combinatorics

Published online by Cambridge University Press:  05 July 2013

Simon R. Blackburn
Affiliation:
Royal Holloway, University of London
Stefanie Gerke
Affiliation:
Royal Holloway, University of London
Mark Wildon
Affiliation:
Royal Holloway, University of London
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] OEIS Foundation Inc. (2011), The On-Line Encyclopedia of Integer Sequences, http://oeis.org.
[2] Elwyn R., Berlekamp and Lloyd R., Welch, Weight distributions of the cosets of the (32, 6) Reed-Muller code, IEEE Trans. Inf. Theory 18 (1972), no. 1, 203–207.Google Scholar
[3] Lilya, Budaghyan and Claude, Carlet, CCZ-equivalence of single and multi output Boolean functions, Finite Fields: Theory and Applications (Providence, Rhode Island) (Gary, McGuire, Gary L., Mullen, Daniel, Panario, and Igor E., Shparlinski, eds.), Contemporary Mathematics, vol. 518, American Mathematical Society, 2010, pp. 43–54.
[4] Lilya, Budaghyan, Claude, Carlet, Tor, Helleseth, and Alexander, Kholosha, Generalized bent functions and their relation to Maiorana-Mcfarland class, Proceedings of the 2012 IEEE International Symposium on Information Theory, IEEE, July 2012, pp. 1217–1220.
[5] Lilya, Budaghyan, Claude, Carlet, Tor, Helleseth, Alexander, Kholosha, and Sihem, Mesnager, Further results on Niho bent functions, IEEE Trans. Inf. Theory (2012), accepted.
[6] Lilya, Budaghyan and Tor, Helleseth, New commutative semifields defined by new PN multinomials, Cryptography and Communications 3 (2011), no. 1, 1–16.Google Scholar
[7] Anne, Canteaut, Pascale, Charpin, and Hans, Dobbertin, Binary m sequences with three-valued crosscorrelation: A proof of Welch's conjecture, IEEE Trans. Inf. Theory, 46 (2000), no. 1, 4–8.Google Scholar
[8] Anne, Canteaut, Pascale, Charpin, and Gohar M., Kyureghyan, Anew class of monomial bent functions, Finite Fields Appl. 14 (2008), no. 1, 221–241.Google Scholar
[9] Claude, Carlet, Boolean functions for cryptography and error-correcting codes, Boolean Models and Methods in Mathematics, Computer Science, and Engineering (Yves, Crama and Peter L., Hammer, eds.), Encyclopedia of Mathematics and its Applications, vol. 134, Cambridge University Press, Cambridge, 2010, pp. 257–397.
[10] Claude, Carlet, Pascale, Charpin, and Victor A., Zinoviev, Codes, bent functions and permutations suitable for DES-like cryptosystems, Des. Codes Cryptogr. 15 (1998), no. 2, 125–156.Google Scholar
[11] Claude, Carlet and Sylvie, Dubuc, On generalized bent and q-ary perfect nonlinear functions, Finite Fields and Applications: Proceedings of the Fifth International Conference (Berlin) (Dieter, Jungnickel and Harald, Niederreiter, eds.), Springer-Verlag, 2001, pp. 81–94.
[12] Claude, Carlet, Tor, Helleseth, Alexander, Kholosha, and Sihem, Mesnager, On the dual of bent functions with 2r Niho exponents, Proceedings of the 2011 IEEE International Symposium on Information Theory, IEEE, July/August 2011, pp. 657–661.
[13] Claude, Carlet and Sihem, Mesnager, On Dillon's class H of bent functions, Niho bent functions and o-polynomials, J. Combin. Theory Ser. A 118 (2011), no. 8, 2392–2410.Google Scholar
[14] Florent, Chabaud and Serge, Vaudenay, Links between differential and linear cryptanalysis, Advances in Cryptology – EuroCrypt '94 (Berlin) (Alfredo, De Santis, ed.), Lecture Notes in Computer Science, vol. 950, Springer-Verlag, 1995, pp. 356–365.
[15] Pascale, Charpin and Guang, Gong, Hyperbent functions, Kloosterman sums, and Dickson polynomials, IEEE Trans. Inf. Theory 54 (2008), no. 9, 4230–4238.Google Scholar
[16] Pascale, Charpin and Gohar M., Kyureghyan, Cubic monomial bent functions: A subclass of M, SIAM J. Discrete Math. 22 (2008), no. 2, 650–665.Google Scholar
[17] Yeow Meng, Chee, Yin, Tan, and Xian, De Zhang, Strongly regular graphs constructed from p-ary bent functions, J. Algebraic Combin. 34 (2011), no. 2, 251–266.Google Scholar
[18] Robert S., Coulter and Rex W., Matthews, Planar functions and planes of Lenz-Barlotti class II, Des. Codes Cryptogr. 10 (1997), no. 2, 167–184.Google Scholar
[19] Thomas W., Cusick and Hans, Dobbertin, Some new three-valued crosscorrelation functions for binary m-sequences, IEEE Trans. Inf. Theory 42 (1996), no. 4, 1238–1240.Google Scholar
[20] John F., Dillon, Elementary Hadamard difference sets, Ph.D. thesis, University of Maryland, 1974.
[21] John F., Dillon and Hans, Dobbertin, New cyclic difference sets with Singer parameters, Finite Fields Appl. 10 (2004), no. 3, 342–389.Google Scholar
[22] Hans, Dobbertin, One-to-one highly nonlinear power functions on GF(2n), Appl. Algebra Engrg. Comm. Comput. 9 (1998), no. 2, 139–152.Google Scholar
[23] Hans, Dobbertin, Almost perfect nonlinear power functions on GF(2n): The Niho case, Inform. and Comput. 151 (1999), no. 1–2, 57–72.Google Scholar
[24] Hans, Dobbertin, Patrick, Felke, Tor, Helleseth, and Petri, Rosendahl, Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums, IEEE Trans. Inf. Theory 52 (2006), no. 2, 613–627.Google Scholar
[25] Hans, Dobbertin, Gregor, Leander, Anne, Canteaut, Claude, Carlet, Patrick, Felke, and Philippe, Gaborit, Construction of bent functions via Niho power functions, J. Combin. Theory Ser. A 113 (2006), no. 5, 779–798.Google Scholar
[26] Keqin, Feng and Jinquan, Luo, Value distributions of exponential sums from perfect nonlinear functions and their applications, IEEE Trans. Inf. Theory 53 (2007), no. 9, 3035–3041.Google Scholar
[27] Tao, Feng, Bin, Wen, Qing, Xiang, and Jianxing, Yin, Partial difference sets from quadratic forms and p-ary weakly regular bent functions, arXiv:1002.2797v2, 2011.
[28] Robert, Gold, Maximal recursive sequences with 3-valued recursive cross-correlation functions, IEEE Trans. Inf. Theory 14 (1968), no. 1, 154–156.Google Scholar
[29] Solomon W., Golomb, Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequences, Information Sci. 1 (1968), no. 1, 87–109.Google Scholar
[30] Guang, Gong, Tor, Helleseth, Honggang, Hu, and Alexander, Kholosha, On the dual of certain ternary weakly regular bent functions, IEEE Trans. Inf. Theory 58 (2012), no. 4, 2237–2243.Google Scholar
[31] Tor, Helleseth, Some results about the cross-correlation function between two maximal linear sequences, Discrete Math. 16 (1976), no. 3, 209–232.Google Scholar
[32] Tor, Helleseth, A note on the cross-correlation function between two binary maximal length linear sequences, Discrete Math. 23 (1978), no. 3, 301–307.Google Scholar
[33] Tor, Helleseth, Henk D. L., Hollmann, Alexander, Kholosha, Zeying, Wang, and Qing, Xiang, Proofs of two conjectures on ternary weakly regular bent functions, IEEE Trans. Inf. Theory, 55 (2009), no. 11, 5272–5283.Google Scholar
[34] Tor, Helleseth and Alexander, Kholosha, Monomial and quadratic bent functions over the finite fields of odd characteristic, IEEE. Trans. Inf. Theory, 52 (2006), no. 5, 2018–2032.Google Scholar
[35] Tor, Helleseth and Alexander, Kholosha, New binomial bent functions over the finite fields of odd characteristic, IEEE Trans. Inf. Theory, 56 (2010), no. 9, 4646–4652.Google Scholar
[36] Tor, Helleseth, Alexander, Kholosha, and Sihem, Mesnager, Niho bent functions and Subiaco hyperovals, Theory and Applications of Finite Fields (Providence, Rhode Island) (Michel, Lavrauw, Gary L., Mullen, Svetla, Nikova, Daniel, Panario, and Leo, Storme, eds.), Contemporary Mathematics, vol. 579, American Mathematical Society, 2012, pp. 91–101.
[37] Tor, Helleseth, Torleiv, Kløve, and Johannes J., Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Inf. Theory 24 (1978), no. 5, 627–628.Google Scholar
[38] Tor, Helleseth and P. Vijay, Kumar, Sequences with low correlation, Handbook in Coding Theory (Vera S., Pless and W. Cary, Huffman, eds.), vol. II, chapter 21 Elsevier Science B.V., Amsterdam, 1998, pp. 1765–1853.
[39] Tor, Helleseth and Petri, Rosendahl, New pairs of m-sequences with 4-level cross-correlation, Finite Fields Appl. 11 (2005), no. 4, 674–683.Google Scholar
[40] Henk D. L., Hollmann and Qing, Xiang, A proof of the Welch and Niho conjectures on cross-correlations of binary m-sequences, Finite Fields Appl. 7 (2001), no. 2, 253–286.Google Scholar
[41] Xiang-Dong, Hou, Covering radius of the Reed-Muller code R(1, 7) – A simpler proof, J. Combin. Theory Ser. A 74 (1996), no. 2, 337–341.Google Scholar
[42] Xiang-Dong, Hou, p-ary and q-ary versions of certain results about bent functions and resilient functions, Finite Fields Appl. 10 (2004), no. 4, 566–582.Google Scholar
[43] Tadao, Kasami, The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes, Inform. and Control 18 (1971), no. 4, 369–394.Google Scholar
[44] Nicholas M., Katz and Ron, Livné, Sommes de Kloosterman et courbes elliptiques universelles en caractéristiques 2 et 3, Comptes Rendus de l'Académie des Sciences Paris, Série I – Mathematique 309 (1989), no. 11, 723–726.Google Scholar
[45] Keijo Petteri, Kononen, Marko Juhani, Rinta-aho, and Keijo O., Väänänen, On integer values of Kloosterman sums, IEEE Trans. Inf. Theory 56 (2010), no. 8, 4011–4013.Google Scholar
[46] P. Vijay, Kumar, On bent sequences and generalized bent functions, Ph.D. thesis, University of Southern California, 2004.
[47] P. Vijay, Kumar, Robert A., Scholtz, and Lloyd R., Welch, Generalized bent functions and their properties, J. Combin. Theory Ser. A 40 (1985), no. 1, 90–107.Google Scholar
[48] Gilles, Lachaud and Jacques, Wolfmann, The weights of the orthogonals of the extended quadratic binary Goppa codes, IEEE Trans. Inf. Theory 36 (1990), no. 3, 686–692.Google Scholar
[49] Philippe, Langevin and Gregor, Leander, Monomial bent functions and Stickelberger's theorem, Finite Fields Appl. 14 (2008), no. 3, 727–742.Google Scholar
[50] Gregor, Leander and Alexander, Kholosha, Bent functions with 2r Niho exponents, IEEE Trans. Inf. Theory 52 (2006), no. 12, 5529–5532.Google Scholar
[51] Nils Gregor, Leander, Monomial bent functions, IEEE Trans. Inf. Theory 52 (2006), no. 2, 738–743.Google Scholar
[52] S.L., Ma, A survey of partial difference sets, Des. Codes Cryptogr. 4 (1994), no. 3, 221–261.Google Scholar
[53] Florence J., MacWilliams and Neil James A., Sloane, The Theory of Error-Correcting Codes, North-Holland Mathematical Library, vol. 16, North-Holland, Amsterdam, 1996, Ninth impression.
[54] Robert L., McFarland, A family of difference sets in non-cyclic groups, J. Combin. Theory Ser. A 15 (1973), no. 3, 1–10.Google Scholar
[55] Marko, Moisio, Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm, Acta Arith. 132 (2008), no. 4, 329–350.Google Scholar
[56] Johannes J., Mykkeltveit, The covering radius of the (128, 8) Reed-Muller code is 56, IEEE Trans. Inf. Theory 26 (1980), no. 3, 359–362.Google Scholar
[57] Yoji, Niho, Multi-valued cross-correlation functions between two maximal linear recursive sequences, Ph.D. thesis, University of Southern California, Los Angeles, 1972.
[58] John D., Olsen, Robert A., Scholtz, and Lloyd R., Welch, Bent-function sequences, IEEE Trans. Inf. Theory 28 (1982), no. 6, 858–864.Google Scholar
[59] Nick J., Patterson and Douglas H., Wiedemann, The covering radius of the (215, 16) Reed-Muller code is at least 16276, IEEE Trans. Inf. Theory 29 (1983), no. 3, 354–356.Google Scholar
[60] Nick J., Patterson and Douglas H., Wiedemann, Corrections to “The covering radius of the (215, 16) Reed-Muller code is at least 16276”, IEEE Trans. Inf. Theory 36 (1990), no. 2, 443.Google Scholar
[61] Alexander, Pott, Finite Geometry and Character Theory, Lecture Notes in Mathematics, vol. 1601, Springer-Verlag, Berlin, 1995.
[62] Alexander, Pott, Yin, Tan, Tao, Feng, and San, Ling, Association schemes arising from bent functions, Des. Codes Cryptogr. 59 (2011), no. 1–3, 319–331.Google Scholar
[63] Oscar S., Rothaus, On “bent” functions, J. Combin. Theory Ser. A 20 (1976), no. 3, 300–305.Google Scholar
[64] Melek Diker, YücelSelçuk, Kavut, 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class, Inform. and Comput. 208 (2010), no. 4, 341–350.Google Scholar
[65] Yin, Tan, Alexander, Pott, and Tao, Feng, Strongly regular graphs associated with ternary bent functions, J. Combin. Theory Ser. A 117 (2010), no. 6, 668–682.Google Scholar
[66] Jin, Yuan, Claude, Carlet, and Cunsheng, Ding, The weight distribution of a class of linear codes from perfect nonlinear functions, IEEE Trans. Inf. Theory 52 (2006), no. 2, 712–717.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×