[1] Abbe, E., Shpilka, A., and Wigderson, A.. Reed–Muller codes for random erasures and errors. IEEE Transactions on Information Theory 61 (10), pp. 5229–5252, 2015. See page 151.CrossRefGoogle Scholar

[2] Abdukhalikov, K.. Bent functions and line ovals. Finite Fields and Their Applications 47, pp. 94–124, 2017. See pages 220 and 221.Google Scholar

[3] Abdukhalikov, K.. Hyperovals and bent functions. European J. Combin. 79, pp. 123–139, 2019. See page 220.Google Scholar

[4] Abdukhalikov, K. and Mesnager, S.. Explicit constructions of bent functions from pseudo-planar functions. Advances in Mathematics of Communications 11 (2), pp. 293–299, 2017. See page 217.Google Scholar

[5] Abdukhalikov, K. and Mesnager, S.. Bent functions linear on elements of some classical spreads and presemifields spreads. Cryptography and Communications 9 (1), pp. 3–21, 2017. See page 227.Google Scholar

[6] Adams, C. M.. Constructing symmetric ciphers using the cast design procedure. Designs, Codes and Cryptography 12 (3), pp. 283–316, 1997. See page 26.CrossRefGoogle Scholar

[7] Adams, C. M. and Tavares, S. E.. Generating and counting binary bent sequences. IEEE Transactions on Information Theory 36 (5), pp. 1170–1173, 1990. See pages 234 and 293.Google Scholar

[8] Agievich, S.. On the representation of bent functions by bent rectangles. Proceedings of Probabilistic Methods in Discrete Mathematics: Fifth International Conference, pp. 121–135, 2002, and arXiv /0502087, 2005. See pages 237 and 239.CrossRefGoogle Scholar

[9] Agievich, S.. On the affine classification of cubic bent functions. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2005/44, 2005. See page 208.Google Scholar

[10] Agievich, S.. Bent rectangles. NATO Science for Peace and Security Series – D: Information and Communication Security, Vol 18: Boolean Functions in Cryptology and Information Security, IOS Press, pp. 3–22, 2008. See page 239.Google Scholar

[11] Albrecht, M. R., Rechberger, C., , T. Schneider, Tiessen, , and Zohner, M.. Ciphers for MPC and FHE. Proceedings of EUROCRYPT (1) 2015, Lecture Notes in Computer Science 9056, pp. 430–454, 2015. See page 454.Google Scholar

[12] Alon, N., Goldreich, O., Hastad, J., and Peralta, R.. Simple constructions of almost k-wise independent random variables. Random Stuctures and Algorithms 3 (3), pp. 289–304, 1992. See page 105.Google Scholar

[13] Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., and Ron, D.. Testing Reed–Muller codes. IEEE Transactions on Information Theory 51 (11), pp. 4032–4039, 2005. See page 469.Google Scholar

[14] Alon, N. and Spencer, J. H.. The Probabilistic Method. Wiley-VCH, 2000 (second edition). See page 84.Google Scholar

[15] Alsalami, Y.. Constructions with high algebraic degree of differentially 4-uniform (n, n − 1)-functions and differentially 8-uniform (n, n − 2)-functions. Cryptography and Communications 10 (4), pp. 611–628, 2018. See page 424.Google Scholar

[16] Ambrosimov, A. S.. Properties of bent functions of q-valued logic over finite fields. Discrete Mathematics and Applications 4 (4), pp. 341–350, 1994. See page 193.Google Scholar

[17] Anbar, N. and Meidl, W.. Bent and bent₄ spectra of Boolean functions over finite fields. Finite Fields and Their Applications 46, 163–178, 2017. See pages 266 and 268.Google Scholar

[18] Anbar, N. and Meidl, W.. Modified planar functions and their components. Cryptography and Communications 10 (2), pp. 235–249, 2018. See pages 266, 267, 268, and 274.Google Scholar

[19] Anbar, N., Meidl, W., and Topuzoğlu, A.. On the nonlinearity of idempotent quadratic functions and the weight distribution of subcodes of Reed–Muller codes. Proceedings of the 9th International Workshop on Coding and Cryptography 2015 WCC2015, (https://hal.archives-ouvertes.fr/ WCC2015browse/latest-publications), 2015. See page 178.Google Scholar

[20] Anderson, R. J.. Searching for the optimum correlation attack. Proceedings of Fast Software Encryption FSE 1994, Lecture Notes in Computer Science 1008, pp. 137–143, 1994. See page 89.Google Scholar

[21] Applebaum, B.. Pseudorandom generators with long stretch and low locality from random local one-way functions. Proceedings of ACM STOC 2012, pp. 805–816. ACM Press, 2012.Google Scholar

[22] Applebaum, B.. Cryptographic hardness of random local functions-survey. Computational Complexity 25 (3), pp. 667–722, 2013. See page 468.Google Scholar

[23] Applebaum, B. and Lovett, S.. Algebraic attacks against random local functions and their countermeasures. Proceedings of ACM STOC 2016, pp. 1087–1100, 2016. See pages 468 and 469.Google Scholar

[24] Aragona, R., Calderini, M., Maccauro, D., and Sala, M.. On some differential properties of Boolean functions. Applicable Algebra in Engineering, Communication and Computing 27 (5), pp. 359–372, 2016. See pages 373, 383, and 411.CrossRefGoogle Scholar

[25] Armknecht, F.. Improving fast algebraic attacks. Proceedings of Fast Software Encryption FSE 2004, Lecture Notes in Computer Science 3017, pp. 65–82, 2004. See page 94.Google Scholar

[26] Armknecht, F. and Ars, G.. Introducing a new variant of fast algebraic attacks and minimizing their successive data complexity. Proceedings of International Conference on Cryptology in Malaysia Mycrypt 2005, Lecture Notes in Computer Science 3715, pp. 16–32 2005. See page 94.Google Scholar

[27] Armknecht, F., Carlet, C., Gaborit, P., Künzli, S., Meier, W., and Ruatta, O.. Efficient computation of algebraic immunity for algebraic and fast algebraic attacks. Proceedings of EUROCRYPT 2006, Lecture Notes in Computer Science 4004 , pp. 147–164, 2006. See pages 92, 321, 334, 335, 336, and 338.Google Scholar

[28] Armknecht, F. and Krause, M.. Algebraic attacks on combiners with memory. Proceedings of CRYPTO 2003, Lecture Notes in Computer Science 2729, pp. 162–175, 2003. See page 91.Google Scholar

[29] Armknecht, F. and Krause, M.. Constructing single- and multi-output Boolean functions with maximal algebraic immunity. Proceedings of ICALP 2006, Lecture Notes of Computer Science 4052, pp. 180–191, 2006. See pages 127, 128, 344, 345, 346, and 348.Google Scholar

[30] Arnault, F. and Berger, T. P.. Design and properties of a new pseudorandom generator based on a filtered FCSR automaton. IEEE Transactions on Computers 54 (11), pp. 1374–1383, 2005. See page 23.Google Scholar

[31] Arora, S. and Barak, B.. Computational Complexity : A Modern Approach. Cambridge University Press, 2009. See page 19.CrossRefGoogle Scholar

[32] Ars, G. and Faugère, J.-C.. Algebraic immunities of functions over finite fields. Proceedings of the Conference BFCA 2005, Publications des universités de Rouen et du Havre, pp. 21–38, 2005. See pages 127 and 344.Google Scholar

[33] Ashikhmin, A. and Barg, A.. Minimal vectors in linear codes. IEEE Transactions on Information Theory 44 (5), pp. 2010–2017, 1998. See pages 148 and 149.Google Scholar

[34] Assmus, E. F.. On the Reed–Muller codes. Discrete Mathematics 106/107, pp. 25–33, 1992. See page 154.Google Scholar

[35] Assmus, E. F. and Key, J. D.. Designs and Their Codes. Cambridge University Press, 1992.Google Scholar

[36] Assmus, E. F. and Mattson, H. F.. New 5-designs. Journal of Combinatorial Theory, Series A 6 (2), pp. 122–151, 1969. See page 270.Google Scholar

[37] Assmus, E. F. and Mattson, H. F.. The weight-distribution of a coset of a linear code. IEEE Transactions on Information Theory 24 (4), p. 497, 1978. See page 15.Google Scholar

[38] Aubry, Y., Katz, D. J., and Langevin, P.. Cyclotomy of Weil sums of binomials. Journal of Number Theory 154, pp. 160–178, 2015. See page 73.Google Scholar

[39] Aubry, Y. and Langevin, P.. On a conjecture of Helleseth. Proceedings of Algebraic informatics CAI 2013, Lecture Notes in Comput. Science 8080, pp. 113–118, 2013. See page 73.Google Scholar

[40] Aubry, Y., McGuire, G., and Rodier, F.. A few more functions that are not APN infinitely often. Proceedings of Fq9, Contemporary Mathematics 518, 2010. ArXiv0909.2304. See page 404.Google Scholar

[41] Ax, J.. Zeroes of polynomials over finite fields. American Journal on Mathematics 86, pp. 255–261, 1964. See page 156.Google Scholar

[42] Baignères, T., Junod, P., and Vaudenay, S.. How far can we go beyond linear cryptanalysis? Proceedings of ASIACRYPT 2004 , Lecture Notes in Computer Science 3329, pp. 432–450, 2004. See page 191.CrossRefGoogle Scholar

[43] Baker, R. D., Lint, J. H. Van, and Wilson, R. M.. On the Preparata and Goethals codes. IEEE Transactions on Information Theory 29, pp. 342–345, 1983. See page 255.Google Scholar

[44] Balasch, J., Faust, S., and Gierlichs, B.. Inner product masking revisited. Proceedings of EURO-CRYPT 2015, Lecture Notes in Computer Science 9056, pp. 486–510, 2015. See pages 446 and 447.Google Scholar

[45] Balasch, J., Faust, S., Gierlichs, B., Paglialonga, C., and Standaert, F.-X.. Consolidating inner product masking. Proceedings of ASIACRYPT 2017, Lecture Notes in Computer Science 10624, pp. 724–754, 2017. See page 446.Google Scholar

[46] Balasch, J., Faust, S., Gierlichs, B., and Verbauwhede, I.. Theory and practice of a leakage resilient masking scheme. Proceedings of ASIACRYPT 2012, Lecture Notes in Computer Science 7658, pp. 758–775, 2012. See pages 446 and 447.Google Scholar

[47] Barak, B., Kindler, G., Shaltiel, R., Sudakov, B., and Wigderson, A.. Simulating Independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors. Proceedings of ACM STOC 2005, 2005. See page 108.Google Scholar

[48] G. Barthe, S. Belaïd, F. Dupressoir, et al. Strong non-interference and type-directed higher-order masking. Proceedings of ACM CCS 16, ACM Press, pp. 116–129, 2016. See page 430.Google Scholar

[49] Barthe, G., Dupressoir, F., Faust, S., Grégoire, B., Standaert, F.-X., and Strub, P.-Y.. Parallel implementations of masking schemes and the bounded moment leakage model. Proceedings of EUROCRYPT 2017 , Lecture Notes in Computer Science 10210, pp. 535–566, 2017. See page 429.Google Scholar

[50] Bassalygo, L. A., Zaitsev, G. V., and Zinoviev, V. A.. Uniformly packed codes. Problems of Information Transmission 10, No. 1, pp. 9–14, 1974. See page 10.Google Scholar

[51] Bassalygo, L. A. and Zinoviev, V. A.. Remarks on uniformly packed codes. Problems of Information Transmission 13, No 3, pp. 22–25, 1977. See page 10.Google Scholar

[52] Batten, L. M.. Algebraic attacks over GF (q). Proceedings of INDOCRYPT 2004, Lecture Notes in Computer Science 3348, pp. 84–91, 2004. See page 91.Google Scholar

[53] Beelen, P. and Leander, G.. A new construction of highly nonlinear S-boxes. Cryptography and Communications 4(1), pp. 65–77, 2012. See pages 122 and 160.Google Scholar

[54] Belaïd, S., Benhamouda, F., Passelègue, A., Prouff, E., Thillard, A., and Vergnaud, D.. Private multiplication over finite fields. Proceedings of CRYPTO 2017, Lecture Notes in Computer Science 10403, pp. 397–426, 2017. See page 431.Google Scholar

[55] Belaïd, S., Goudarzi, D., and Rivain, M.. Tight private circuits: achieving probing security with the least refreshing. Proceedings of ASIACRYPT 2018, Lecture Notes in Computer Science 11273, pp. 343–372, 2018. See page 430.Google Scholar

[56] Bending, T. D.. Bent functions, SDP designs and their automorphism groups. Ph.D. thesis, Queen Mary and Westfield College, 1993. See page 192.Google Scholar

[57] Bending, T. and Fon-Der-Flaass, D.. Crooked functions, bent functions and distance regular graphs. Electron. J. Comb. 5, Research paper 34 (electronic), 14 pages, 1998. See pages 231, 278, 279/fpage>, and 373.Google Scholar

[58] Bennett, C. H., Brassard, G., and Robert, J. M.. Privacy amplification by public discussion. SIAM Journal on Computing 17, pp. 210–229, 1988. See pages 129, 292, and 314.Google Scholar

[59] Ben-Or, M., Goldwasser, S., and Wigderson, A.. Completeness theorems for non- cryptographic fault-tolerant distributed computation. Proceedings of ACM STOC 1988, pp. 1–10, 1988. See page 436.Google Scholar

[60] Berbain, C., Billet, O., Canteaut, A., et al.. Decim v2. New Stream Cipher Designs – The eSTREAM Finalists, Lecture Notes in. Computer Science 4986, pp. 140–151, 2008. See page 318.Google Scholar

[61] Berbain, C., Gilbert, H., and Patarin, J.. QUAD: a practical stream cipher with provable security. Proceedings of EUROCRYPT 2006, Lecture Notes in Computer Science 4004, pp 109–128, 2006. See page 4.Google Scholar

[62] Berger, T., Canteaut, A., Charpin, P., and Laigle-Chapuy, Y.. On almost perfect nonlinear functions. IEEE Transactions on Information Theory 52 (9), pp. 4160–4170, 2006. See pages 385, 386, 391, and 411.Google Scholar

[63] Berlekamp, E., Algebraic Coding Theory, McGraw-Hill, 1968. See page 4.Google Scholar

[64] Berlekamp, E. R., Rumsey, H., and Solomon, G.. On the solution of algebraic equations over finite fields. Information and Control 10, pp. 553–564, 1967. See page 495.Google Scholar

[65] Berlekamp, E. R. and Sloane, N. J. A.. Restrictions on the weight distributions of the Reed–Muller codes. Information and Control 14, pp. 442–446, 1969. See page 157.Google Scholar

[66] Berlekamp, E. R. and Welch, L. R.. Weight distributions of the cosets of the (32,6) Reed–Muller code. IEEE Transactions on Information Theory, 18 (1), pp. 203–207, 1972. See pages 143 and 156.Google Scholar

[67] Berman, S. D.. On the theory of group codes. Kibernetica 1 (1), pp. 31–39, 1967. See page 152.Google Scholar

[68] Bernasconi, A. and Codenotti, B.. Spectral analysis of Boolean functions as a graph eigenvalue problem. IEEE Transactions on Computers 48 (3), pp. 345–351, 1999. See pages 70 and 193.Google Scholar

[69] Bernasconi, A., Codenotti, B., and Vanderkam, J. M.. A characterization of bent functions in terms of strongly regular graphs. IEEE Transactions on Computers 50 (9), pp. 984–985, 2001. See page 70.Google Scholar

[70] Bernstein, D. J.. Post-quantum cryptography. Encyclopedia of Cryptography and Security, pp. 949–950, 2011. See page 1.Google Scholar

[71] Beth, T. and Ding, C.. On almost perfect nonlinear permutations. Proceedings of EUROCRYPT 93, Lecture Notes in Computer Science 765, pp. 65–76, 1994. See pages 137, 373, 374, and 400.Google Scholar

[72] Bey, C. and Kyureghyan, G. M.. On Boolean functions with the sum of every two of them being bent. Designs, Codes and Cryptography 49, pp. 341–346, 2008. See page 255.Google Scholar

[73] Beyne, T. and Bilgin, B.. Uniform first-order threshold implementations. Proceedings of SAC 2016, Lecture Notes in Computer Science 10532, pp. 79–98, 2016. See page 441.Google Scholar

[74] Bhasin, S., Carlet, C., and Guilley, S.. Theory of masking with codewords in hardware: low-weight dth-order correlation-immune Boolean functions. IACR Cryptology ePrint Archive (http://eprint .iacr.org/) 2013/303, 2013. See pages 144, 304, 306, and 433.Google Scholar

[75] Bhasin, S., Danger, J.-L., Guilley, S., Najm, Z., and Ngo, X. T.. Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses. IEEE International Symposium on Hardware Oriented Security and Trust (HOST), May 5–7, 2015. See page 446.Google Scholar

[76] Bhattacharyya, A., Kopparty, S., Shoenebeck, G., Sudan, M., and Zuckerman, D.. Optimal testing of Reed–Muller codes. Proceedings of Electronic Colloquium on Computational Complexity,report no. 86, 2009.Google Scholar

[77] Bierbrauer, J.. New semifields, PN and APN functions. Designs, Codes and Cryptography 54, pp. 189–200, 2010. See page 394.Google Scholar

[78] Bierbrauer, J., Gopalakrishnan, K., and Stinson, D. R.. Bounds for resilient functions and orthogonal arrays. Proceedings of CRYPTO 1994, Lecture Notes in Computer Science 839, pp. 247–256, 1994. See pages 313 and 357.Google Scholar

[79] Bierbrauer, J., Gopalakrishnan, K., and Stinson, D. R.. Orthogonal arrays, resilient functions, error-correcting codes, and linear programming bounds. SIAM Journal on Discrete Mathematics 9 (3), pp. 424–452, 1996. See page 129.Google Scholar

[80] Bierbrauer, J. and Kyureghyan, G.. Crooked binomials. Designs Codes Cryptography 46(3), pp. 269–301, 2008. See pages 278, 373, and 393.Google Scholar

[81] Biere, A. Heule, M. Maaren, H. van, and Walsh, T., eds. Handbook of Satisfiability. IOS Press, 2009. See page 19.Google Scholar

[82] Biham, E. and Shamir, A.. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology 4 (1), pp. 3–72, 1991. See pages 134 and 447.Google Scholar

[83] Biham, E. and Shamir, A.. Differential fault analysis of secret key cryptosystems. Proceedings of CRYPTO 1997, Lecture Notes in Computer Science 1294, 1997, pp. 513–525. See page 427.Google Scholar

[84] Bilgin, B., Bogdanov, A., Knezevic, M., Mendel, F., and Wang, Q.. Fides: lightweight authenticated cipher with side-channel resistance for constrained hardware. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2013, Lecture Notes in Computer Science 8086, pp. 142–158, 2013. See page 411.Google Scholar

[85] Bilgin, B., Gierlichs, B., Nikova, S., Nikov, V., and Rijmen, V.. Higher-order threshold implementations. Proceedings of ASIACRYPT 2014, Lecture Notes in Computer Science 8874, pp. 326–343, 2014. See page 437.Google Scholar

[86] Bilgin, B., Nikova, S., Nikov, V., Rijmen, V., and Stütz, G.. Threshold implementations of all 3×3 and 4 × 4 S-boxes. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2012, Lecture Notes in Computer Science 7428, pp. 76–91, 2012. See pages 440, 441, 442, 443, and 502.Google Scholar

[87] Bilgin, B., Nikova, S., Nikov, V., Rijmen, V., Tokareva, N. N., and Vitkup, V.. Threshold implementations of small S-boxes. Cryptography and Communications 7(1), pp. 3–33, 2015 (extended version of). See pages 440, 441, and 442.Google Scholar

[88] Biryukov, A. and Cannière, C. De.Data Encryption Standard (DES). Encyclopedia of cryptography and security; Editors: , H. C. A. van Tilborg, , Jajodia, S., pp. 295–301, 2011. See page 25.CrossRefGoogle Scholar

[89] Biryukov, A. and Wagner, D.. Slide attacks. Proceedings of Fast Software Encryption FSE 1999, Lecture Notes in Computer Science 1636, pp. 245–259, 1999. See page 142.Google Scholar

[90] Blakely, G.. Safeguarding cryptographic keys. National Comp. Conf. 48, pp. 313–317, New York, June 1979. AFIPS Press. See page 145.Google Scholar

[91] Blömer, J. and Seifert, J.-P.. Fault based cryptanalysis of the Advanced Encryption Standard (AES). Proceedings of Financial Cryptography, Lecture Notes in Computer Science 2742, pp. 162–181, 2003. See page 427.Google Scholar

[92] Blondeau, C., Canteaut, A., and Charpin, P.. Differential properties of power functions. International Journal of Information and Coding Theory 1 (2), pp. 149–170, 2010. See also the Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT), pp. 2478–2482, 2010. See page 418.Google Scholar

[93] Blondeau, C., Canteaut, A., and Charpin, P.. Differential properties of x ↦→ x^{2t −1} . IEEE Transactions on Information Theory 57 (12), pp. 8127–8137, 2011. See pages 401 and 422.Google Scholar

[94] Blondeau, C. and Nyberg, K.. Perfect nonlinear functions and cryptography. Finite Fields and Their Applications 32, pp. 120–147, 2015. See pages 369 and 373.Google Scholar

[95] Blondeau, C. and Perrin, L.. More differentially 6-uniform power functions. Designs, Codes and Cryptography 73(2), pp. 487–505, 2014. See page 422.Google Scholar

[96] Bluher, A. W.. On x^q+1 + ax + b. Finite Fields and Their Applications 10(3), pp. 285–305, 2004. See page 495.Google Scholar

[97] Bluher, A. W.. On existence of Budaghyan–Carlet APN hexanomials. Finite Fields and Their Applications 24, pp. 118–123, 2013. See pages 408 and 409.Google Scholar

[98] Blum, L., Blum, M., and Shub, M.. A simple unpredictable pseudo-random number generator. SIAM Journal on Computing 15 (2), pp. 364–383, 1986. See page 4.Google Scholar

[99] Blum, A., Kalai, A., and Wasserman, H.. Noise-tolerant learning, the parity problem, and the statistical query model. Journal ACM 50(4), pp. 506–519, 2003. See page 466.CrossRefGoogle Scholar

[100] Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J., Seurin, Y., and Vikkelsoe, C.. PRESENT: An ultra-lightweight block cipher. Proceedings of 9th International Workshop Cryptographic Hardware and Embedded Systems CHES 2007, Lecture Notes in Computer Science 4727, pp. 450–466, 2007. See page 26.Google Scholar

[101] Borissov, Y., Braeken, A., Nikova, S., and Preneel, B.. On the covering radii of binary Reed–Muller codes in the set of resilient Boolean functions. IEEE Transactions on Information Theory 51 (3), pp. 1182–1189, 2005. See page 287.Google Scholar

[102] Borissov, Y., Braeken, A., Nikova, S., and Preneel, B.. Classification of the cosets of RM(1, 7) in RM(3, 7) revisited. NATO Science for Peace and Security Series – D: Information and Communication Security, Vol 18: Boolean Functions in Cryptology and Information Security, IOS Press, pp. 58–72, 2008. See page 144.Google Scholar

[103] Borissov, Y., Manev, N., and Nikova, S.. On the non-minimal codewords of weight 2d_min in the binary Reed–Muller code. Proceedings of the Workshop on Coding and Cryptography 2001, Electronic Notes in Discrete Mathematics, Elsevier, vol. 6, pp. 103–110, 2001. Revised version in Discrete Applied Mathematics 128 (Special Issue “Int. Workshop on Coding and Cryptography (2001)”), pp. 65–74, 2003. See page 148.Google Scholar

[104] Borissov, Y., Manev, N., and Nikova, S.. On the non-minimal codewords in binary Reed–Muller codes. Discrete Applied Mathematics 128, pp. 65–74, 2003. See page 148.CrossRefGoogle Scholar

[105] Boss, E., Grosso, V., Güneysu, T., Leander, G., and Moradi, A., and Tobias Schneider. Strong 8-bit Sboxes with efficient masking in hardware extended version. Journal of Cryptographic Engineering JCEN 7 (2), pp. 149–165, 2017 and IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2016/647. See page 442.CrossRefGoogle Scholar

[106] Boura, C. and Canteaut, A.. On the influence of the algebraic degree of F⁻¹ on the algebraic degree of G ◦ F . IEEE Transactions on Information Theory 59 (1), pp. 691–702, 2013. See pages 40, 41, 114, and 115.Google Scholar

[107] Boura, C. and Canteaut, A.. On the boomerang uniformity of cryptographic Sboxes. IACR Transactions on Symmetric Cryptology 2018 (3), pp. 290–310, 2018. See pages 141 and 142.CrossRefGoogle Scholar

[108] Boura, C., Canteaut, A., and Cannière, C.. Higher-order differential properties of Keccak and Luffa. Proceedings of Fast Software Encryption FSE 2011, Lecture Notes in Computer Science 6733, pp. 252–269, 2011. See page 115.Google Scholar

[109] Boura, C., Canteaut, A., Jean, J., and Suder, V.. Two notions of Differential equivalence on Sboxes. Designs, Codes and Cryptography 87 (2–3), pp. 185–202, 2019 and IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/617. See page 376.Google Scholar

[110] Bourgain, J.. On the construction of affine extractors. Geometric & Functional Analysis GAFA 17 (1), pp. 33–57, 2007. See page 105.Google Scholar

[111] Boyar, J. and Find, M. G.. Constructive relationships between algebraic thickness and normality. Proceedings of International Symposium on Fundamentals of Computation Theory, pp. 106–117, 2015. See page 109.Google Scholar

[112] Boyvalenkov, P., Marinova, T., and Stoyanovac, M.. Nonexistence of a few binary orthogonal arrays. Discrete Applied Mathematics 217, Part 2, pp. 144–150, 2017. See page 305.Google Scholar

[113] Bozilov, D., Bilgin, B., and Sahin, H.. A note on 5-bit quadratic permutations classification. IACR Transactions on Symmetric Cryptology 2017 1, pp. 398–404, 2017. See page 442.Google Scholar

[114] Bracken, C., Byrne, E., Markin, N., and McGuire, G.. On the Walsh spectrum of a new APN function. Proceedings of IMA Conference on Cryptography and Coding 2007 , Lecture Notes in Computer Science 4887, pp. 92–98, 2007. See page 406.Google Scholar

[115] Bracken, C., Byrne, E., Markin, N., and McGuire, G.. Determining the nonlinearity of a new family of APN functions. Proceedings of AAECC-17 Conference, Lecture Notes in Computer Science 4851, pp. 72–79, 2007. See page 422.Google Scholar

[116] Bracken, C., Byrne, E., Markin, N., and McGuire, G.. New families of quadratic almost perfect nonlinear trinomials and multinomials. Finite Fields and Their Applications 14, pp. 703–714, 2008. See pages 231, 398, 406, and 407.Google Scholar

[117] Bracken, C., Byrne, E., Markin, N., and McGuire, G.. On the Fourier spectrum of binomial APN functions. SIAM Journal on Discrete Mathematics 23 (2), pp. 596–608, 2009. See pages 398 and 412.Google Scholar

[118] Bracken, C., Byrne, E., Markin, N., and McGuire, G.. A few more quadratic APN functions. Cryptography and Communications 3 (1), pp. 43–53, 2011. See pages 398, 405, and 406.Google Scholar

[119] Bracken, C., Byrne, E., McGuire, G., and Nebe, G.. On the equivalence of quadratic APN functions. Designs, Codes and Cryptography 61 (3), pp. 261–272, 2011. See page 30.Google Scholar

[120] Bracken, C. and Leander, G.. A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree. Finite Fields and Their Applications 16(4), pp. 231–242, 2010. See pages 418 and 422.Google Scholar

[121] Bracken, C., Tan, C., and Tan, Y.. Binomial differentially 4 uniform permutations with high nonlinearity. Finite Fields and Their Applications 18(3), pp. 537–546, 2012. See page 418.Google Scholar

[122] Bracken, C., Tan, C. H., and Tan, Y.. On a class of quadratic polynomials with no zeros and its application to APN functions. Finite Fields and Their Applications 25, pp. 26–36, 2014. See pages 408 and 409.Google Scholar

[123] Bracken, C. and Zha, Z.. On the Fourier spectra of the infinite families of quadratic APN functions. Advances in Mathematics of Communications 3 (3), pp. 219–226, 2009. See pages 406 and 412.Google Scholar

[124] Braeken, A., Borisov, Y., Nikova, S., and Preneel, B.. Classification of Boolean functions of 6 variables or less with respect to cryptographic properties. Proceedings of ICALP 2005 , Lecture Notes in Computer Science 3580, pp. 324–334, 2005. See pages 143 and 208.Google Scholar

[125] Braeken, A., Borisov, Y., Nikova, S., and Preneel, B.. Classification of cubic (n − 4)-resilient boolean functions. IEEE Transactions on Information Theory 52 (4), pp. 1670–1676, 2006. See page 312.Google Scholar

[126] Braeken, A., Nikov, V., Nikova, S., and Preneel, B..On Boolean functions with generalized cryptographic properties.Proceedings of INDOCRYPT 2004 , Lecture Notes in Computer Science 3348, pp. 120–135, 2004. See page 290.Google Scholar

[127] Braeken, A. and Preneel, B.. On the algebraic immunity of symmetric Boolean functions. Proceedings of Indocrypt 2005 , Lecture Notes in Computer Science 3797, pp. 35–48, 2005. Some false results of this reference are corrected in Braeken’s PhD thesis “Cryptographic properties of Boolean functions and S-boxes.” See pages 335, 336, and 358.Google Scholar

[128] Braeken, A. and Preneel, B.. Probabilistic algebraic attacks. Proceedings of IMA Conference on Cryptography and Coding 2005 , Lecture Notes in Computer Science 3796, pp. 290–303, 2005. See page 324.Google Scholar

[129] Brandstätter, N., Lange, T., and Winterhof, A..On the non-linearity and sparsity of Boolean functions related to the discrete logarithm in finite fields of characteristic two. Proceedings of International Workshop on Coding and Cryptography WCC 2005 , Lecture Notes in Computer Science 3969, pp. 135–143, 2006. See page 338.Google Scholar

[130] Brier, E. and Langevin, P..Classification of cubic Boolean functions of 9 variables. Proceedings of the IEEE Information Theory Workshop ITW 2003, Paris, France, 2003. See page 155.Google Scholar

[131] Bringer, J., Carlet, C., Chabanne, H., Guilley, S., and Maghrebi, H.. Orthogonal direct sum masking – a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. Proceedings of WISTP, Springer, Heraklion, 2014, 40–56. See pages 444, 445, and 446.Google Scholar

[132] Bringer, J., Chabanne, H., and Le, T. Ha. Protecting AES against side-channel analysis using wire-tap codes. Journal of Cryptographic Engineering JCEN 2 (2), pp. 129–141, 2012. See page 431.Google Scholar

[133] Bringer, J., Gillot, V., and Langevin, P.. Exponential sums and Boolean functions. Proceedings of the Conference BFCA 2005, Publications des universités de Rouen et du Havre, pp. 177–185, 2005. See page 81.Google Scholar

[134] Brinkmann, M. and Leander, G.. On the classification of APN functions up to dimension five. Designs, Codes and Cryptography 49, Issue 1–3, pp. 273–288, 2008. Revised and extended version of a paper with the same title in the Proceedings of the Workshop on Coding and Cryptography WCC 2007, pp. 39–48, 2007 See pages 138, 144, 399, 402, and 408.Google Scholar

[135] Browning, K., Dillon, J. F., Kibler, R. E., and McQuistan, M.. APN polynomials and related codes. Special Volume of Journal of Combinatorics, Information and System Sciences, Honoring the 75-th Birthday of Prof. D.K. Ray-Chaudhuri 34, Issue 1–4, pp. 135–159, 2009. See pages 144, 379, 380, 392, 399, 403, 404, and 411.Google Scholar

[136] Browning, K., Dillon, J. F., McQuistan, M., and Wolfe, A. J.. An APN permutation in dimension 6. Proceedings of Conference Finite Fields and Applications Fq9, Contemporary Mathematics 518, pp. 33–42, 2009. See pages 10, 399, 411, 417, and 478.CrossRefGoogle Scholar

[137] Brualdi, R. A., Cai, N., and Pless, V. S.. Orphans of the first order Reed–Muller codes. IEEE Transactions on Information Theory 36, pp. 399–401, 1990. See page 262.Google Scholar

[138] Brüer, J. O.. On pseudorandom sequences as crypto generators. Proceedings of International Zurich Seminar on Digital Communications, pp. 157–161, 1984. See page 356.Google Scholar

[139] Budaghyan, L.. The equivalence of almost bent and almost perfect nonlinear functions and their generalizations. PhD thesis. Otto-von-Guericke-University, 2005.Google Scholar

[140] Budaghyan, L.. The simplest method for constructing APN polynomials EA-inequivalent to power functions. Proceedings of the International Workshop on the Arithmetic of Finite Fields, WAIFI 2007, Lecture Notes in Computer Science 4547, pp. 177–188, 2007. See page 397.Google Scholar

[141] Budaghyan, L.. Construction and Analysis of Cryptographic Functions. Springer, 2014. See page 369.Google Scholar

[142] Budaghyan, L., Calderini, M., Carlet, C., Coulter, R. S. and Villa, I.. Constructing APN Functions through isotopic shifts. To appear in IEEE Transactions on Information Theory. See also “On isotopic construction of APN functions”, IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/769, 2018. Presented at SETA 2018. See pages 398 and 407.Google Scholar

[143] Budaghyan, L., Calderini, M., Carlet, C., Coulter, R. S., and Villa, I..Generalized isotopic shift of Gold functions. Proceedings of International Workshop on Coding and Cryptography WCC 2019, 2019. See page 399.Google Scholar

[144] Budaghyan, L., Calderini, M., Carlet, C., and Kaleyski, N.. On a relationship between Gold and Kasami functions and its generalization for other power APN functions. Boolean Functions and Application, Florence, Italy, June 16–21, 2019. See page 395.Google Scholar

[145] Budaghyan, L., Calderini, M., and Villa, I.. On relations between CCZ- and EA-equivalences. Cryptography and Communications 12 (1), pp. 85–100, 2020 See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/796, 2018. See pages 397 and 478.Google Scholar

[146] Budaghyan, L., Calderini, M. and Villa, I.. On equivalence between known families of quadratic APN functions. To appear in Finite Fields and Their Applications. also, See “On equivalence between some families of APN functions”, Proceedings of International Workshop on Coding and Cryptography WCC 2019. See pages 406, 408, and 409.Google Scholar

[147] Budaghyan, L. and Carlet, C.. Classes of quadratic APN trinomials and hexanomials and related structures. IEEE Transactions on Information Theory 54 (5), pp. 2354–2357, 2008. See pages 393, 407, and 408.Google Scholar

[148] Budaghyan, L. and Carlet, C..On CCZ-equivalence and its use in secondary constructions of bent functions. Proceedings of International Workshop on Coding and Cryptography WCC 2009 and IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2009/42, 2009. See pages 30 and 269.Google Scholar

[149] Budaghyan, L. and Carlet, C.. CCZ-equivalence of single and multi output Boolean functions. AMS Contemporary Math. 518, Post-Proceedings of the Conference Fq9, pp. 43–54, 2010. See pages 29, 30, and 192.Google Scholar

[150] Budaghyan, L. and Carlet, C.. CCZ-equivalence of bent vectorial functions and related constructions. Designs, Codes and Cryptography 59(1–3), pp. 69–87, 2011. See pages 30, 192, 231, 269, and 272.Google Scholar

[151] Budaghyan, L., Carlet, C., Felke, P., and Leander, G..An infinite class of quadratic APN functions which are not equivalent to power functions. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2006, 2006. See pages 373, 393, 397, 398, and 506.Google Scholar

[152] Budaghyan, L., Carlet, C., and Helleseth, T.. On bent functions associated to AB functions. Proceedings of the IEEE Information Theory Workshop ITW 2011, 2011. See pages 228 and 376.Google Scholar

[153] Budaghyan, L., Carlet, C., Helleseth, T., and Kaleyski, N.. Changing values in APN functions. To appear in IEEE Transactions on Information Theory. See also Changing points in APN functions. ACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/1217. Preprint, 2019. See pages 373 and 403.Google Scholar

[154] Budaghyan, L., Carlet, C., Helleseth, T., and Kholosha, A.. On o-equivalence of Niho bent functions. Proceedings of International Workshop on the Arithmetic of Finite Fields pp. 155–168, 2014. See pages 219 and 220.Google Scholar

[155] Budaghyan, L., Carlet, C., Helleseth, T., Kholosha, A., and Mesnager, S.. Further results on Niho bent functions. IEEE Transactions on Information Theory 58, No. 11, pp. 6979–6985, 2012. See page 222.Google Scholar

[156] Budaghyan, L., Carlet, C., Helleseth, T., Li, N., and Sun, B.. On upper bounds for algebraic degrees of APN functions. IEEE Transactions on Information Theory 64 (6), pp. 4399–4411, 2018. See page 373.Google Scholar

[157] Budaghyan, L., Carlet, C., and Leander, G.. Another class of quadratic APN binomials over F ₂ ⁿ: the case n divisible by 4. Proceedings of the Workshop on Coding and Cryptography, WCC 2007, pp. 49–58, 2007. See pages 393, 405, and 506.Google Scholar

[158] Budaghyan, L., Carlet, C., and Leander, G.. Two classes of quadratic APN binomials inequivalent to power functions. IEEE Transactions on Information Theory 54 (9), pp. 4218–4229, 2008. This paper is a completed and merged version of [151] and [157]. See pages 373, 393, 396, 397, 398, 403, 405, 407, and 496.Google Scholar

[159] Budaghyan, L., Carlet, C., and Leander, G.. On inequivalence between known power APN functions. Proceedings of the conference BFCA 2008, 2008. See pages 396, 402, and 403.Google Scholar

[160] Budaghyan, L., Carlet, C., and Leander, G.. Constructing new APN functions from known ones. Finite Fields and Their Applications 15, pp. 150–159, 2009. See pages 393,398, 403, 406, and 407.Google Scholar

[161] Budaghyan, L., Carlet, C., and Leander, G.. On a construction of quadratic APN functions. Proceedings of the IEEE Information Theory Workshop ITW 2009, pp. 374–378, 2009. See pages 398, 406, and 407.Google Scholar

[162] Budaghyan, L., Carlet, C., and Pott, A.. New classes of almost bent and almost perfect nonlinear polynomials. Proceedings of the Workshop on Coding and Cryptography 2005, pp. 306–315, 2005. See pages 29, 36, 138, 396, 397, 404, 405, and 506.Google Scholar

[163] Budaghyan, L., Carlet, C., and Pott, A.. New classes of almost bent and almost perfect nonlinear functions. IEEE Transactions on Information Theory 52 (3), pp. 1141–1152, 2006. This is a completed version of . See pages 28, 29, 36, 138, 272, 396, 397, 404, and 405.Google Scholar

[164] Budaghyan, L. and Helleseth, T.. New commutative semifields defined by new PN multinomials. Cryptography and Communications 3 (1), pp. 1–16, 2011. See page 30.Google Scholar

[165] Budaghyan, L., Helleseth, T. and Kaleyski, N.. A new family of APN quadrinomials. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2019/994 See pages 407 and 410.Google Scholar

[166] Budaghyan, L., Helleseth, T., Li, N., and Sun, B.. Some results on the known classes of quadratic APN functions. Proceedings of C2SI 2017, Lecture Notes in Computer Science 10194, pp. 3–16, 2017. See pages 406 and 408.Google Scholar

[167] Budaghyan, L., Kaleyski, N., Kwon, S., Riera, C., and Stănică, P.. Partially APN Boolean functions and classes of functions that are not APN infinitely often. To appear in the Special Issue on Boolean Functions and Their Applications 2018, Cryptography and Communications. See page 373.Google Scholar

[168] Budaghyan, L., Kholosha, A., Carlet, C., and Helleseth, T.. Univariate Niho bent functions from o-polynomials. IEEE Transactions on Information Theory 62 (4), pp. 2254–2265, 2016. Extended version of “Niho Bent functions from quadratic o-monomials.” Proceedings of IEEE International Symposium on Information Theory (ISIT) 2014, pp. 1827–1831, 2014. See pages 220 and 222.Google Scholar

[169] Budaghyan, L. and Pott, A.. On differential uniformity and nonlinearity of functions. Discrete Mathematics, Special Issue”Combinatorics 2006” 309 (2), pp. 371–384, 2009.Google Scholar

[170] Burnett, L., Carter, G., Dawson, E., and Millan, W.. Efficient methods for generating MARS-like S-boxes. Proceedings of Fast Software Encryption FSE 2000 , Lecture Notes in Computer Science 1978, pp. 300–314, 2000. See page 145.Google Scholar

[171] Burnside, W.. Theory of Groups of Finite Order. Cambridge University Press, 1897. See page 144.Google Scholar

[172] Byrne, E. and McGuire, G.. On the non-existence of crooked functions on finite fields. Proceedings of the Workshop on Coding and Cryptography, WCC 2005, pp. 316–324, 2005. See page 373.Google Scholar

[173] Cai, J., Green, F., and Thierauf, T.. On the correlation of symmetric functions. Math. Systems Theory 29, pp. 245–258, 1996. See page 354.Google Scholar

[174] Calderbank, A. R., McGuire, G., Poonen, B., and Rubinstein, M.. On a conjecture of Helleseth regarding pairs of binary m-sequences. IEEE Transactions on Information Theory 42, pp. 988–990, 1996. See pages 73, 275, and 384.Google Scholar

[175] Calderbank, A. R. and Kantor, W. M.. The geometry of two-weight codes. Bull. Lond. Math. Soc. 18 (2), pp. 97–122, 1986.Google Scholar

[176] Calderini, M., Sala, M., and Villa, I.. A note on APN permutations in even dimension. Finite Fields and Their Applications 46, pp. 1–16, 2017. See page 411.Google Scholar

[177] Cameron, P. J. and Lint, J. H.. Designs, Graphs, Codes and Their Links. Cambridge University Press, 1991. See page 254.Google Scholar

[178] Camion, P. and Canteaut, A.. Construction of t-resilient functions over a finite alphabet. Proceedings of EUROCRYPT 1996, Lecture Notes in Computer Sciences 1070, pp. 283–293, 1996. See page 284.Google Scholar

[179] Camion, P. and Canteaut, A.. Generalization of Siegenthaler inequality and Schnorr–Vaudenay multipermutations. Proceedings of CRYPTO 1996, Lecture Notes in Computer Science 1109, pp. 372–386, 1996. See page 129.Google Scholar

[180] Camion, P. and Canteaut, A.. Correlation-immune and resilient functions over finite alphabets and their applications in cryptography. Designs, Codes and Cryptography 16, 1999. See pages 314 and 317.Google Scholar

[181] Camion, P., Carlet, C., Charpin, P., and Sendrier, N.. On correlation-immune functions. Proceedings of CRYPTO 1991, Lecture Notes in Computer Science 576, pp. 86–100, 1991. See pages 86, 165, 210, 284, 293, 298, 312, and 314.Google Scholar

[182] Canfield, E. R., Gao, Z., Greenhill, C., McKay, B. D., and Robinson, R. W.. Asymptotic enumeration of correlation-immune boolean functions. Cryptography and Communications 2 (1), pp. 111–126, 2010. See page 312.Google Scholar

[183] Cannière, C. De. Analysis and design of symmetric encryption algorithms. PhD thesis, KU Leuven, 2007. See pages 144 and 417.Google Scholar

[184] Canteaut, A.. Differential cryptanalysis of Feistel ciphers and differentially uniform mappings. Proceedings of Selected Areas on Cryptography, SAC 1997, pp. 172–184, 1997. See page 411.Google Scholar

[185] Canteaut, A.. On the weight distributions of optimal cosets of the first-order Reed–Muller code. IEEE Transactions on Information Theory, 47(1), pp. 407–413, 2001. See page 157.Google Scholar

[186] Canteaut, A.. Cryptographic functions and design criteria for block ciphers. Proceedings of INDOCRYPT 2001, Lecture Notes in Computer Science 2247, pp. 1–16, 2001. See page 382.Google Scholar

[187] Canteaut, A.. On the correlations between a combining function and functions of fewer variables. Proceedings of the IEEE Information Theory Workshop ITW 2002 pp. 78–81, 2002. See pages 87, 102, 290, and 319.Google Scholar

[188] Canteaut, A.. Open problems related to algebraic attacks on stream ciphers. Proceedings of Workshop on Coding and Cryptography WCC 2005, pp. 1–10, 2005. See also a revised version in Lecture Notes in Computer Science 3969, pp. 120–134, 2006. See pages 96 and 328.Google Scholar

[189] Canteaut, A.. Analysis and design of symmetric ciphers. Habilitation for Directing Theses, University of Paris 6, 2006. See pages 89, 194, 344, and 386.Google Scholar

[190] Canteaut, A., Carlet, C., Charpin, P., and Fontaine, C.. Propagation characteristics and correlation-immunity of highly nonlinear Boolean functions. Proceedings of EUROCRYPT 2000, Lecture Notes in Computer Science 187, pp. 507–522, 2000. See pages 58, 100, and 192.Google Scholar

[191] Canteaut, A., Carlet, C., Charpin, P., and Fontaine, C.. On cryptographic properties of the cosets of R(1, m). IEEE Transactions on Information Theory 47 (4), pp. 1494–1513, 2001. See pages 58, 62, 98, 106, 153, 192, 232, 240, 241, 259, 262, and 263.Google Scholar

[192] Canteaut, A., Carpov, S., Fontaine, C., Lepoint, T., Naya-Plasencia, M., Paillier, P., and Sirdey, R.. Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. Proceedings of Fast Software Encryption FSE 2016, Lecture Notes in Computer Science 9783, pp. 313–333, 2016. See page 454.Google Scholar

[193] Canteaut, A. and Charpin, P.. Decomposing bent functions. IEEE Transactions on Information Theory 49, pp. 2004–2019, 2003. See pages 100, 198, 203, 208, and 241.Google Scholar

[194] Canteaut, A., Charpin, P., and Dobbertin, H.. A new characterization of almost bent functions. Proceedings of Fast Software Encryption 99, Lecture Notes in Computer Science 1636, pp. 186–200, 1999. See pages 73, 276, and 382.Google Scholar

[195] Canteaut, A., Charpin, P., and Dobbertin, H.. Binary m-sequences with three-valued crosscorrelation: a proof of Welch’s conjecture. IEEE Transactions on Information Theory 46 (1), pp. 4–8, 2000. See pages 382, 388, and 395.Google Scholar

[196] Canteaut, A., Charpin, P., and Dobbertin, H.. Weight divisibility of cyclic codes, highly nonlinear functions on GF(2^m) and crosscorrelation of maximum-length sequences. SIAM Journal on Discrete Mathematics, 13(1), pp. 105–138, 2000. See pages 73, 276, 382, 395, 401, 402, and 412.Google Scholar

[197] Canteaut, A., Charpin, P., and Kyureghyan, G.. A new class of monomial bent functions. Finite Fields and Their Applications 14(1), pp. 221–241, 2008. See page 230.Google Scholar

[198] Canteaut, A., Daum, M., Dobbertin, H., and Leander, G.. Finding nonnormal bent functions. Discrete Applied Mathematics 154, pp. 202 – 218, 2006. See also “Normal and Non-Normal Bent Functions.” Proceedings of the Workshop on Coding and Cryptography 2003, pp. 91–100, 2003. See pages 203, 211, 241, and 252.Google Scholar

[199] Canteaut, A., Duval, S., and Perrin, L.. A generalisation of Dillon’s APN permutation with the best known differential and nonlinear properties for all fields of size 2^4k+2 . IEEE Transactions on Information Theory 63 (11), pp. 7575–7591, 2017. See pages 411, 421, and 478.Google Scholar

[200] Canteaut, A. and Naya-Plasencia, M.. Structural weaknesses of permutations with a low differential uniformity and generalized crooked functions. Contemporary Mathematics 518, pp. 55–71, 2010. See page 279.Google Scholar

[201] Canteaut, A. and Perrin, L.. On CCZ-equivalence, extended-affine equivalence, and function twisting. Finite Fields and Their Applications 56, pp. 209–246, 2019. Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/713. See pages 72 and 136.Google Scholar

[202] Canteaut, A. and Rotella, Y.. Attacks against filter generators exploiting monomial mappings. Proceedings of Fast Software Encryption FSE 2016, Lecture Notes in Computer Science 9783, pp. 78–98, 2016. See page 243.Google Scholar

[203] Canteaut, A. and Trabbia, M.. Improved fast correlation attacks using parity-check equations of weight 4 and 5, Proceedings of EUROCRYPT 2000. Lecture Notes in Computer Science 1807, pp. 573–588, 2000. See pages 78, 87, 194, and 290.Google Scholar

[204] Canteaut, A. and Videau, M.. Degree of composition of highly nonlinear functions and applications to higher order differential cryptanalysis. Proceedings of EUROCRYPT 2002, Lecture Notes in Computer Science 2332, pp. 518–533, 2002. See pages 57, 64, 114, 115, 295, and 371.Google Scholar

[205] Canteaut, A. and Videau, M.. Symmetric Boolean functions. IEEE Transactions on Information Theory 51 (8), pp. 2791–2811, 2005. See pages 354, 355, 356, and 357.Google Scholar

[206] Cao, X., Chen, H., and Mesnager, S.. Further results on semi-bent functions in polynomial form. Advances in Mathematics of Communications 10 (4), pp. 725–741, 2016. See page 263.Google Scholar

[207] du Carlet, J. R.. La Cryptographie, contenant une très subtile manière d’escrire secrètement, composée par Maistre Jean Robert Du Carlet, 1644. A manuscript exists at the Bibliothèque Nationale (Très Grande Bibliothèque), Paris, France. See page 1.Google Scholar

[208] Carlet, C.. A simple description of Kerdock codes. Proceedings of Coding Theory and Applications 1988, 3rd International Colloquium, Lecture Notes in Computer Science 388, pp. 202–208, 1989. See page 255.Google Scholar

[209] Carlet, C.. Codes de Reed–Muller, codes de Kerdock et de Preparata. PhD thesis. Publication of LITP, Institut Blaise Pascal, Université Paris 6, 90.59, 1990. See pages 46, 171, 197, and 435.Google Scholar

[210] Carlet, C.. A transformation on Boolean functions, its consequences on some problems related to Reed–Muller codes. Proceedings of EUROCODE 1990, Lecture Notes in Computer Science 514, pp. 42–50, 1991. See pages 157, 180, 203, and 204.Google Scholar

[211] Carlet, C.. Partially-bent functions. Designs Codes and Cryptography, 3, pp. 135–145, 1993, and Proceedings of CRYPTO 1992, Lecture Notes in Computer Science 740, pp. 280–291, 1993. See pages 62, 190, 256, and 257.Google Scholar

[212] Carlet, C.. Two new classes of bent functions. Proceedings of EUROCRYPT 1993, Lecture Notes in Computer Science 765, pp. 77–101, 1994. See pages 58, 63, 197, 200, 202, 208, 210, 211, 215, and 252.Google Scholar

[213] Carlet, C.. Generalized partial spreads. IEEE Transactions on Information Theory 41 (5), pp. 1482–1487, 1995. See pages 241 and 242.Google Scholar

[214] Carlet, C.. Hyper-bent functions. PRAGOCRYPT 1996, Czech Technical University Publishing House, pp. 145–155, 1996. See page 244.Google Scholar

[215] Carlet, C.. A construction of bent functions. Finite Fields and Applications, London Mathematical Society, Lecture Series 233, Cambridge University Press, pp. 47–58, 1996. See pages 234 and 235.Google Scholar

[216] Carlet, C.. More correlation-immune and resilient functions over Galois fields and Galois rings. Proceedings of EUROCRYPT 1997, Lecture Notes in Computer Science 1233, pp. 422–433, 1997. See pages 295 and 303.Google Scholar

[217] Carlet, C.. On Kerdock codes, American Mathematical Society. Proceedings of the Conference Finite Fields and Applications Fq4, Contemporary Mathematics 225, pp.155–163, 1999. See page 255.Google Scholar

[218] Carlet, C.. On the propagation criterion of degree ℓ and order k. Proceedings of EUROCRYPT 1998, Lecture Notes in Computer Science 1403, pp. 462–474, 1998. See pages 318, 319, and 320.Google Scholar

[219] Carlet, C.. On cryptographic propagation criteria for Boolean functions. Information and Computation 151, Academic Press, pp. 32–56, 1999. See pages 97, 198, 318, 319, and 320.Google Scholar

[220] Carlet, C.. On the coset weight divisibility and nonlinearity of resilient and correlation-immune functions. Proceedings of International Conference on Sequences and Their Applications SETA 2001 , Discrete Mathematics and Theoretical Computer Science, pp. 131–144, 2001. See pages 47, 286, 287, and 289.Google Scholar

[221] Carlet, C.. A larger class of cryptographic Boolean functions via a study of the Maiorana–McFarland construction. Proceedings of CRYPT0 2002, Lecture Notes in Computer Science 2442, pp. 549–564, 2002. See pages 179, 293, 294, and 295.Google Scholar

[222] Carlet, C., On cryptographic complexity of Boolean functions. Finite Fields with Applications to Coding Theory, Cryptography and Related Areas (Proceedings of the Conference Fq6), Springer-Verlag, Berlin, pp. 53–69, 2002. See pages 103, 104, 105, 107, 108, 328, and 509.Google Scholar

[223] Carlet, C.. On the confusion and diffusion properties of Maiorana–McFarland’s and extended Maiorana–McFarland’s functions. Special Issue “Complexity Issues in Coding and Cryptography”, Dedicated to Prof. Harald Niederreiter on the Occasion of his 60th Birthday, Journal of Complexity 20, pp. 182–204, 2004. See pages 211, 264, 293, and 296.Google Scholar

[224] Carlet, C.. On the degree, nonlinearity, algebraic thickness and non-normality of Boolean functions, with developments on symmetric functions. Extended version of . IEEE Transactions on Information Theory 50, pp. 2178–2185, 2004. See pages 80, 103, 104, 105, 107, 328, and 356.Google Scholar

[225] Carlet, C.. On the secondary constructions of resilient and bent functions. Proceedings of the Workshop on Coding, Cryptography and Combinatorics 2003, Published by Birkhäuser Verlag, pp. 3–28, 2004. See pages 233, 300, 301, and 317.Google Scholar

[226] Carlet, C.. Concatenating indicators of flats for designing cryptographic functions. Designs, Codes and Cryptography 36 (2), pp. 189–202, 2005. See pages 181, 182, and 295.Google Scholar

[227] Carlet, C.. On bent and highly nonlinear balanced/resilient functions and their algebraic immunities. Proceedings , of AAECC-16 Conference, Lecture Notes in Computer Science 3857, pp. 1–28, 2006. Extended version of “Improving the algebraic immunity of resilient and nonlinear functions and constructing bent function”, IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2004/276, 2004, and of “Designing bent functions and resilient functions from known ones, without extending their number of variables,” Proceedings of IEEE International Symposium on Information Theory (ISIT) 2005, pp. 1096–1100, 2005. See pages 231, 236, 237, 238, 302, 303, 332, and 341.Google Scholar

[228] Carlet, C.. On the higher order nonlinearities of algebraic immune functions. Proceedings of CRYPTO 2006, Lecture Notes in Computer Science 4117, pp. 584–601, 2006. See pages 323 and 331.Google Scholar

[229] Carlet, C.. The complexity of Boolean functions from cryptographic viewpoint. Dagstuhl Seminar Proceedings 06111 Complexity of Boolean Functions, 2006 (http://drops.dagstuhl.de/ opus/volltexte/) 2006/604 See pages 80, 83, and 103.Google Scholar

[230] Carlet, C.. A method of construction of balanced functions with optimum algebraic immunity. Proceedings of the International Workshop on Coding and Cryptography 2007, World Scientific Publishing, Series of Coding and Cryptology, pp. 25–43, 2008. Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2006/149, pp. 25–43 2006. See page 336.Google Scholar

[231] Carlet, C.. Partial covering sequences: a method for designing classes of cryptographic functions. Proceedings of “The First Symposium on Algebraic Geometry and Its Applications” Dedicated to Gilles Lachaud (SAGA’07), Tahiti, 2007, World Scientific, Series on Number Theory and its Applications 5, pp. 366–387, 2008. See pages 183 and 184.Google Scholar

[232] Carlet, C.. Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications. IEEE Transactions on Information Theory 54 (3), pp. 1262–1272, 2008. See pages 84, 85, and 125.Google Scholar

[233] Carlet, C.. On the higher order nonlinearities of Boolean functions and S-boxes, and their generalizations. Proceedings of International Conference on Sequences and Their Applications SETA 2008 , Lecture Notes in Computer Science 5203, pp. 345–367, 2008. See pages 122, 123, 124, 125, 348, and 349.Google Scholar

[234] Carlet, C.. On almost perfect nonlinear functions. Special Section on Signal Design and Its Application in Communications, IEICE Trans. Fundamentals E91-A (12), pp. 3665–3678, 2008. See pages 122 and 273.Google Scholar

[235] Carlet, C.. On the algebraic immunities and higher order nonlinearities of vectorial Boolean functions. NATO Science for Peace and Security Series, D: Information and Communication Security – Vol23; Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, pp. 104–116, 2009. See pages 128, 129, 344, 345, 346, 347, and 348.Google Scholar

[236] Carlet, C.. Boolean functions for cryptography and error correcting codes. Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, , , Y. Crama and Hammer, P., eds., Cambridge University Press, pp. 257–397, 2010. See pages ix, 198, 207, and 338.Google Scholar

[237] Carlet, C.. Vectorial Boolean functions for cryptography. Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, , Y. Crama and Hammer, P., eds., Cambridge University Press, pp. 398–469, 2010. See pages ix, 138, and 381.Google Scholar

[238] Carlet, C.. Comment on “constructions of cryptographically significant Boolean functions using primitive polynomials.” IEEE Transactions on Information Theory 57 (7), pp. 4852–4853, 2011. See pages 337 and 339.Google Scholar

[239] Carlet, C.. Relating three nonlinearity parameters of vectorial functions and building APN functions from bent. Designs, Codes and Cryptography 59 (1), pp. 89–109, 2011. See pages 119, 120, 138, 140, 141, 393, 406, 408, 409, and 422.Google Scholar

[240] Carlet, C.. More vectorial Boolean functions with unbounded nonlinearity profile. Special Issue on Cryptography of International Journal of Foundations of Computer Science 22 (6), pp. 1259–1269, 2011. See page 85.Google Scholar

[241] Carlet, C.. On known and new differentially uniform functions. Proceedings of the 16th Australasian Conference on Information Security and Privacy ACISP 2011 , Lecture Notes in Computer Science 6812, pp. 1–15, 2011. See pages 418 and 419.Google Scholar

[242] Carlet, C.. A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers. Proceedings of the SMF-VMS conference, Hué, Vietnam, August 20–24, 2012. Special Issue of the Vietnam Journal of Mathematics 41 (4), pp. 527–541, 2013. See pages 3, 337, 338, and 340.Google Scholar

[243] Carlet, C.. More constructions of APN and differentially 4-uniform functions by concatenation. Science China Mathematics 56 (7), pp. 1373–1384, 2013. See pages 410 and 422.Google Scholar

[244] Carlet, C.. Correlation-immune Boolean functions for leakage squeezing and rotating S-box masking against side channel attacks. Proceedings of SPACE 2013, Lecture Notes in Computer Science 8204, pp. 70–74, 2013. See page 433.Google Scholar

[245] Carlet, C.. Open problems on binary bent functions. Proceedings of the Conference Open Problems in Mathematical and Computational Sciences, September 18–20, 2013, in Istanbul, Turkey, Springer, pp. 203–241, 2014. See pages 47, 234, 249, 250, 251, 361, 362, and 475.Google Scholar

[246] Carlet, C.. More PS and H-like bent functions. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2015/168, 2015. See pages 216, 223, 224, and 225.Google Scholar

[247] Carlet, C.. Boolean and vectorial plateaued functions, and APN functions. IEEE Transactions on Information Theory 61 (11), pp. 6272–6289, 2015. See pages 190, 258, 260, 261, 263, 265, 266, 275, 276, 277, 278, 279, 280, 281, 282, 392, 393, 394, and 402.Google Scholar

[248] Carlet, C.. Open questions on nonlinearity and on APN functions. Proceedings of Arithmetic of Finite Fields 5th International Workshop, WAIFI 2014, 2014, Lecture Notes in Computer Science 9061, pp. 83–107, 2015. See pages 82, 272, 338, 475, and 478.Google Scholar

[249] Carlet, C.. On the nonlinearity of monotone Boolean functions. Special Issue SETA 2016 of Cryptography and Communications 10 (6), pp. 1051–1061, 2018. See pages 364, 366, 367, and 368.Google Scholar

[250] Carlet, C.. Characterizations of the differential uniformity of vectorial functions by the Walsh transform, IEEE Transactions on Information Theory 64 (9), pp. 6443–6453, 2018. (Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2017/516, 2017. See pages 386, 387, 412, 413, and 414.Google Scholar

[251] Carlet, C.. Componentwise APNness, Walsh uniformity of APN functions and cyclic-additive difference sets. Finite Fields and Their Applications 53, pp. 226–253, 2018. (Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2017/528, 2017. See pages 390, 391, 414, 415, and 416.Google Scholar

[252] Carlet, C.. On APN exponents, characterizations of differentially uniform functions by the Walsh transform, and related cyclic-difference-set-like structures. Designs, Codes and Cryptography 87 (2) (Postproceedings of WCC 2017), pp. 203–224, 2018. See pages 278, 389, 412, 414, 415, and 416.Google Scholar

[253] Carlet, C.. Handling vectorial functions by means of their graph indicators, To appear in IEEE Transactions on Information Theory, 2020. See pages 35, 40, and 47.Google Scholar

[254] Carlet, C.. Graph indicators of S-boxes and related bounds on the algebraic degree of composite functions. Preprint, 2020. See pages 35, 39, 40, 41, 47, 64, and 115.Google Scholar

[255] Carlet, C. and Alsalami, Y.. A new construction of differentially 4-uniform (n, n − 1)-functions. Advances in Mathematics of Communications 9 (4), pp. 541–565, 2015. See pages 423 and 424.Google Scholar

[256] Carlet, C. and Charpin, P.. Cubic Boolean functions with highest resiliency. IEEE Transactions on Information Theory 51 (2), pp. 562–571, 2005. See page 312.Google Scholar

[257] Carlet, C., Charpin, P., and Zinoviev, V.. Codes, bent functions and permutations suitable for DES-like cryptosystems. Designs, Codes and Cryptography, 15 (2), pp. 125–156, 1998. See pages 28, 160, 370, 372, 375, 376, 378, 380, 381, 382, 385, 387, 396, and 398.Google Scholar

[258] Carlet, C. and Chen, X.. Constructing low-weight dth-order correlation-immune Boolean functions through the Fourier–Hadamard transform. IEEE Transactions on Information Theory 64 (4) (Special Issue in honor of Solomon Golomb), pp. 2969–2978, 2018. See pages 291, 304, 305, 306, 307, 308, 309, 310, and 311.Google Scholar

[259] Carlet, C., Chen, X., and Qu, L.. Constructing infinite families of low differential uniformity (n, m)-functions with m > n/2. Designs, Codes and Cryptography 87 (7), pp. 1577–1599, 2019. Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/1046. See page 423.Google Scholar

[260] Carlet, C., Daif, A., Guilley, S., and Tavernier, C.. Polynomial direct sum masking to protect against both SCA and FIA. Journal of Cryptographic Engineering JCEN, 9 (3), pp. 303–312, 2019. Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/531, 2018. See page 447.Google Scholar

[261] Carlet, C., Dalai, D., Gupta, K., and Maitra, S.. Algebraic immunity for cryptographically significant Boolean functions: analysis and construction. IEEE Transactions on Information Theory 52 (7), pp. 3105–3121, 2006. See pages 323, 330, 331, 336, 342, 343, and 344.Google Scholar

[262] Carlet, C., Danger, J.-L., Guilley, S., and Maghrebi, H.. Leakage squeezing of order two. Proceedings of INDOCRYPT 2012, Lecture Notes in Computer Science 7668, pp. 120–139, 2012. See pages 427 and 432.Google Scholar

[263] Carlet, C., Danger, J.-L., Guilley, S., and Maghrebi, H.. Leakage squeezing: optimal implementation and security evaluation. Journal of Mathematical Cryptology 8 (3), pp. 249–295, 2014. See page 431.Google Scholar

[264] Carlet, C., Danger, J.-L., Guilley, S., Maghrebi, H., and Prouff, E.. Achieving side-channel high-order correlation immunity with leakage squeezing. Journal of Cryptographic Engineering JCEN 4(2), pp. 107–121, 2014. See pages 427 and 432.Google Scholar

[265] Carlet, C., Danielsen, L. E., Parker, M. G., and Solé, P.. Self-dual bent functions. Special Issue of the International Journal of Information and Coding Theory (IJICoT) dedicated to Vera Pless 1 (4), pp. 384–399, 2010. A preliminary version appeared in the proceedings of the BFCA 2008 conference. See pages 198 and 199.Google Scholar

[266] Carlet, C. and Ding, C.. Highly nonlinear mappings. Special Issue “Complexity Issues in Coding and Cryptography,” dedicated to Prof. Harald Niederreiter on the Occasion of his 60th Birthday, Journal of Complexity 20, pp. 205–244, 2004. See pages 122 and 193.Google Scholar

[267] Carlet, C. and Ding, C.. Nonlinearities of S-boxes. Finite Fields and Their Applications 13 (1), pp. 121–135, 2007. See pages 114, 122, 138, and 140.Google Scholar

[268] Carlet, C., Ding, C., and Niederreiter, H.. Authentication schemes from highly nonlinear functions. Designs, Codes and Cryptography 40 (1), pp. 71–79, 2006. See page 150.Google Scholar

[269] Carlet, C., Ding, C., and Yuan, J.. Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Transactions on Information Theory 51 (6), pp. 2089–2102, 2005. See pages 147 and 160.Google Scholar

[270] Carlet, C., Dobbertin, H., and Leander, G.. Normal extensions of bent functions. IEEE Transactions on Information Theory 50 (11), pp. 2880–2885, 2004. See pages 235, 253, and 476.Google Scholar

[271] Carlet, C. and Dubuc, S.. On generalized bent and q-ary perfect nonlinear functions. Proceedings of Finite Fields and Applications Fq5, Springer, pp. 81–94, 2000. See page 193.Google Scholar

[272] Carlet, C., Faugère, J.-C., Goyet, C., and Renault, G.. Analysis of the algebraic side channel attack. Journal of Cryptographic Engineering JCEN 2(1), pp. 45–62, 2012. See page 436.Google Scholar

[273] Carlet, C. and Feng, K.. An infinite class of balanced functions with optimum algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. Proceedings of ASIACRYPT 2008, Lecture Notes in Computer Science 5350, pp. 425–440, 2008. See pages 321, 336, 337, 338, and 348.Google Scholar

[274] Carlet, C. and Feng, K.. An infinite class of balanced vectorial Boolean functions with optimum algebraic immunity and good nonlinearity. Proceedings of IWCC 2009, Lecture Notes in Computer Science 5557, pp. 1–11, 2009. See page 350.Google Scholar

[275] Carlet, C. and Feukoua, S.. Three basic questions on Boolean functions. Advances in Mathematics of Communications 11 (4), pp. 837–855, 2017. See pages 38, 257, and 258.Google Scholar

[276] Carlet, C. and Feukoua, S.. Three parameters of Boolean functions related to their constancy on affine spaces. To appear in Advances in Mathematics of Communications. See page 105.Google Scholar

[277] Carlet, C., Freibert, F., Guilley, S., Kiermaier, M., Kim, J.-L., and Solé, P.. Higher-order CIS codes. IEEE Transactions on Information Theory 60 (9), pp. 5283–5295, 2014. See page 432.Google Scholar

[278] Carlet, C. and Gaborit, P.. Hyper-bent functions and cyclic codes. Journal of Combinatorial Theory, Series A 113 (3), 466–482, 2006. See pages 189, 216, 243, 244, 245, 246, 253, and 477.Google Scholar

[279] Carlet, C. and Gaborit, P.. On the construction of balanced Boolean functions with a good algebraic immunity. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2005. Longer version in the Proceedings of the Conference BFCA 2005, Publications des universités de Rouen et du Havre, pp. 1–20, 2005. See pages 324, 335, 342, and 363.Google Scholar

[280] Carlet, C., Gaborit, P., Kim, J.-L., and Solé, P.. A new class of codes for Boolean masking of cryptographic computations. IEEE Transactions on Information Theory 58 (9), pp. 6000–6011, 2012. See page 432.Google Scholar

[281] Carlet, C. and Gao, G.. A secondary construction and a transformation on rotation symmetric functions, and their action on bent and semi-bent functions. Journal of Combinatorial Theory, Series A 127 (1), pp. 161–175, 2014. See pages 249, 251, 252, 361, and 362.Google Scholar

[282] Carlet, C., Gao, G., and Liu, W.. Results on constructions of rotation symmetric bent and semi-bent functions. Proceedings of International Conference on Sequences and Their Applications SETA 2014 , Lecture Notes in Computer Science 8865, pp. 21–33, 2014. See pages 251, 252, and 263.Google Scholar

[283] Carlet, C., Gong, G., and Tan, Y.. Quadratic zero-difference balanced functions, APN functions and strongly regular graphs. Designs, Codes and Cryptography 78 (3), pp. 629–654, 2016. See pages 153, 393, and 394.Google Scholar

[284] Carlet, C., Goubin, L., Prouff, E., Quisquater, M., and Rivain, M.. Higher-order masking schemes for S-boxes. Proceedings of Fast Software Encryption FSE 2012, Lecture Notes in Computer Science 7549 , pp. 366–384, 2012. See pages 433 and 434.Google Scholar

[285] Carlet, C. and Gouget, A.. An upper bound on the number of m-resilient Boolean functions. Proceedings of ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp. 484–496, 2002. See page 312.Google Scholar

[286] Carlet, C. and Guilley, S.. Side-channel indistinguishability. Proceedings of HASP 2013, 2nd International Workshop on Hardware and Architectural Support for Security and Privacy, ACM, pp. 9:1–9:8 2013. See pages 284 and 433.Google Scholar

[287] Carlet, C. and Guilley, S., Correlation-immune Boolean functions for easing counter-measures to side channel attacks. Proceedings of the Workshop “Emerging Applications of Finite Fields”, Algebraic Curves and Finite Fields, Radon Series on Computational and Applied Mathematics, de Gruyter, pp. 41–70, 2014. See pages 304 and 306.Google Scholar

[288] Carlet, C. and Guilley, S.. Complementary dual codes for counter-measures to side-channel attacks. Advances in Mathematics of Communications 10 (1), pp. 131–150, 2016. See pages 444 and 446.Google Scholar

[289] Carlet, C. and Guilley, S.. Statistical properties of side-channel and fault injection attacks using coding theory. Cryptography and Communications 10 (5), pp. 909–933, 2018. See pages 433 and 446.Google Scholar

[290] Carlet, C. and Guillot, P.. A characterization of binary bent functions. Journal of Combinatorial Theory, Series A 76 (2), pp. 328–335, 1996. See page 241.Google Scholar

[291] Carlet, C. and Guillot, P.. An alternate characterization of the bentness of binary functions, with uniqueness. Designs, Codes and Cryptography 14, pp. 133–140, 1998. See page 242.Google Scholar

[292] Carlet, C. and Guillot, P.. A new representation of Boolean functions. Proceedings of AAECC-13 Conference, Lecture Notes in Computer Science 1719, pp. 94–103, 1999. See pages 47, 48, 49, 50, 51, 66, 156, 157, 195, and 201.Google Scholar

[293] Carlet, C. and Guillot, P.. Bent, resilient functions and the numerical normal form. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 56, pp. 87–96, 2001. See pages 47, 48, 51, 195, and 286.Google Scholar

[294] Carlet, C., Guillot, P., and Mesnager, S.. On immunity profile of Boolean functions. Proceedings of International Conference on Sequences and Their Applications SETA 2006 , Lecture Notes in Computer Science 4086, pp. 364–375, 2006. See page 290.Google Scholar

[295] Carlet, C., C. Güneri, S. Mesnager, and F. Özbudak. Construction of codes suitable for both SCA and FIA. Proceedings of WAIFI 2018, Lecture Notes in Computer Science 11321, pp. 95–107, 2018. See page 446.Google Scholar

[296] Carlet, C., Helleseth, T., Kholosha, A., and Mesnager, S.. On the duals of bent functions with 2 ^r Niho exponents. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2011, pp. 703–707, 2011. See page 222.Google Scholar

[297] Carlet, C., Heuser, A., and Picek, S.. Trade-offs for S-boxes: cryptographic properties and side-channel resilience. Proceedings of ACNS 2017, Lecture Notes in Computer Science 10355, pp. 393–414, 2017. See pages 145 and 433.Google Scholar

[298] Carlet, C., Joyner, D., Stănică, P., and Tang, D.. Cryptographic properties of monotone Boolean functions. Journal of Mathematical Cryptology 10 (1), pp. 1–14, 2016. See pages 364 and 368.Google Scholar

[299] Carlet, C., Khoo, K., Lim, C.-W., and Loe, C.-W.. Generalized correlation analysis of vectorial Boolean functions. Proceedings of Fast Software Encryption FSE 2007, Lecture Notes in Computer Science 4593, pp. 382–398, 2007. See pages 131 and 132.Google Scholar

[300] Carlet, C., Khoo, K., Lim, C.-W., and Loe, C.-W.. On an improved correlation analysis of stream ciphers using multi-output Boolean functions and the related generalized notion of nonlinearity. Advances in Mathematics of Communications 2 (2), pp. 201–221, 2008. See page 133.Google Scholar

[301] Carlet, C. and Klapper, A..Upper bounds on the numbers of resilient functions and of bent functions. This paper was meant to appear in an issue of Lecture Notes in Computer Sciences dedicated to Philippe Delsarte, Editor Jean-Jacques Quisquater, which never appeared. Shorter version in the Proceedings of the 23rd Symposium on Information Theory in the Benelux, Louvain-La-Neuve, Belgium, 2002. See pages 67, 195, 243, and 312.Google Scholar

[302] Carlet, C. and Klapper, A.. On the arithmetic Walsh coefficients of Boolean functions. Designs, Codes and Cryptography 73 (2), pp. 299–318, 2014. See page 57.Google Scholar

[303] Carlet, C., Ku-Cauich, J. C., and Tapia-Recillas, H.. Bent functions on a Galois ring and systematic authentication codes. Advances in Mathematics of Communications 6 (2), pp. 249–258, 2012. See page 150.Google Scholar

[304] Carlet, C., Levina, A.B., and Taranov, S. V.. Algebraic manipulation detection codes with perfect nonlinear functions under non-uniform distribution. Scientific and Technical Journal of Information Technologies, Mechanics and Optics 17, 6 (112), pp. 1052–1062, 2017. See page 450.Google Scholar

[305] Carlet, C. and Méaux, P.. Boolean functions for homomorphic-friendly stream ciphers. Proceedings of the Conference on Algebra, Codes and Cryptology (A2C), Lecture Notes in Computer Science, pp. 166–182, Springer, Cham 2019 2019 (this version does not include proofs; a full paper is to come later). See pages 341, 342, 360, 363, and 453.Google Scholar

[306] Carlet, C., Méaux, P., and Rotella, Y.. Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Transactions on Symmetric Cryptology 2017 (3), pp. 192–227, 2017. See pages 321, 363, 453, 456, 457, 458, 459, 460, 461, 463, 464, 465, 466, and 467.Google Scholar

[307] Carlet, C. and Merabet, B.. Asymptotic lower bound on the algebraic immunity of random balanced multi-output Boolean functions. Advances in Mathematics of Communications 7 (2), pp. 197–217, 2013. See page 93.Google Scholar

[308] Carlet, C. and Mesnager, S.. On the supports of the Walsh transforms of Boolean functions. Proceedings of the Conference BFCA 2005, Publications des universités de Rouen et du Havre, pp. 65–82, 2005. See pages 57 and 183.Google Scholar

[309] Carlet, C. and Mesnager, S.. Improving the upper bounds on the covering radii of binary Reed– Muller codes. IEEE Transactions on Information Theory 53, pp. 162–173, 2007. See pages 83, 158, and 159.Google Scholar

[310] Carlet, C. and Mesnager, S.. On the construction of bent vectorial functions. Special Issue of the International Journal of Information and Coding Theory (IJICoT) 1 (2), dedicated to Vera Pless, pp. 133–148, 2010. See pages 269, 270, 271, and 274.Google Scholar

[311] Carlet, C. and Mesnager, S.. On Dillon’s class H of bent functions, Niho bent functions and o-polynomials. Journal of Combinatorial Theory, Series A 118, pp. 2392–2410, 2011. See pages 168, 199, 17, 218, 219, 220, 222, 362, and 476.Google Scholar

[312] Carlet, C. and Mesnager, S.. On semi-bent Boolean functions. IEEE Transactions on Information Theory 58, pp. 3287–3292, 2012. See pages 61, 263, and 362.Google Scholar

[313] Carlet, C. and Mesnager, S.. Four decades of research on bent functions. Designs, Codes and Cryptography 78 (1), pp. 5–50, 2016. See pages 190, 201, 222, 266, and 270.Google Scholar

[314] Carlet, C. and Mesnager, S.. Characterizations of o-polynomials by the Walsh transform, arXiv:1709.03765, 2017 https://arxiv.org/abs/1709.03765. See page 414.Google Scholar

[315] Carlet, C. and Mesnager, S.. On those multiplicative subgroups of F^∗_2n which are Sidon sets and/or sum-free sets. Preprint 2019. See page 390.Google Scholar

[316] Carlet, C. and Picek, S.. On the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2017/1179, 2017. See pages 388, 389, and 390.Google Scholar

[317] Carlet, C. and Prouff, E.. On plateaued functions and their constructions. Proceedings of Fast Software Encryption FSE 2003, Lecture Notes in Computer Science 2887, pp. 54–73, 2003. See pages 180, 193, 258, 260, 264, 265, and 295.Google Scholar

[318] Carlet, C. and Prouff, E.. On a new notion of nonlinearity relevant to multi-output pseudo-random generators. Proceedings of Selected Areas in Cryptography 2003 , Lecture Notes in Computer Science 3006, pp. 291–305, 2004. See pages 131 and 133.Google Scholar

[319] Carlet, C. and Prouff, E.. Vectorial functions and covering sequences. Proceedings of Finite Fields and Applications, Fq7, Lecture Notes in Computer Science 2948, pp. 215–248, 2004. See pages 184, 186, 187, and 316.Google Scholar

[320] Carlet, C. and Prouff, E.. Polynomial evaluation and side channel analysis. The New Codebreakers, Dedicated to David Kahn on the Occasion of His 85th Birthday, pp. 315–341, 2016. See pages 74, 425, 431, 434, and 484.Google Scholar

[321] Carlet, C., Prouff, E., Rivain, M., and Roche, T.. Algebraic decomposition for probing security. Proceedings of CRYPTO 2015, Lecture Notes in Computer Science 9215, pp. 742–763, 2015. See pages 435 and 441.Google Scholar

[322] Carlet, C. and Sarkar, P.. Spectral domain analysis of correlation immune and resilient Boolean functions. Finite Fields and Their Applications 8, pp. 120–130, 2002. See pages 287, 289, and 290.Google Scholar

[323] Carlet, C. and Tan, Y.. On group rings and some of their applications to combinatorics and cryptography. International Journal of Group Theory 4 (4), pp. 61–74, 2015. See page 153.Google Scholar

[324] Carlet, C. and Tang, D.. Enhanced Boolean functions suitable for the filter model of pseudo-random generator. Designs, Codes and Cryptography 76 (3), pp. 571–587, 2015. See pages 94, 322, 343, and 344.Google Scholar

[325] Carlet, C., Tang, D., Tang, X., and Liao, Q.. New construction of differentially 4-uniform bijections. Proceedings of INSCRYPT 2013 , 9th International Conference, Guangzhou, China, November 27–30, 2013, Lecture Notes in Computer Science 8567, pp. 22–38, 2014. See pages 420 and 421.Google Scholar

[326] Carlet, C. and Tarannikov, Y. V.. Covering sequences of Boolean functions and their cryptographic significance. Designs, Codes and Cryptography, 25, pp. 263–279, 2002. See pages 182, 290, and 291.Google Scholar

[327] Carlet, C. and Yucas, J. L.. Piecewise constructions of bent and almost optimal Boolean functions. Designs, Codes and Cryptography 37 (3), pp. 449–464, 2005. See pages 237 and 255.Google Scholar

[328] Carlet, C., Zeng, X., Lei, C., and Hu, L.. Further properties of several classes of Boolean functions with optimum algebraic immunity. Proceedings of the First International Conference on Symbolic Computation and Cryptography SCC 2008, LMIB, pp. 42–54, 2008. See pages 336 and 355.Google Scholar

[329] Carlet, C., Zhang, F., and Hu, Y.. Secondary constructions of bent functions and their enforcement. Advances in Mathematics of Communications 6 (3), pp. 305–314, 2012. See page 233.Google Scholar

[330] Carlitz, L.. Permutations in a finite field. Proc. Amer. Math. Soc. 4, p. 538, 1953. See page 494.Google Scholar

[331] Carlitz, L.. A note on permutation functions over a finite field. Duke Math. Journal 29 (2), pp. 325–332, 1962. See page 442.Google Scholar

[332] Carlitz, L.. Explicit evaluation of certain exponential sums. Math. Scand., 44, pp. 5–16, 1979. See page 177.Google Scholar

[333] Carlitz, L. and Uchiyama, S.. Bounds for exponential sums. Duke Math. Journal 1, pp. 37–41, 1957. See pages 188 and 401.Google Scholar

[334] Castro, F. N., and Medina, L. A.. Linear recurrences and asymptotic behavior of exponential sums of symmetric Boolean functions. The Electronic Journal of Combinatorics 18 (2), p. 8, 2011. See page 355.Google Scholar

[335] Çeşmelioglu, A., Meidl, W., and Pott, A.. Bent functions, spreads and o-polynomials. SIAM Journal on Discrete Mathematics 29 (2), pp. 854–867, 2015. See page 224.Google Scholar

[336] Çeşmelioglu, A., Meidl, W., and Pott, A.. There are infinitely many bent functions for which the dual is not bent. IEEE Transactions on Information Theory 62 (9), pp. 5204–5208, 2016. See page 234.Google Scholar

[337] Çeşmelioglu, A., Meidl, W., and Pott, A.. Vectorial bent functions and their duals. Linear Algebra and Its Applications 548, pp. 305–320, 2018. See page 269.Google Scholar

[338] Çeşmelioglu, A., Meidl, W., and Topuzoğlu, A.. Partially bent functions and their properties. Applied Algebra and Number Theory 2014, pp. 22–38, 2014. See page 256.Google Scholar

[339] Chabanne, H., Cohen, G. D., and Patey, A.. Towards secure two-party computation from the wire-tap channel. Proceedings of ICISC 2013, Lecture Notes in Computer Science 8565, pp. 34–46, 2013. See page 149.Google Scholar

[340] Chabanne, H., Maghrebi, H., and Prouff, E.. Linear repairing codes and side-channel attacks. IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (1), pp. 118–141, 2018. See pages 428 and 436.Google Scholar

[341] Chabaud, F. and Vaudenay, S.. Links between differential and linear cryptanalysis. Proceedings of EUROCRYPT 1994, Lecture Notes in Computer Science 950, pp. 356–365, 1995. See pages 117, 118, 119, and 372.Google Scholar

[342] Chaigneau, C., Fuhr, T., Gilbert, H., Guo, J., Jean, J., Reinhard, J.-R., and Song, L.. Key-recovery attacks on full Kravatte. IACR Transactions on Symmetric Cryptology 2018 (1), pp. 5–28, 2018. See page 96.Google Scholar

[343] Chakraborty, K., Sarkar, S., Maitra, S., Mazumdar, B., Mukhopadhyay, D., and Prouff, E.. Redefining the transparency order. Designs, Codes and Cryptography 82 (1–2), pp. 95–115, 2017. See page 429.Google Scholar

[344] Chan, A. H. and Games, R. A.. On the quadratic spans of De Bruijn sequences. IEEE Transactions on Information Theory 36 (4), pp. 822–829, 1990. See page 23.Google Scholar

[345] Chang, S. and Hyun, J. Y.. Linear codes from simplicial complexes. Designs, Codes and Cryptography 86 (10), pp. 2167–2181, 2018. See page 149.Google Scholar

[346] Chanson, S., Ding, C., and Salomaa, A.. Cartesian authentication codes from functions with optimal nonlinearity. Theoretical Computer Science 290, pp. 1737–1752, 2003. See page 370.Google Scholar

[347] Charnes, C., Rötteler, M., and Beth, T.. Homogeneous bent functions, invariants, and designs. Designs, Codes and Cryptography, 26, pp. 139–154, 2002. See pages 209 and 248.Google Scholar

[348] Charpin, P.. Open Problems on Cyclic Codes. In Handbook of Coding Theory, Part 1, chapter 11, Pless, V. S. and Huffman, W. C., eds., , R. A. Brualdi , assistant editor. Elsevier, part 1, chapter 11, pp. 963–1063, 1998. See page 6.Google Scholar

[349] Charpin, P.. Normal Boolean functions. Special Issue “Complexity Issues in Coding and Cryptography,” Dedicated to Prof. Harald Niederreiter on the Occasion of His 60th Birthday, Journal of Complexity 20, pp. 245–265, 2004. See pages 241 and 253.Google Scholar

[350] Charpin, P. and Gong, G.. Hyperbent functions, Kloosterman sums and Dickson polynomials. IEEE Transactions on Information Theory 54 (9), pp. 4230–4238, 2008. See pages 215, 231, 246, and 247.Google Scholar

[351] Charpin, P., Helleseth, T., and Zinoviev, V.. Propagation characteristics of x → 1/x and Kloosterman sums. Finite Fields and Their Applications 13 (2), pp. 366–381, 2007. See page 401.Google Scholar

[352] Charpin, P. and Kyureghyan, G.. Cubic monomial bent functions: a subclass of M. SIAM Journal on Discrete Mathematics 22 (2), pp. 650–665, 2008. See pages 230 and 231.Google Scholar

[353] Charpin, P. and Kyureghyan, G.. On sets determining the differential spectrum of mappings. International Journal of Information and Coding Theory (IJICoT) 4 (2/3), pp. 170–184, 2017. See also: A note on verifying the APN property. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2013/475, 2013. See pages 192 and 373.Google Scholar

[354] Charpin, P. and Pasalic, E.. On propagation characteristics of resilient functions. Proceedings of SAC 2002, Lecture Notes in Computer Science 2595, pp. 356–365, 2002. See pages 101, 290, and 292.Google Scholar

[355] Charpin, P., Pasalic, E., and Tavernier, C.. On bent and semi-bent quadratic Boolean functions. IEEE Transactions on Information Theory 51 (12), pp. 4286–4298, 2005. See pages 178, 206, 230, and 263.Google Scholar

[356] Charpin, P. and Peng, J.. New links between nonlinearity and differential uniformity. Finite Fields and Their Applications 56, pp. 188–208, 2019. See pages 387 and 418.Google Scholar

[357] Chee, S., Lee, S., and Kim, K.. Semi-bent functions. Proceedings of ASIACRYPT 1994, Lecture Notes in Computer Science 917, pp. 107–118, 1994. See page 263.Google Scholar

[358] Chee, S., Lee, S., Kim, K., and Kim, D.. Correlation immune functions with controlable nonlinearity. ETRI Journal 19, (4), pp. 389–401, 1997. See page 294.Google Scholar

[359] Chee, S., Lee, S., Lee, D., and Sung, S. H.. On the correlation immune functions and their nonlinearity. Proceedings of ASIACRYPT 1996, Lecture Notes in Computer Science 1163, pp. 232–243, 1997. See page 294.Google Scholar

[360] Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., and Smith-Tone, D.. Report on post-quantum cryptography. US Department of Commerce, National Institute of Standards and Technology, NISTIR 8105. See page 1.Google Scholar

[361] Chen, V. Y.-W.. The Gowers’ norm in the testing of Boolean functions. PhD thesis, Massachusetts Institute of Technology, 2009. See page 469.Google Scholar

[362] Chen, X., Deng, Y., Zhu, M., and Qu, L.. An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function. International Journal of Computer Mathematics 94 (6), pp. 1252–1267, 2017. See page 420.Google Scholar

[363] Chen, X., Qu, L., Li, C., and Du, J.. A new method to investigate the CCZ-equivalence between functions with low differential uniformity. Finite Fields and Their Applications 42, pp. 165–186, 2016. See page 420.Google Scholar

[364] Chen, Y. and Lu, P.. Two classes of symmetric Boolean functions with optimum algebraic immunity: construction and analysis. IEEE Transactions on Information Theory 57, pp. 2522–2538, 2011. See page 358.Google Scholar

[365] Cheng, W., Carlet, C., Goli, K., Guilley, S., and Danger, J.-L.. Detecting faults in inner product masking scheme. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2019/919. Presented at PROOFS 2019, 8th International Workshop on Security Proofs for Embedded Systems, Atlanta, USA, 2019 (https://easychair.org/publications/paper/HTzP). See page 447.Google Scholar

[366] Cheng, W., Guilley, S., Carlet, C., Danger, J.-L., and Schaub, A.. Optimal codes for inner product masking. 17th CryptArchi Workshop, Prague 2019. See page 446.Google Scholar

[367] Cheon, J. H.. Nonlinear vector resilient functions. Proceedings of CRYPTO 2001, Lecture Notes in Computer Science 2139, pp. 458–469, 2001. See page 317.Google Scholar

[368] Cheon, J. H. and Lee, D. H.. Resistance of S-boxes against algebraic attacks. Proceedings of Fast Software Encryption FSE 2004 , Lecture Notes in Computer Science 3017, pp. 83–94, 2004. See page 345.Google Scholar

[369] Chepyzhov, V. and Smeets, B.. On a fast correlation attack on certain stream ciphers. Proceedings of EUROCRYPT 1991, Lecture Notes in Computer Science 547, pp. 176–185, 1992. See page 78.Google Scholar

[370] Chor, B., Goldreich, O., Hastad, J., Freidmann, J., Rudich, S., and Smolensky, R.. The bit extraction problem or t-resilient functions. Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp. 396–407, 1985. See pages 86, 129, 284, 314, and 356.Google Scholar

[371] Cid, C., Huang, T., Peyrin, T., Sasaki, Y., and Song, L.. Boomerang connectivity table: a new cryptanalysis tool. Proceedings of EUROCRYPT (2) 2018 , Lecture Notes in Computer Science 10821, pp. 683–714, 2018. See page 141.Google Scholar

[372] Clark, J. A., Jacob, J. L., and Stepney, S.. The design of S-boxes by simulated annealing. New Generation Computing 23 (3), pp. 219–231, 2005. See page 145.Google Scholar

[373] Clarke, E. M., McMillan, K. L., Zhao, X., Fujita, M., and Yang, J.. Spectral transforms for large Boolean functions with applications to technology mapping. Proceedings of 30th ACM/IEEE Design Automation Conference, IEEE, pp. 54–60, 1993. See page 57.Google Scholar

[374] Cohen, G. and Flori, J. P.. On a generalized combinatorial conjecture involving addition mod 2^k − 1. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2011/400, 2011. See page 340.Google Scholar

[375] Cohen, G., Honkala, I., Litsyn, S., and Lobstein, A.. Covering Codes. North-Holland, 1997. See pages 7 and 158.Google Scholar

[376] Cohen, G. and Mesnager, S.. On constructions of semi-bent functions from bent functions. Journal Contemporary Mathematics 625, Discrete Geometry and Algebraic Combinatorics, American Mathematical Society, pp. 141–154, 2014. See page 263.Google Scholar

[377] , G. Cohen, and , A. Tal, . Two structural results for low degree polynomials and applications. 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015 – Princeton, United States. CoRR, abs/1404.0654, 2014. See page 109.Google Scholar