×

Bent functions: results and applications. A survey. (Russian. English summary) Zbl 07300318

Summary: A survey of main results on bent functions is given. Theoretical and practical applications of bent functions are considered.

MSC:

94-XX Information and communication theory, circuits
26-XX Real functions
PDFBibTeX XMLCite
Full Text: MNR

References:

[1] Avgustinovich S. V., “Ob odnom svoistve sovershennykh dvoichnykh kodov”, Diskret. analiz i issled. operatsii, 2:1 (1995), 4-6 · Zbl 0861.94018
[2] Ambrosimov A. S., “Svoistva bent-funktsii \(q\)-znachnoi logiki nad konechnymi polyami”, Diskretnaya matematika, 6:3 (1994), 50-60 · Zbl 0816.03010
[3] Vasilev Yu. L., “O negruppovykh plotno upakovannykh kodakh”, Problemy kibernetiki, 8, Nauka, M., 1962, 337-339
[4] Kuznetsov Yu. V., Shkarin S. A., “Kody Rida-Mallera (obzor publikatsii)”, Matematicheskie voprosy kibernetiki, 6, Fizmatlit, M., 1996, 5-50 · Zbl 1155.94404
[5] Kuzmin A. S., Markov V. T., Nechaev A. A. i dr., “Bent-funktsii i giperbent-funktsii nad polem iz \(2^l\) elementov”, Problemy peredachi informatsii, 44:1 (2008), 15-37 · Zbl 1235.94049
[6] Logachev O. A., Salnikov A. A., Yaschenko V. V., “Bent-funktsii na konechnoi abelevoi gruppe”, Diskretnaya matematika, 9:4 (1997), 3-20 · Zbl 0982.94012 · doi:10.4213/dm498
[7] Logachev O. A., Salnikov A. A., Yaschenko V. V., “Nekotorye kharakteristiki “nelineinosti” gruppovykh otobrazhenii”, Diskret. analiz i issled. operatsii. Ser. 1, 8:1 (2001), 40-54 · Zbl 0973.20044
[8] Logachev O. A., Salnikov A. A., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptologii, Moskovskii tsentr nepreryvnogo matematicheskogo obrazovaniya, M., 2004, 470 pp. · Zbl 1110.94001
[9] Mak-Vilyams F. Dzh., Sloen N. Dzh. A., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979, 745 pp.
[10] Moldovyan A. A., Moldovyan N. A., Eremeev M. A., Kriptografiya: ot primitivov k sintezu algoritmov, BKhV-Peterburg, SPb., 2004
[11] Nigmatullin R. G., Slozhnost bulevykh funktsii, Nauka, M., 1991, 240 pp. · Zbl 0719.68024
[12] Sidelnikov V. M., “O vzaimnoi korrelyatsii posledovatelnostei”, Problemy kibernetiki, 24, Nauka, M., 1971, 15-42 · Zbl 0241.94009
[13] Sidelnikov V. M., “Ob ekstremalnykh mnogochlenakh, ispolzuemykh pri otsenkakh moschnosti koda”, Problemy peredachi informatsii, 16:3 (1980), 17-30 · Zbl 0468.94010
[14] Solodovnikov V. I., “Bent-funktsii iz konechnoi abelevoi gruppy v konechnuyu abelevu gruppu”, Diskretnaya matematika, 14:1 (2002), 99-113 · Zbl 1047.94011 · doi:10.4213/dm234
[15] Tokareva N. N., “Bent-funktsii s bolee silnymi svoistvami nelineinosti: \(k\)-bent-funktsii”, Diskret. analiz i issled. operatsii. Ser. 1, 14:4 (2007), 76-102 · Zbl 1249.94039
[16] Tokareva N. N., “Obobscheniya bent-funktsii. Obzor”, Diskret. analiz i issled. operatsii, 16 (2009) (to appear); Доступен на
[17] Kholl M., Kombinatorika, Mir, M., 1970, 424 pp.
[18] Cheremushkin A. V., “Metody affinnoi i lineinoi klassifikatsii bulevykh funktsii”, Trudy po diskretnoi matematike, 4, Fizmatlit, M., 2001, 273-314
[19] Yaschenko V. V., “O kriterii rasprostraneniya dlya bulevykh funktsii i o bent-funktsiyakh”, Problemy peredachi informatsii, 33:1 (1997), 75-86 · Zbl 1037.94560
[20] Yaschenko V. V., “O dvukh kharakteristikakh nelineinosti bulevykh otobrazhenii”, Diskret. analiz i issled. operatsii. Ser. 1, 5:2 (1998), 90-96 · Zbl 0902.06021
[21] Adams C., “On immunity against Biham and Shamir”s ‘differential cryptanalysis’ ”, Information Processing Letters, 41 (1992), 77-80 · Zbl 0743.68057 · doi:10.1016/0020-0190(92)90258-W
[22] Agievich S. V., “On the representation of bent functions by bent rectangles”, Fifth Int. Petrozavodsk conf. on probabilistic methods in discrete mathematics, Proc. (Petrozavodsk, Russia, June 1-6, 2000), VSP, Boston, 2000, 121-135; Available at
[23] Agievich S. V., On the affine classification of cubic bent functions, Cryptology ePrint Archive, Report 2005/044, available at · Zbl 1167.94004
[24] Agievich S. V., “Bent rectangles”, NATO Advanced Study Institute on Boolean Functions in Cryptology and Information Security, Proc. (Zvenigorod, Russia, September 8-18, 2007), IOS Press, Netherlands, 2008, 3-22 · Zbl 1167.94004
[25] Bending T. D., Fon-Der-Flaass D. G., “Crooked Functions, Bent Functions and Distance Regular Graphs”, Electronic J. Combinatorics, 1998, no. 5, R34 · Zbl 0903.05053
[26] Bernasconi A., Codenotti B., “Spectral analysis of Boolean functions as a graph eigenvalue problem”, IEEE Trans. Computers, 48:3 (1999), 345-351 · Zbl 1391.94908 · doi:10.1109/12.755000
[27] Bernasconi A., Codenotti B., VanderKam J. M., “A characterization of bent functions in terms of strongly regular graphs”, IEEE Trans. Computers, 50:9 (2001), 984-985 · Zbl 1392.94964 · doi:10.1109/12.954512
[28] Biham E., Shamir A., “Differential cryptanalysis of DES-like cryptosystems”, J. Cryptology, 4:1 (1991), 3-72 · Zbl 0729.68017 · doi:10.1007/BF00630563
[29] Bracken C., Leander G., “New families of functions with differential uniformity of 4”, Fourth International Conference BFCA - Boolean Functions: Cryptography and Applications, Proc. (Copenhagen, Denmark, May 19-21, 2008), 190-194 (to appear)
[30] Braeken A., Cryptographic properties of Boolean functions and S-boxes, Ph. D. Thesis, Katholieke Univ. Leuven, 2006; Available at
[31] Budaghyan L., Carlet C., Leander G., “On inequivalence between known power APN functions”, Fourth International Conference BFCA - Boolean Functions: Cryptography and Applications, Proc. (Copenhagen, Denmark, May 19-21, 2008), 3-15 (to appear)
[32] Budaghyan L., Private Communication, 2008
[33] Budaghyan L., Pott A., “On differential uniformity and nonlinearity of functions”, Discrete Mathematics, 309:1 (2009), 371-384 · Zbl 1159.94005 · doi:10.1016/j.disc.2007.12.025
[34] Byrne E., McGuire G., “On the non-existence of crooked functions on finite fields”, WCC - International Workshop on Coding and Cryptography, Proc. (Bergen, Norway, March 14-18, 2005), 2005, 316-324
[35] Canteaut A., Charpin P., Kuyreghyan G., “A new class of monomial bent functions”, Finite Fields and Applications, 14:1 (2008), 221-241 · Zbl 1162.94004 · doi:10.1016/j.ffa.2007.02.004
[36] Carlet C., “Generalized Partial Spreads”, IEEE Trans. Inform. Theory, 41:5 (1995), 1482-1487 · Zbl 0831.94022 · doi:10.1109/18.412693
[37] Carlet C., “A construction of bent functions”, Finite Fields and Applications, London Math. Soc. Lecture Note Ser., 233, Cambridge Univ. Press, Cambridge, 1996, 47-58 · Zbl 0871.94027
[38] Carlet C., “On cryptographic complexity of Boolean functions”, Proc. of the Sixth Conference on Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, eds. G. L. Mullen, H. Stichtenoth, H. Tapia-Recillas, Springer, 2002, 53-69 · Zbl 1021.94524 · doi:10.1007/978-3-642-59435-9_4
[39] Carlet C., “On the confusion and diffusion properties of Maiorana-McFarland”s and extended Maiorana-McFarland’s functions“, J. Complexity, 19, Special Issue “Complexity Issues in Coding Theory and Cryptography” dedicated to Prof. Hara (2004), 182-204 · Zbl 1057.94016 · doi:10.1016/j.jco.2003.08.013
[40] Carlet C., “Boolean Functions for Cryptography and Error Correcting Codes”, Chapter of the monograph, Boolean Methods and Models, eds. P. Hammer, Y. Crama eds., Cambridge Univ. Press (to appear) · Zbl 1209.94035
[41] Carlet C., “Vectorial Boolean Functions for Cryptography”, Chapter of the monograph, Boolean Methods and Models, eds. P. Hammer, Y. Crama eds., Cambridge Univ. Press (to appear) · Zbl 1209.94036
[42] Carlet C., Charpin P., Zinoviev V., “Codes, bent functions and permutations suitable for DES-like cryptosystems”, Designs, Codes and Cryptography, 15:2 (1998), 125-156 · Zbl 0938.94011 · doi:10.1023/A:1008344232130
[43] Carlet C., Danielsen L.-E., Parker M. G., Solé P., “Self Dual Bent Functions”, Fourth International Conference BFCA - Boolean Functions: Cryptography and Applications, Proc. (Copenhagen, Denmark, May 19-21, 2008), 39-52 (to appear) · Zbl 1204.94118
[44] Carlet C., Ding C., “Highly nonlinear mappings”, J. Complexity, 19:2-3 (2004), 205-244 · Zbl 1053.94011 · doi:10.1016/j.jco.2003.08.008
[45] Carlet C., Ding C., Niederreiter H., “Authentication schemes from highly nonlinear functions”, Designs, Codes and Cryptography, 40:1 (2006), 71-79 · Zbl 1192.94113 · doi:10.1007/s10623-005-6407-0
[46] Carlet C., Guillot P., “A characterization of binary bent functions”, J. Combin. Theory. Ser. A, 76:2 (1996), 328-335 · Zbl 0861.94014 · doi:10.1006/jcta.1996.0110
[47] Carlet C., Guillot P., “An alternate characterization of the bentness of binary functions, with uniqueness”, Designs, Codes and Cryptography, 14:2 (1998), 133-140 · Zbl 0956.94008 · doi:10.1023/A:1008283912025
[48] Carlet C., Klapper A., “Upper bounds on the numbers of resilient functions and of bent functions”, 23rd Symposium on Information Theory, Proc. (Benelux, Belgium, May, 2002), 2002, 307-314; The full version, Lecture Notes dedicated to Philippe Delsarte (to appear); Available at
[49] CAST-128. RFC 2144 - the CAST-128 encryption algorithm,
[50] Chabaud F., Vaudenay S., “Links between Differential and Linear Cryptanalysis”, Advances in Cryptology - EUROCRYPT’ 94, International Conference on the Theory and Application of Cryptographic Techniques, Proc. (Perugia, Italy, May 9-12, 1994), Lecture Notes in Comput. Sci., 950, Springer, 1995, 356-365 · Zbl 0879.94023 · doi:10.1007/BFb0053450
[51] Charpin P., Pasalic E., Tavernier C., “On bent and semi-bent quadratic Boolean functions”, IEEE Trans. Inform. Theory, 51:12 (2005), 4286-4298 · Zbl 1184.94234 · doi:10.1109/TIT.2005.858929
[52] Chase P. J., Dillon J. F., Lerche K. D., Bent functions and difference sets, NSA R41 Technical Paper, September, 1970
[53] Chee S., Lee S., Kim K., “Semi-bent Functions”, Advances in Cryptology - ASIACRYPT’ 94, 4th International Conference on the Theory and Applications of Cryptology, Proc. (Wollongong, Australia, November 28 - December 1, 1994), Lecture Notes in Comput. Sci., 917, Springer, Berlin, 1995, 107-118 · Zbl 0871.94028
[54] Clark J. A., Jacob J. L., “Two-stage optimisation in the design of Boolean functions”, 5th Australian Conference on Information Security and Privacy, Proc. (Brisbane, Australia, July 10-12, 2000), Lecture Notes in Comput. Sci., 1841, Springer-Verlag, 2000, 242-254 · Zbl 0963.94508 · doi:10.1007/10718964_20
[55] Clark J. A., Jacob J. L., Maitra S., Stanica P., “Almost Boolean Functions: the Design of Boolean Functions by Spectral Inversion”, Computational Intelligence, 20:3 (2004), 450-462 · doi:10.1111/j.0824-7935.2004.00245.x
[56] Climent J.-J., Garcia F. J., Requena V., “On the construction of bent functions of \(n+2\) variables from bent functions of \(n\) variables”, Advances in Math. of Communications, 2:4 (2008), 421-431 · Zbl 1161.06007 · doi:10.3934/amc.2008.2.421
[57] Van Dam E. R., Fon-Der-Flaass D. G., “Uniformly Packed Codes and More Distance Regular Graphs from Crooked Functions”, J. Algebraic Combinatorics, 12:2 (2000), 115-121 · Zbl 0966.05084 · doi:10.1023/A:1026583725202
[58] Van Dam E. R., Fon-Der-Flaass D. G., “Codes, graphs, and schemes from nonlinear functions”, European J. Combinatorics, 24:1 (2003), 85-98 · Zbl 1015.05093 · doi:10.1016/S0195-6698(02)00116-6
[59] Delsarte P., An algebraic approach to the association schemes of coding theory, Ph. D. Thesis, Univ. Catholique de Louvain, 1973 · Zbl 1075.05606
[60] Dempwolff U., “Automorphisms and equivalence of bent functions and of difference sets in elementary Abelian 2-groups”, Communications in Algebra, 34:3 (2006), 1077-1131 · Zbl 1085.05019 · doi:10.1080/00927870500442062
[61] Dempwolff U., Bent Functions in Dimensions 8, 10, 12, See the section at homepage of U. Dempwolff
[62] Dillon J. F., “A survey of bent functions”, The NSA Technical J., Special Issue (1972), 191-215
[63] Dillon J. F., Elementary Hadamard Difference sets, Ph. D. Thesis, Univ. of Maryland, 1974 · Zbl 0346.05003
[64] Dobbertin H., “Construction of bent functions and balanced Boolean functions with high nonlinearity”, Fast Software Encryption -FSE’ 95, Second International Workshop, Proc. (Leuven, Belgium, December14-16, 1994), Lecture Notes in Comput. Sci., 1008, Springer, Berlin, 1995, 61-74 · Zbl 0939.94563 · doi:10.1007/3-540-60590-8_5
[65] Dobbertin H., “Almost perfect nonlinear power functions over \(GF(2^n)\): the Niho case”, Inform. and Comput., 151:1-2 (1999), 57-72 · Zbl 1072.94513 · doi:10.1006/inco.1998.2764
[66] Dobbertin H., “Almost perfect nonlinear power functions over \(GF(2^n)\): a new case for \(n\) divisible by 5”, Finite Fields and Applications FQ5, Proc. (Augsburg, Germany, August 2-6, 2000), eds. D. Jungnickel, H. Niederreiter, Springer, 2000, 113-121
[67] Dobbertin H., Leander G., “A survey of some recent results on bent functions”, Sequences and their applications - SETA 2004, Third Int. conference, Revised selected papers (Seoul, Korea, October 24-28, 2004), Lecture Notes in Comput. Sci., 3486, Springer, Berlin, 2005, 1-29 · Zbl 1145.94439 · doi:10.1007/11423461_1
[68] Dobbertin H., Leander G., Cryptographer’s Toolkit for Construction of 8-Bit Bent Functions, Cryptology ePrint Archive, Report 2005/089, available at
[69] Dobbertin H., Leander G., Canteaut A., et al., “Construction of Bent Functions via Niho Power Functions”, J. Combin. Theory. Ser. A, 113:5 (2006), 779-798 · Zbl 1095.94030 · doi:10.1016/j.jcta.2005.07.009
[70] Fuller J. E., Analysis of affine equivalent Boolean functions for cryptography, Ph. D. Thesis, Queensland University of Technology, Brisbane, Australia, 2003; Available at
[71] Fuller J. E., Dawson E., Millan W., “Evolutionary generation of bent functions for cryptography”, The 2003 Congress on Evolutionary Computation, CEC apos;03, V. 3, 2003, 1655-1661 · doi:10.1109/CEC.2003.1299871
[72] Gangopadhyay S., Sharma D., Sarkar S., Maitra S., “On Affine (Non) Equivalence of Bent Functions”, CECC’ 08 - Central European Conference on Cryptography, Proc. (Graz, Austria, July 2-4, 2008), 2008; Available at · Zbl 1170.94011
[73] Grocholewska-Czuryło A., “A study of differences between bent functions constructed using Rothaus method and randomly generated bent functions”, J. Telecommunications and Information Technology, 2003, no. 4, 19-24
[74] Hou X.-D., “Cubic bent functions”, Discrete Mathematics, 189 (1998), 149-161 · Zbl 0949.94003 · doi:10.1016/S0012-365X(98)00008-9
[75] Hou X.-D., Langevin P., “Results on bent functions”, J. Comb. Theory Ser. A, 80 (1997), 232-246 · Zbl 0896.05011 · doi:10.1006/jcta.1997.2804
[76] Hu H., Feng D., “On quadratic bent functions in polynomial forms”, IEEE Trans. Inform. Theory, 53:7 (2007), 2610-2615 · Zbl 1325.94123 · doi:10.1109/TIT.2007.899553
[77] Kantor W. M., “Codes, Quadratic Forms and Finite Geometries”, Proceedings of Symposia in Applied Math., 50 (1995), 153-177 · Zbl 0867.94036 · doi:10.1090/psapm/050/1368640
[78] Kavut S., Maitra S., Yucel M. D., “Search for Boolean functions with excellent profiles in the rotation symmetric class”, IEEE Trans. Inform. Theory, 53:5 (2007), 1743-1751 · Zbl 1287.94130 · doi:10.1109/TIT.2007.894696
[79] Kerdock A. M., “A class of low-rate non-linear binary codes”, Inform. Control, 19:2 (1972), 182-187 · Zbl 0271.94016 · doi:10.1016/S0019-9958(72)90376-2
[80] Khoo K., Gong G., Stinson D. R., “A new family of Gold-like sequences”, ISIT - IEEE Int. Symposium on Information Theory, Proc. (Lausanne, Switzerland, June 30 - July 5, 2002), 2002, 181 · doi:10.1109/ISIT.2002.1023453
[81] Khoo K., Gong G., Stinson D. R., “A new characterization of semi-bent and bent functions on finite fields”, Designs, Codes and Cryptography, 38:2 (2006), 279-295 · Zbl 1172.11311 · doi:10.1007/s10623-005-6345-x
[82] Krotov D. S., Avgustinovich S. V., “On the Number of 1-Perfect Binary Codes: A Lower Bound”, IEEE Trans. Inform. Theory, 54:4 (2008), 1760-1765 · Zbl 1328.94084 · doi:10.1109/TIT.2008.917692
[83] Kumar P. V., Scholtz R. A., Welch L. R., “Generalized bent functions and their properties”, J. Combin. Theory Ser. A, 40:1 (1985), 90-107 · Zbl 0585.94016 · doi:10.1016/0097-3165(85)90049-4
[84] Langevin P., Classification of Boolean Quartics Forms in eight Variables, · Zbl 1202.06009
[85] Langevin P., Leander G., “Monomial bent functions and Stickelberger”s theorem”, Finite Fields and Applications, 1 (2008), 727-742 · Zbl 1159.11052 · doi:10.1016/j.ffa.2007.12.001
[86] Langevin P., Rabizzoni P., Véron P., Zanotti J.-P., “On the number of bent functions with 8 variables”, Second International Conference BFCA - Boolean Functions: Cryptography and Applications, Proc. (Rouen, France, March 13-15, 2006), 2006, 125-135
[87] Leander N. G., “Monomial bent functions”, IEEE Trans. Inform. Theory, 52:2 (2006), 738-743 · Zbl 1161.94414 · doi:10.1109/TIT.2005.862121
[88] Leander N. G., Langevin P., “On exponents with highly divisible Fourier coefficients and conjectures of Niho and Dobbertin”, Algebraic Geometry and its applications, Proc. (France, May 7-11, 2007), 2008, 410-418 · Zbl 1153.94300 · doi:10.1142/9789812793430_0022
[89] Maitra S., Sarkar P., “Maximum Nonlinearity of Symmetric Boolean Functions on Odd Number of Variables”, IEEE Trans. Inform. Theory, 48:9 (2002), 2626-2630 · Zbl 1062.94073 · doi:10.1109/TIT.2002.801482
[90] Matsui M., “Linear cryptanalysis method for DES cipher”, Advances in Cryptology - EUROCRYPT’ 93, Workshop on the theory and application of cryptographic techniques, Proc. (Lofthus, Norway, May 23-27, 1993), Lecture Notes in Comput. Sci., 765, Springer, Berlin, 1994, 386-397 · Zbl 0951.94519 · doi:10.1007/3-540-48285-7_33
[91] McFarland R. L., “A family of difference sets in non-cyclic groups”, J. Combin. Theory Ser. A, 15:1 (1973), 1-10 · Zbl 0268.05011 · doi:10.1016/0097-3165(73)90031-9
[92] Meng Q., Yang M. C., Zhang H., Cui J.-S., A novel algorithm enumerating bent functions, Cryptology ePrint Archive, Report 2004/274, available at · Zbl 1206.05017
[93] Meng Q., Zhang H., Wang Z., “Designing bent functions using evolving computing”, Acta Electronica Sinica, 2004, no. 11, 1901-1903
[94] Millan W., Clark A., Dawson E., “An effective genetic algorithm for finding highly nonlinear Boolean functions”, First Int. conference on Information and Communications Security - ICICS’ 97, Proc. (Beijing, China, November 11-14, 1997), Lecture Notes in Comput. Sci., 1334, Springer-Verlag, 1997, 149-158 · Zbl 0884.94020 · doi:10.1007/BFb0028471
[95] Millan W., Clark A., Dawson E., “Smart hill climbing finds better Boolean functions”, Workshop on Selected Areas in Cryptology, Workshop record, 1997, 50-63
[96] Nyberg K., “Perfect nonlinear S-boxes”, Advances in cryptology - EUROCRYPT’ 91, Int. conference on the theory and application of cryptographic techniques, Proc. (Brighton, UK, April 8-11, 1991), Lecture Notes in Comput. Sci., 547, Springer, Berlin, 1991, 378-386 · Zbl 0766.94012 · doi:10.1007/3-540-46416-6_32
[97] Nyberg K., “Differentially uniform mappings for cryptography”, Advances in cryptology - EUROCRYPT’ 93, Int. conference on the theory and application of cryptographic techniques, Proc. (Lofthus, Norway, May 23-27, 1993), Lecture Notes in Comput. Sci., 765, Springer, Berlin, 1994, 55-64 · Zbl 0951.94510 · doi:10.1007/3-540-48285-7_6
[98] Olejár D., Stanek M., “On cryptographic properties of random Boolean functions”, J. Universal Computer Science, 4:8 (1998), 705-717 · Zbl 0967.68059
[99] Olsen J. D., Scholtz R. A., Welch L. R., “Bent-function sequences”, IEEE Trans. Inform. Theory, 28:6 (1982), 858-864 · Zbl 0492.94019 · doi:10.1109/TIT.1982.1056589
[100] Parker M. G., “The constabent properties of Golay-Davis-Jedwab sequences”, IEEE International Symposium on Information Theory - ISIT’ 2000, Proc. (Sorrento, Italy, June 25-30, 2000), 2000, 302 · doi:10.1109/ISIT.2000.866600
[101] Parker M. G., Pott A., “On Boolean functions which are bent and negabent”, Sequences, Subsequences, and Consequences - SSC 2007, International Workshop, Proc. (Los Angeles, CA, USA, May 31 - June 2, 2007), Lecture Notes in Comput. Sci., 4893, Springer, Berlin, 2007, 9-23 · Zbl 1154.94426 · doi:10.1007/978-3-540-77404-4_2
[102] Paterson K. G., “Sequences For OFDM and Multi-code CDMA: two problems in algebraic Coding Theory”, Sequences and their applications - Seta 2001, Second Int. Conference, Proc. (Bergen, Norway, May 13-17, 2001), Springer, Berlin, 2002, 46-71 · Zbl 1043.94535
[103] Preneel B., Van Leekwijck W., Van Linden L., Govaerts R., Vandevalle J., “Propogation characteristics of Boolean functions”, Advances in cryptology - EUROCRYPT’ 90, Int. conference on the theory and application of cryptographic techniques, Proc. (Aarhus, Denmark, May 21-24, 1990), Lecture Notes in Comput. Sci., 473, Springer, Berlin, 1991, 161-173 · Zbl 0764.94024 · doi:10.1007/3-540-46877-3_14
[104] Preneel B., Analysis and design of cryptographic hash functions, Ph. D. thesis, Katholieke Univ. Leuven, Leuven, Belgium, 1993
[105] Qu C., Seberry J., Pieprzyk J., “Homogeneous bent functions”, Discrete Appl. Math., 102:1-2 (2000), 133-139 · Zbl 1016.94029
[106] Riera C., Parker M. G., “Generalised Bent Criteria for Boolean Functions (I)”, IEEE Trans. Inform. Theory, 52:9 (2006), 4142-4159 · Zbl 1323.94137 · doi:10.1109/TIT.2006.880069
[107] Rodier F., “Asymptotic nonlinearity of Boolean functions”, Designs, Codes and Cryptography, 40:1 (2006), 59-70 · Zbl 1261.94029 · doi:10.1007/s10623-005-6363-8
[108] Rodier F., Private Communication, 2008
[109] Rothaus O., On bent functions, IDA CRD W. P. № 169, 1966 · Zbl 0336.12012
[110] Rothaus O., “On bent functions”, J. Combin. Theory Ser. A, 19:3 (1976), 300-305 · Zbl 0336.12012 · doi:10.1016/0097-3165(76)90024-8
[111] Schmidt K-U., Quaternary Constant-Amplitude Codes for Multicode CDMA, Available at · Zbl 1367.94344
[112] Wang L., Zhang J., “A best possible computable upper bound on bent functions”, J. West of China, 33:2 (2004), 113-115 · Zbl 1086.94023
[113] Yang M., Meng Q., Zhang H., Evolutionary design of trace form bent functions, Cryptology ePrint Archive, Report 2005/322, available at
[114] Youssef A., Gong G., “Hyper-bent functions”, Advances in cryptology - EUROCRYPT’ 2001, Int. conference on the theory and application of cryptographic techniques, Proc. (Innsbruk, Austria, May 6-10, 2001), Lecture Notes in Comput. Sci., 2045, Springer, Berlin, 2001, 406-419 · Zbl 1013.94544 · doi:10.1007/3-540-44987-6_25
[115] Yu N. Y., Gong G., “Constructions of quadratic bent functions in polynomial forms”, IEEE Trans. Inform. Theory, 52:7 (2006), 3291-3299 · Zbl 1297.94113 · doi:10.1109/TIT.2006.876251
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.