Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-15T02:08:41.509Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  31 October 2020

Claude Carlet
Claude Carlet
Affiliation:
University of Bergen and Université de Paris VIII
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Boolean Functions for Cryptography and Coding Theory , pp. 498 - 556
Publisher: Cambridge University Press
Print publication year: 2021

Access options

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

References

[1] 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 bent4 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 ↦→ x2t −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 xq+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 2dmin 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−1 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 2 n: 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(2m) 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 24k+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 2k − 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
[378] Cohen, G. D., Karpovsky, M. G., Mattson, H. F., and Schatz, J. R.. Covering radius – survey and recent results. IEEE Transactions on Information Theory 31 (3), pp. 328–343, 1985. See page 158.Google Scholar
[379] Cohen, G. D. and Litsyn, S.. On the covering radius of Reed–Muller codes. Discrete Mathematics 106–107, pp. 147–155, 1992. See page 158.Google Scholar
[380] Cohen, S. D. and Matthews, R. W.. A class of exceptional polynomials. Transactions of the AMS 345, pp. 897–909, 1994. See page 400.Google Scholar
[381] Coron, J.-S., Prouff, E., Rivain, M., and Roche, T.. Higher-order side channel security and mask refreshing. Proceedings of Fast Software Encryption FSE 2013, Lecture Notes in Computer Science 8424, pp. 410–424, 2013, and IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2015/359, 2015. See page 427.Google Scholar
[382] Coron, J.-S., Roy, A., and Vivek, S.. Fast evaluation of polynomials over binary finite fields and application to side-channel countermeasures. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2014, Lecture Notes in Computer Science 8731, pp. 170–187, 2014. See page 434.Google Scholar
[383] Coşgun, A. and Özbudak, F.. A correction and improvements of some recent results on Walsh transforms of Gold type and Kasami–Welch type functions. Proceedings of WAIFI 2016 , Lecture Notes in Computer Science 10064, pp. 243–257, 2016. See page 178.Google Scholar
[384] Coulter, R. S.. On the evaluation of a class of Weil sums in characteristic 2, New Zealand J. Math. 28, pp. 171–184, 1999. See page 178.Google Scholar
[385] Coulter, R. S.. The number of rational points of a class of Artin–Schreier curves. Finite Fields and Their Applications 8, pp. 397–413, 2002. See page 178.Google Scholar
[386] Coulter, R. S. and Mesnager, S.. Bent functions from involutions over F 2n. IEEE Transactions on Information Theory 64 (4), pp. 2979–2986, 2018. See page 237.Google Scholar
[387] Courtois, N.. Higher order correlation attacks, XL algorithm and cryptanalysis of Toyocrypt. Proceedings of ICISC 2002, Lecture Notes in Computer Science 2587, pp. 182–199, 2003. See pages 3 and 83.Google Scholar
[388] Courtois, N.. Fast algebraic attacks on stream ciphers with linear feedback. Proceedings of CRYPTO 2003, Lecture Notes in Computer Science 2729, pp. 177–194, 2003. See pages 76, 89, 93, and 284.Google Scholar
[389] Courtois, N.. lgebraic attacks on combiners with memory and several outputs. Proceedings of ICISC 2004 , Lecture Notes in Computer Science 3506, pp. 3–20, 2005. See page 91.Google Scholar
[390] Courtois, N.. Cryptanalysis of SFINKS. Proceedings of ICISC 2005. Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) pp. 261–269, 2005/243, 2005. See page 93.Google Scholar
[391] Courtois, N. and Meier, W.. Algebraic attacks on stream ciphers with linear feedback. Proceedings of EUROCRYPT 2003, Lecture Notes in Computer Science 2656, pp. 346–359. See pages 76, 89, 91, 92, and 93.Google Scholar
[392] Courtois, N. and Pieprzyk, J.. Cryptanalysis of block ciphers with overdefined systems of equations. Proceedings of ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp. 267–287, 2003. See pages 125, 126, 127, and 345.Google Scholar
[393] Couteau, G., Dupin, A., Méaux, P., Rossi, M., and Rotella, Y.. On the concrete security of Goldreich’s pseudorandom generator. Proceedings of ASIACRYPT 2018, Part I, Lecture Notes in Computer Science, 11273, pp. 96–124, 2018. See pages 467 and 468.Google Scholar
[394] Crama, Y. and Hammer, P. L.. Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press, 2010 Cambridge University Press, 2010. See page ix.Google Scholar
[395] Cramer, R., Dodis, Y., Fehr, S., Padro, C., and Wichs, D.. Detection of algebraic manipulation with application to robust secret sharing and fuzzy extractors. Proceedings of EUROCRYPT 2008, Lecture Notes in Computer Science 4965, pp. 471–488, 2008 (preliminary version available in IACR Cryptology ePrint Archive http://eprint.iacr.org/ 2008/030). See pages 450, 451, 452, and 453.Google Scholar
[396] Cramer, R., Fehr, S., and Padro, C.. Algebraic manipulation detection codes. Science China Mathematics 56 (7), pp. 1349–1358, 2013. See pages 451, 452, and 453.Google Scholar
[397] Cramer, R., Padr, C., and Xing, C.. Optimal algebraic manipulation detection codes in the constant-error model. Proceedings of TCC (1) 2015, Lecture Notes in Computer Science 9014, pp. 481–501, 2015. See pages 452 and 453.Google Scholar
[398] Cusick, T. W.. On constructing balanced correlation immune functions. Proceedings of International Conference on Sequences and Their Applications SETA 1998, Discrete Mathematics and Theoretical Computer Science, pp. 184–190, 1999. See page 293.Google Scholar
[399] Cusick, T. W.. Weight recursions for any rotation symmetric Boolean functions. IEEE Transactions on Information Theory 64 (4), pp. 2962–2968, 2018. See page 362.Google Scholar
[400] Cusick, T. W., Ding, C., and Renvall, A.. Stream Ciphers and Number Theory, North-Holland Mathematical Library 55. North-Holland/Elsevier, 1998.Google Scholar
[401] Cusick, T. W. and Stănică, P.. Cryptographic Boolean Functions and Applications (second edition), Elsevier, 2017. See page 76.Google Scholar
[402] Daemen, J.. Changing of the guards: a simple and efficient method for achieving uniformity in threshold sharing. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2017 , Lecture Notes in Computer Science 10529, pp. 137–153, 2017. See page 443.Google Scholar
[403] Daemen, J. and Rijmen, V.. AES proposal: Rijndael, 1999. See www.quadibloc.com/crypto/ co040401.htm. See page 3.Google Scholar
[404] Daemen, J. and Rijmen, V., The Design of Rijndael: AES – The Advanced Encryption Standard. Springer, 2002. See pages 3 and 25.Google Scholar
[405] Daemen, J. and Rijmen, V.. Probability distributions of correlation and differentials in block ciphers. Journal of Mathematical Cryptology (JMC) 1 (3), pp. 221–242, 2007. See page 136.Google Scholar
[406] Dalai, D.. On 3-to-1 and power APN S-boxes. Proceedings of International Conference on Sequences and Their Applications SETA 2008 , Lecture Notes in Computer Science 5203, pp. 377–389, 2008. See pages 385 and 386.Google Scholar
[407] Dalai, D. K., Gupta, K. C., and Maitra, S.. Results on algebraic immunity for cryptographically significant Boolean functions. Proceedings of Indocrypt 2004 , Lecture Notes in Computer Science 3348, pp. 92–106, 2004. See pages 324, 334, and 343.Google Scholar
[408] Dalai, D. K., Gupta, K. C., and Maitra, S.. Cryptographically significant Boolean functions: construction and analysis in terms of algebraic immunity. Proceedings of Fast Software Encryption FSE 2005 , Lecture Notes in Computer Science 3557, pp. 98–111, 2005. See page 336.Google Scholar
[409] Dalai, D. K., Maitra, S., and Sarkar, S.. Basic theory in construction of Boolean functions with maximum possible annihilator immunity. Designs, Codes and Cryptography 40 (1) pp, 41–58, 2006 (preliminary version available in IACR Cryptology ePrint Archive, http://eprint.iacr.org/ 2005/229, 2005). See pages 334, 335, and 360.Google Scholar
[410] Dam, E. R. and Fon-Der-Flaass, D.. Codes, graphs, and schemes from nonlinear functions. European Journal of Combinatorics 24 (1), pp. 85–98, 2003. See pages 373 and 376.Google Scholar
[411] Dam, E. R. and Muzychuk, M.. Some implications on amorphic association schemes. Journal of Combinatorial Theory, Series A 117 (2), pp. 111–127, 2010. See page 162.Google Scholar
[412] Daum, M., Dobbertin, H., and Leander, G.. An algorithm for checking normality of Boolean functions. Proceedings of the Workshop on Coding and Cryptography 2003, pp. 133–142, 2003. See page 252.Google Scholar
[413] Daum, M., Dobbertin, H., and Leander, G.. Short description of an algorithm to create bent functions. Private communication. See page 243.Google Scholar
[414] Davidova, D.. Magic action of o-polynomials and EA equivalence of Niho bent functions. BFA 2018, June 2018, Loen, Norway (https://people.uib.no/chunlei.li/workshops/BFA2018/Slides/Davidova.pdf). See page 221.Google Scholar
[415] Davis, J. A. and Jedwab, J.. A unifying construction for difference sets. Journal of Combinatorial Theory Series A 80, pp. 13–78, 1997. See page 235.Google Scholar
[416] Davis, J. A. and Jedwab, J.. Peak-to-mean power control in OFDM, Golay complementary sequences and Reed–Muller codes. IEEE Transactions on Information Theory 45 (7), pp. 2397–2417, 1999. See page 189.Google Scholar
[417] Dawson, E. and Wu, C.-K.. Construction of correlation immune Boolean functions. Proceedings of ICICS 1997, pp. 170–180, 1997. See page 292.Google Scholar
[418] Delgado, M.. The state of the art on the conjecture of exceptional APN functions. Note Mat. 37 (1), pp. 41–51, 2017. See page 404.Google Scholar
[419] Delgado, M. and Janwa, H.. On the conjecture on APN functions and absolute irreducibility of polynomials. Designs, Codes and Cryptography 82 (3), pp. 617–627, 2017. See page 404.Google Scholar
[420] Delsarte, P.. A geometrical approach to a class of cyclic codes. Journal of Combinatorial Theory 6 (4), pp. 340–358, 1969. See page 154.Google Scholar
[421] Delsarte, P.. Bounds for unrestricted codes, by linear programming. Philips Research Reports 27, pp. 272–289, 1972. See page 129.Google Scholar
[422] Delsarte, P.. An algebraic approach to the association schemes of coding theory. PhD thesis. Université Catholique de Louvain, 1973. See pages 88, 254, 304, and 314.Google Scholar
[423] Delsarte, P.. Four fundamental parameters of a code and their combinatorial significance. Information and Control 23 (5), pp. 407–438, 1973. See page 88.Google Scholar
[424] Delsarte, P. and Levenshtein, V. I.. Association schemes and coding theory. IEEE Transactions on Information Theory 44 (6), pp. 2477–2504, 1998. See page 162.Google Scholar
[425] Dembowski, P.. Finite Geometries. Springer, 1968. See pages 224 and 225.Google Scholar
[426] Dempwolff, U.. Automorphisms and equivalence of bent functions and of difference sets in elementary Abelian 2-groups. Comm. Algebra 34 (3), pp. 1077–1131, 2006. See page 192.Google Scholar
[427] Dempwolff, U. and Neumann, T.. Geometric and design-theoretic aspects of semi-bent functions I. Designs, Codes and Cryptography 57 (3), pp. 373–381, 2010. See page 262.Google Scholar
[428] Dempwolff, U.. Dimensional doubly dual hyperovals and bent functions. Innov. Incidence Geom. 13 (1), pp. 149–178, 2013. See page 197.Google Scholar
[429] Dempwolff, U.. CCZ equivalence of power functions. Designs, Codes and Cryptography 86 (3), pp. 665–692, 2018. See page 396.Google Scholar
[430] Dempwolff, U. and Edel, Y.. Isomorphisms and automorphisms of extensions of bilinear dimensional dual hyperovals and quadratic APN functions. Journal of Group Theory 19 (2), pp. 249–322, 2016. See page 383.Google Scholar
[431] Dempwolff, U. and Müller, P.. Permutation polynomials and translation planes of even order. Adv. Geom. 13, pp. 293–313, 2013. See page 225.Google Scholar
[432] Denev, J. D. and Tonchev, V. D.. On the number of equivalence classes of Boolean functions under a transformation group. IEEE Transactions on Information Theory 26 (5), pp. 625–626, 1980 See page 29.Google Scholar
[433] Denisov, O.. An asymptotic formula for the number of correlation-immune of order k Boolean functions. Discrete Mathematics and Applications 2 (4), pp. 407–426, 1992. Translation of a Russian article in Diskretnaya Matematika 3, pp. 25–46, 1990. See page 312.Google Scholar
[434] Denisov, O.. A local limit theorem for the distribution of a part of the spectrum of a random binary function. Discrete Mathematics and Applications 10 (1), pp. 87–102, 2000. See page 312.Google Scholar
[435] Dib, S.. Distribution of Boolean functions according to the second-order nonlinearity. Proceedings of Arithmetic of Finite Fields WAIFI 2010, Lecture Notes in Computer Science 6087, pp. 86–96, 2010. See page 84.Google Scholar
[436] Dib, S.. Asymptotic nonlinearity of vectorial Boolean functions. Cryptography and Communications 6 (2), pp. 103–115, 2013. See pages 117 and 369.Google Scholar
[437] Didier, F.. A new upper bound on the block error probability after decoding over the erasure channel. IEEE Transactions on Information Theory 52, pp. 4496–4503, 2006. See pages 93 and 334.Google Scholar
[438] Didier, F.. Using Wiedemann’s algorithm to compute the immunity against algebraic and fast algebraic attacks. Proceedings of Indocrypt 2006, Lecture Notes in Computer Science 4329, pp. 236–250, 2006. See page 334.Google Scholar
[439] Didier, F. and Tillich, J.-P.. Computing the algebraic immunity efficiently. Proceedings of Fast Software Encryption FSE 2006, Lecture Notes in Computer Science 4047, pp. 359–374, 2006. See page 334.Google Scholar
[440] Dillon, J. F.. A survey of bent functions. NSA Technical Journal Special Issue, pp. 191–215, 1972. See pages 196, 208, 210, and 230.Google Scholar
[441] Dillon, J. F.. Elementary Hadamard difference sets. Ph. D. Thesis, University of Maryland, 1974. See pages 165, 167, 197, 198, 200, 201, 209, 212, 213, 216, 217, 218, 227, 231, 232, and 246.Google Scholar
[442] Dillon, J. F.. Elementary Hadamard difference sets. Proceedings of the Sixth S-E Conf. Comb. Graph Theory and Comp., Winnipeg Utilitas Math, pp. 237–249, 1975. See pages 214, 215, and 232.Google Scholar
[443] Dillon, J. F.. Multiplicative difference sets via additive characters. Designs, Codes and Cryptography 17, pp. 225–235, 1999. See pages 394, 395, and 416.Google Scholar
[444] Dillon, J. F.. Geometry, codes and difference sets: exceptional connections. Codes and Designs, Proceedings of a Conference Honoring Professor Ray-Chaudury, D. K., Columbus, OH, 2000 , Ohio State University, volume 10, pp. 73–85, 2002. See page 404.Google Scholar
[445] Dillon, J. F.. APN polynomials and related codes. Banff Conference, November 2006. See pages 408 and 412.Google Scholar
[446] Dillon, J. F.. More DD difference sets. Designs, Codes and Cryptography 49 (1–2), pp. 23–32, 2008.Google Scholar
[447] Dillon, J. F.. On the dimension of an APN code. Cryptography and Communications 3 (4) (Special issue in honor of Jacques Wolfmann), pp. 275–279, 2011. See page 379.Google Scholar
[448] Dillon, J. F. and Dobbertin, H.. New cyclic difference sets with Singer parameters. Finite Fields and Their Applications 10, pp. 342–389, 2004. See pages 173, 178, 230, 231, 252, 382, 395, 400, 415, and 416.Google Scholar
[449] Dillon, J. F. and McGuire, G.. Near bent functions on a hyperplane. Finite Fields and Their Applications 14 (3), pp. 715–720, 2008. See page 232.Google Scholar
[450] Dillon, J. F. and Schatz, J. R.. Block designs with the symmetric difference property. Proc. NSA Mathematical Sciences Meetings (Ward, R. L., ed.), pp. 159–164, U.S. Govt. Printing Office, 1987. www.openmathtexts.org/papers/dillon-shatz-designs.pdf. See page 201.Google Scholar
[451] Ding, C.. Optimal constant composition codes from zero-difference balanced functions. IEEE Transactions on Information Theory 54 (12), pp. 5766–5770, 2008. See page 394.Google Scholar
[452] Ding, C.. Cyclic codes from some monomials and trinomials. SIAM Journal on Discrete Mathematics 27 (4), pp. 1977–1994, 2013. See page 161.Google Scholar
[453] Ding, C.. Linear codes from some 2-designs. IEEE Transactions on Information Theory 60 (6), pp. 3265–3275, 2015. See pages 160, 189, and 263.Google Scholar
[454] Ding, C.. A construction of binary linear codes from Boolean functions. Discrete Mathematics 339 (9), pp. 2288–2303, 2016. See page 159.Google Scholar
[455] Ding, C.. A sequence construction of cyclic codes over finite fields. Cryptography and Communications 10 (2), pp. 319–341, 2018. See page 159.Google Scholar
[456] Ding, C., Heng, Z., and Zhou, Z.. Minimal binary linear codes. IEEE Transactions on Information Theory 64 (10), pp. 6536–6545, 2018. See pages 147 and 149.Google Scholar
[457] Ding, C., Li, C., and Xia, Y.. Another generalisation of the binary Reed–Muller codes and its applications. Finite Fields and Their Applications 53, pp. 144–174, 2018. See page 151.Google Scholar
[458] Ding, C., Mesnager, S., Tang, C., and Xiong, M.. Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences. arXiv:1811.07725, 2019. See page 207.Google Scholar
[459] Ding, C., Mesnager, S., Tang, C., and Xiong, M.. Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences. arXiv:1811.07725, 2019. See page 207. https://arxiv.org/abs/1808.08487. See page 270.Google Scholar
[460] Ding, C. and Niederreiter, H.. Systematic authentication codes from highly nonlinear functions. IEEE Transactions on Information Theory 50 (10), pp. 2421–2428, 2004. See page 150.Google Scholar
[461] Ding, C., Pei, D., and Salomaa, A.. Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography. World Scientific, 1996. See pages 147 and 284.Google Scholar
[462] Ding, C. and Tan, Y.. Zero-difference balanced functions with applications. Journal of Statistical Theory and Practice 6 (1), pp. 3–19, 2012. See page 394.Google Scholar
[463] Ding, C., Xiao, G. Z., and Shan, W.. The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science 561, 1991. See page 3.Google Scholar
[464] Ding, C. and Zhou, Z.. Binary cyclic codes from explicit polynomials over GF (2m). Discrete Mathematics 321, pp. 76–89, 2014. See page 161.Google Scholar
[465] Dinur, I. and Shamir, A.. Breaking Grain-128 with dynamic cube attacks. Proceedings of Fast Software Encryption FSE 2011, Lecture Notes in Computer Science 6733, pp. 167–187, 2011. See pages 97 and 114.Google Scholar
[466] Dobbertin, H.. Construction of bent functions and balanced Boolean functions with high nonlinearity. Proceedings of Fast Software Encryption FSE 1995, Lecture Notes in Computer Science 1008, pp. 61–74, 1995. See pages 81, 105, 228, and 388.Google Scholar
[467] Dobbertin, H.. one-to-one highly nonlinear power functions on GF (2 n). Applicable Algebra in Engineering, Communication and Computing (AAECC) 9 (2), pp. 139–152, 1998. See pages 402 and 418.Google Scholar
[468] Dobbertin, H.. Kasami power functions, permutation polynomials and cyclic difference sets. Proceedings of the NATO-A.S.I. Workshop “Difference Sets, Sequences and Their Correlation Properties,” Bad Windsheim, Kluwer Verlag, pp. 133–158, 1998. See page 400.Google Scholar
[469] Dobbertin, H.. Private communication, 1998. See page 385.Google Scholar
[470] Dobbertin, H.. Another proof of Kasami’s theorem. Designs, Codes and Cryptography 17, pp. 177–180, 1999. See pages 229 and 394.Google Scholar
[471] Dobbertin, H., Almost perfect nonlinear power functions on GF (2n): the Welch case. IEEE Transactions on Information Theory 45 (4), pp. 1271–1275, 1999. See page 395.Google Scholar
[472] Dobbertin, H.. Almost perfect nonlinear power functions on GF (2n): The Niho case. Information and Computation 151, pp. 57–72, 1999. See page 395.Google Scholar
[473] Dobbertin, H.. Almost perfect nonlinear power functions on GF(2n): a new case for n divisible by 5. Proceedings of Finite Fields and Applications Fq5, Augsburg, Germany. Springer, pp. 113–121, 2000. See page 401.Google Scholar
[474] Dobbertin, H.. Uniformly representable permutation polynomials. Proceedings of International Conference on Sequences and Their Applications SETA 2001 (International Conference on Sequences and Their Applications), Discrete Mathematics and Theoretical Computer Science. Springer, pp. 1–22, 2002. See pages 395 and 400.Google Scholar
[475] Dobbertin, H., Felke, P., Helleseth, T., and Rosenthal, P.. Niho type cross-correlation functions via Dickson polynomials and Kloosterman sums. IEEE Transactions on Information Theory 52 (2), pp. 613–627, 2006. See pages 222 and 247.Google Scholar
[476] Dobbertin, H. and Leander, G.. Cryptographer’s toolkit for construction of 8-bit bent functions, IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2005/089, 2005. See page 239.Google Scholar
[477] Dobbertin, H. and Leander, G.. Bent functions embedded into the recursive framework of Z-bent functions. Designs, Codes and Cryptography 49 (1–3), pp. 3–22, 2008. See pages 232, 239, and 240.Google Scholar
[478] Dobbertin, H. and Leander, G.. A survey of some recent results on bent functions. Proceeding of International Conference on Sequences and Their Applications SETA 2004 , Lecture Notes in Computer Science 3486, pp. 1–29, 2005. See page 231.Google Scholar
[479] Dobbertin, H., Leander, G., Canteaut, A., Carlet, C., Felke, P., and Gaborit, P.. Construction of bent functions via Niho power functions. Journal of Combinatorial Theory, Series A 113 (5), pp. 779–798, 2006. See pages 221, 222, 231, and 271.Google Scholar
[480] Dobraunig, C., Eichlseder, M., Grassi, L., et al. Rasta: a cipher with low ANDdepth and few ANDs per Bit. Proceedings of CRYPTO 2018 (1), Lecture Notes in Computer Science 10991, pp. 662–692, 2018. See page 454.Google Scholar
[481] Dodis, Y., Katz, J., Reyzin, L., and Smith, A.. Robust fuzzy extractors and authenticated key agreement from close secrets. Proceedings of CRYPTO 2006, Lecture Notes in Computer Science 4117, pp. 232–250, 2006. See page 450.Google Scholar
[482] Dodunekov, S. M. and Zinoviev, V. A.. A note on Preparata codes. Proceedings of Sixth Intern. Symp. on Information Theory, Moscow – Tashkent Part 2, pp. 78–80, 1984. See pages 379 and 380.Google Scholar
[483] Dong, D., Zhang, X., Qu, L. and Fu, S.. A note on vectorial bent functions. Information Processing Letters 113 (22–24), pp. 866–870, 2013. See page 272.Google Scholar
[484] Dravie, B., Parriaux, J., Guillot, P., and Millérioux, G.. Matrix representations of vectorial Boolean functions and eigenanalysis. Cryptography and Communications 8 (4), pp. 555–577, 2016. See pages 51 and 52.Google Scholar
[485] Du, Y. and Zhang, F.. On the existence of Boolean functions with optimal resistance against fast algebraic attacks. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2012/210, 2012. See page 322.Google Scholar
[486] Dubuc, S.. Characterization of linear structures. Designs, Codes and Cryptography 22, pp. 33–45, 2001. See page 100.Google Scholar
[487] Duc, A., Dziembowski, S., and Faust, S.. Unifying leakage models: from probing attacks to noisy leakage. Proceedings of EUROCRYPT 2014, Lecture Notes in Computer Science 8441, pp. 423–440, 2014 See page 429.Google Scholar
[488] Dumer, I. and Kapralova, O.. Spherically punctured Reed–Muller Codes. IEEE Transactions on Information Theory 63 (5), pp. 2773–2780, 2017. See page 460.Google Scholar
[489] Dunkelman, O. and Huang, S.. Reconstructing an S-box from its difference distribution table. IACR Transactions on Symmetric Cryptology 2019 (2), pp. 193–217, 2019. See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/811. See page 376.Google Scholar
[490] Duval, S., Lallemand, V., and Rotella, Y.. Cryptanalysis of the FLIP family of stream ciphers. Proceedings of CRYPTO (1) 2016, Lecture Notes in Computer Science 9814, pp. 457–475, 2016. See page 456.Google Scholar
[491] Dziembowski, S. and Faust, S.. Leakage-resilient cryptography from the inner-product extractor. Proceedings of ASIACRYPT 2011, Lecture Notes in Computer Science 7073, pp. 702–721, 2011. See page 446.Google Scholar
[492] Edel, Y.. Quadratic APN functions as subspaces of alternating bilinear forms. Proceedings of the Contact Forum Coding Theory and Cryptography III, Belgium 2009, pp. 11–24, 2011. See page 399.Google Scholar
[493] Edel, Y., Kyureghyan, G., and Pott, A.. A new APN function which is not equivalent to a power mapping. IEEE Transactions on Information Theory 52 (2), pp. 744–747, 2006. See pages 397, 399, and 405.Google Scholar
[494] Edel, Y. and Pott, A.. A new almost perfect nonlinear function which is not quadratic. Advances in Mathematics of Communications 3 (1), pp. 59–81, 2009. See pages 399, 402, 403, 407, 408, and 478.Google Scholar
[495] eSTREAM Project. www.ecrypt.eu.org/stream/. See pages 3, 22, 23, and 93.Google Scholar
[496] Evertse, J. H.. Linear structures in block ciphers. Proceedings of EUROCRYPT 1987, Lecture Notes in Computer Science 304, pp. 249–266, 1988. See page 99.Google Scholar
[497] Faugère, J.-C. and Ars, G.. An algebraic cryptanalysis of nonlinear filter generators using Gröbner bases. Rapport de Recherche INRIA 4739, 2003. See pages 89 and 90.Google Scholar
[498] Feng, X. and Gong, G.. On algebraic immunity of trace inverse functions over finite fields with characteristic two. Journal of Systems Science and Complexity 29 (1), pp. 272–288, 2016 and IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2013/585, 2013. See page 324.Google Scholar
[499] Feng, T., Leung, K., and Xiang, Q.. Binary cyclic codes with two primitive nonzeros. Science China Mathematics 56 (7), pp. 1403–1412, 2013.Google Scholar
[500] Feng, K., Liao, Q., and Yang, J.. Maximal values of generalized algebraic immunity. Designs, Codes and Cryptography 50, pp. 243–252, 2009. See pages 128, 337, 346, 348, and 350.Google Scholar
[501] Feng, K. and Yang, J.. Vectorial Boolean functions with good cryptographic properties. International Journal of Foundations of Computer Science 22 (6), pp. 1271–1282, 2011. See page 340.Google Scholar
[502] Feulner, T., Sok, L., Solé, P., and Wassermann, A.. Towards the classification of self-dual bent functions in eight variables. Designs, Codes and Cryptography 68 (1–3), pp. 395–406, 2013. See page 198.Google Scholar
[503] Filiol, E. and Fontaine, C.. Highly nonlinear balanced Boolean functions with a good correlation-immunity. Proceedings of EUROCRYPT 1998, Lecture Notes in Computer Science 1403, pp. 475–488, 1998. See pages 248, 292, and 360.Google Scholar
[504] Filmus, Y.. Friedgut-kalai-naor theorem for slices of the Boolean cube. Chicago J. Theor. Comput. Sci., 2016. See pages 456 and 457.Google Scholar
[505] Filmus, Y.. An orthogonal basis for functions over a slice of the Boolean hypercube. The Electronic Journal of Combinatorics 23 (1), p. P1. 23, 2016. See page 456.Google Scholar
[506] Filmus, Y. and Ihringer, F.. Boolean degree 1 functions on some classical association schemes. Journal of Combinatorial Theory, Series A 162, pp. 241–270, 2019. See page 163.Google Scholar
[507] Filmus, Y., Kindler, G., Mossel, E., and Wimmer, K.. Invariance principle on the slice. 31st Conference on Computational Complexity, CCC 2016, pp. 15:1–15:10, 2016. See page 457.Google Scholar
[508] Filmus, Y. and Mossel, E.. Harmonicity and invariance on slices of the Boolean cube. 31st Conference on Computational Complexity, CCC 2016, pp. 16:1–16:13, 2016. See page 457.Google Scholar
[509] Fischer, S. and Meier, W.. Algebraic immunity of S-boxes and augmented functions. Proceedings of Fast Software Encryption FSE 2007. Lecture Notes in Computer Science 4593, pp. 366–381, 2007. See page 95.Google Scholar
[510] Fitzgerald, R. W.. Trace forms over finite fields of characteristic 2 with prescribed invariants. Finite Fields and Their Applications 15 (1), pp. 69–81, 2009. See page 178.Google Scholar
[511] Flori, J. P. and Mesnager, S.. Dickson polynomials, hyperelliptic curves and hyper-bent functions. Proceedings of International Conference on Sequences and Their Applications SETA 2012 , Lecture Notes in Computer Science 7780, pp. 40–52, Springer, 2012. See page 247.Google Scholar
[512] Flori, J.-P. and Mesnager, S.. An efficient characterization of a family of hyper-bent functions with multiple trace terms. Journal of Mathematical Cryptology 7 (1), pp. 43–68, 2013. See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2011/373. See page 247.Google Scholar
[513] Randriambololona, J. P. Flori H., Cohen, G., and Mesnager, S.. On a conjecture about binary strings distribution. Proceedings of International Conference on Sequences and Their Applications SETA 2010 , Lecture Notes in Computer Science 6338, pp. 346–358, 2010. See page 339.Google Scholar
[514] Fon-Der-Flaass, D. G.. A bound on correlation immunity. Sib. Elektron. Mat. Izv. 4, pp. 133–135, 2007. (http://semr.math.nsc.ru/v4/p133–135.pdf). See page 285.Google Scholar
[515] Fontaine, C.. On some cosets of the first-order Reed–Muller code with high minimum weight. IEEE Transactions on Information Theory 45 (4), pp. 1237–1243, 1999. See pages 81, 248, and 292.Google Scholar
[516] Forré, R.. The strict avalanche criterion: spectral properties of Boolean functions and an extended definition. Proceedings of CRYPTO 1988, Lecture Notes in Computer Science 403, pp. 450–468, 1989. See pages 97 and 318.Google Scholar
[517] Forré, R.. A fast correlation attack on nonlinearly feedforward filtered shift register sequences. Proceedings of EUROCRYPT 1989, Lecture Notes in Computer Science 434, pp. 586–595, 1990. See page 78.Google Scholar
[518] Fourquet, R. and Tavernier, C.. List decoding of second order Reed–Muller and its covering radius implications. Proceedings of Workshop on Coding and Cryptography WCC 2007, pp. 147–156, 2007. See page 84.Google Scholar
[519] Friedgut, E.. Boolean functions with low average sensitivity depend on few coordinates. Combinatorica 18 (1), pp. 27–36, 1998 See page 102.Google Scholar
[520] Friedman, J.. On the bit extraction problem. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 314–319, 1992. See pages 87, 312, and 313.Google Scholar
[521] Fu, S. and Feng, X.. Involutory differentially 4-uniform permutations from known constructions. Designs, Codes and Cryptography 87 (1), pp. 31–56, 2018. See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2017/292. See pages 417 and 421.Google Scholar
[522] Fu, S., Feng, X., Wang, Q., and Carlet, C.. On the derivative imbalance and ambiguity of functions. IEEE Transactions on Information Theory 65 (9), pp. 5833–5845, 2019. See pages 138 and 139.Google Scholar
[523] Fu, S., Feng, X., and Wu, B.. Differentially 4-uniform permutations with the best known nonlinearity from butterflies. IACR Transactions on Symmetric Cryptology, 2017 (2), pp. 228–249, 2017. See page 421.Google Scholar
[524] Gallager, R. G.. Low Density Parity Check Codes. MIT Press, 1963. See page 78.Google Scholar
[525] Gangopadhyay, S., Gangopadhyay, A. K., Pollatos, S., and Stănică, P.. Cryptographic Boolean functions with biased inputs. Cryptography and Communications 9(2), pp. 301–314, 2017. See page 457.Google Scholar
[526] Gangopadhyay, S., Joshi, A., Leander, G., and Sharma, R. K.. A new construction of bent functions based on Z-bent functions. Designs, Codes and Cryptography 66, (1–2), pp. 243–256, 2013. See page 240.Google Scholar
[527] Gangopadhyay, S., Keskar, P. H., and Maitra, S.. Patterson–Wiedemann construction revisited. Discrete Mathematics 306, pp. 1540–1556, 2002 (selected papers from R. C. Bose Centennial Symposium on Discrete Mathemematics and Applications). See page 320.Google Scholar
[528] Gangopadhyay, S., Mandal, B., and Stănică, P.. Gowers U3 norm of some classes of bent Boolean functions. Designs, Codes and Cryptography 86 (5), pp. 1131–1148, 2018. See pages 473 and 474.Google Scholar
[529] Gangopadhyay, S., Pasalic, E., and Stănică, P.. A note on generalized bent criteria for Boolean functions. IEEE Transactions on Information Theory 59 (5), 3233–3236, 2013. See page 266.Google Scholar
[530] Gao, G., Guo, Y., and Zhao, Y.. Recent results on balanced symmetric Boolean functions. IEEE Transactions on Information Theory 62 (9), pp. 5199–5203, 2015. See page 354.Google Scholar
[531] Gao, G., Zhang, X., Liu, W., and Carlet, C.. Constructions of quadratic and cubic rotation symmetric bent functions. IEEE Transactions on Information Theory 58, 4908–4913, 2012. See pages 249 and 251.Google Scholar
[532] Gathen, J. von zur and Roche, J. R.. Polynomials with two values. Combinatorica 17 (3), pp. 345– 362, 1997. See pages 354 and 357.Google Scholar
[533] Gathen, J. von zur and Gerhard, J.. Modern Computer Algebra. Cambridge University Press, 2013 (third edition). See page 21.Google Scholar
[534] Ge, S., Wang, Z., Luo, P., and Karpovsky, M.. Reliable and secure memories based on algebraic manipulation detection codes and robust error correction. Proceedings of Int. Depend Symp. Citeseer, 2013. See page 453.Google Scholar
[535] Ge, S., Wang, Z., Luo, P., and Karpovsky, M.. Secure memories resistant to both random errors and fault injection attacks using nonlinear error correction codes. Proceedings of HASP 2013, ACM 2013, pp. 1–8, 2013. See page 452.Google Scholar
[536] Gentry, C.. Fully homomorphic encryption using ideal lattices. Proceedings of ACM STOC 2009, pp. 169–178, 2009. See page 453.Google Scholar
[537] Gentry, C., Sahai, A., and Waters, B.. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. Proceedings of CRYPTO 2013, Part I, Lecture Notes in Computer Science 8042, pp. 75–92, 2013. See pages 453 and 454.Google Scholar
[538] Gode, R. and Gangopadhyay, S.. Third-order nonlinearities of a subclass of Kasami functions. Cryptography and Communications 2, pp. 69–83, 2010. See page 85.Google Scholar
[539] Godsil, C. and Roy, A.. Two characterizations of crooked functions. IEEE Transactions on Information Theory 54 (2), pp. 864–866, 2008. See page 279.Google Scholar
[540] Gold, R.. Maximal recursive sequences with 3-valued recursive crosscorrelation functions. IEEE Transactions on Information Theory 14, pp. 154–156, 1968. See pages 394, 400, and 401.Google Scholar
[541] Goldreich, O.. Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(90), 2000. See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2000/063, 2000. See page 467.Google Scholar
[542] Goldreich, O.. Introduction to Property Testing. Cambridge University Press, 2017. See page 469.Google Scholar
[543] Goldreich, O. and Izsak, R.. Monotone circuits: one-way functions versus pseudorandom generators. Theory of Computing 8 (1), pp. 231–238, 2012. See page 467.Google Scholar
[544] Golić, J.. Fast low order approximation of cryptographic functions. Proceedings of EUROCRYPT 1996, Lecture Notes in Computer Science 1070, pp. 268–282, 1996. See page 83.Google Scholar
[545] Golić, J.. On the security of nonlinear filter generators. Proceedings of Fast Software Encryption FSE 1996, Lecture Notes in Computer Science 1039, pp. 173–188, 1996. See pages 89 and 344.Google Scholar
[546] Göloglŭ, F.. Almost bent and almost perfect nonlinear functions, exponential sums, geometries and sequences. PhD dissertation, University of Magdeburg, 2009. See page 247.Google Scholar
[547] Göloglŭ, F.. Almost perfect nonlinear trinomials and hexanomials. Finite Fields and Their Applications 33, pp. 258–282, 2015. See pages 168 and 408.Google Scholar
[548] Göloglu, F. and Pott, A.. Results on the crosscorrelation and autocorrelation of sequences. Proceedings of International Conference on Sequences and Their Applications SETA 2008 , Lecture Notes in Computer Science 5203, pp. 95–105, 2008. See pages 178, 232, and 396.Google Scholar
[549] Golomb, S. W.. On the classification of Boolean functions. IEEE Transactions on Information Theory 5 (5), pp. 176–186, 1959. See pages 52, 87, and 143.Google Scholar
[550] Golomb, S. W.. Shift Register Sequences. Aegean Park Press, 1982. See pages 20 and 384.Google Scholar
[551] Golomb, S. W.. Shift register sequences – a retrospective account. Proceedings of International Conference on Sequences and Their Applications SETA 2006 , Lecture Notes in Computer Science 4086, pp. 1–4, 2006. See page 384.Google Scholar
[552] Golomb, S. W. and Gong, G.. Signal Design for Good Correlation. Cambridge University Press, 2005. See page 384.Google Scholar
[553] Gong, G.. Sequences, DFT and resistance against fast algebraic attacks. Proceedings of International Conference on Sequences and Their Applications SETA 2008 , Lecture Notes in Computer Science 5203, pp. 197–218, 2008. See page 94.Google Scholar
[554] Gong, G. and Golomb, S. W.. Transform domain analysis of DES. IEEE Transactions on Information Theory 45 (6), pp. 2065–2073, 1999. See pages 243 and 244.Google Scholar
[555] Gong, G., Helleseth, T., and P. V. Kumar. Solomon W. Golomb – mathematician, engineer and pioneer. IEEE Transactions on Information Theory 64 (4), pp. 2844–2857, 2018 See pages 52 and 384.Google Scholar
[556] Gong, G., Rønjom, S., Helleseth, T., and Hu, H.. Fast discrete Fourier spectra attacks on stream ciphers. IEEE Transactions on Information Theory 57 (8), pp. 5555–5565, 2011. See pages 95 and 96.Google Scholar
[557] Gopalakrishnan, K., Hoffman, D. G. and Stinson, D. R.. A note on a conjecture concerning symmetric resilient functions. Information Processing Letters 47 (3), pp. 139–143, 1993. See pages 356 and 357.Google Scholar
[558] Gordon, S. D., Ishai, Y., Moran, T., Ostrovsky, R., and Sahai, A.. On complete primitives for fairness. Proceedings of Theory of Cryptography, TCC 2010, Lecture Notes in Computer Science 5978, pp. 91–108, 2010. See page 452.Google Scholar
[559] Goresky, M. and Klapper, A.. Fibonacci and Galois representation of feedback with carry shift registers. IEEE Transactions on Information Theory 48, pp. 2826–2836, 2002. See page 23.Google Scholar
[560] Goresky, M. and Klapper, A.. Periodicity and distribution properties of combined FCSR sequences. Proceedings of International Conference on Sequences and Their Applications SETA 2006 , Lecture Notes in Computer Science 4086, pp. 334–341, 2006. See page 23.Google Scholar
[561] Gorodilova, A.. On differential equivalence of APN functions. Cryptography and Communications 11 (4), pp. 793–813, 2019. Preliminary version in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2017/907. See also: On a remarkable property of APN Gold functions, IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2016/286. See page 376.Google Scholar
[562] Goubin, L. and Martinelli, A.. Protecting AES with Shamir’s secret sharing scheme. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2011, Lecture Notes in Computer Science 6917, pp. 79–94, 2011. See pages 428 and 436.Google Scholar
[563] Goudarzi, D., Joux, A., and Rivain, M.. How to securely compute with noisy leakage in quasi-linear complexity. Proceedings of ASIACRYPT 2018, Lecture Notes in Computer Science 11273, pp. 547–574, 2018. See page 431.Google Scholar
[564] Goudarzi, D., Martinelli, A., Passelegue, A., and Prest, T.. Unifying leakage models on a Rényi day. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2019/138. See page 429.Google Scholar
[565] Goudarzi, D. and Rivain, M.. On the multiplicative complexity of Boolean functions and bitsliced higher-order masking. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2016, Lecture Notes in Computer Science 9813, pp. 457–478, 2016. See page 434.Google Scholar
[566] Gouget, A.. On the propagation criterion of Boolean functions. Proceedings of the Workshop on Coding, Cryptography and Combinatorics 2003, Birkhäuser Verlag, pp. 153–168, 2004. See page 355.Google Scholar
[567] Gouget, A. and Sibert, H.. Revisiting correlation-immunity in filter generators. Proceedings of SAC 2007, Lecture Notes in Computer Science 4876, pp. 378–395, 2007. See page 89.Google Scholar
[568] Gowers, W. T.. A new proof of Szemerédi’s theorem. Geom. Funct. Anal. 11 (3), pp. 465–588, 2001. See pages 469, 470, 471, and 473.Google Scholar
[569] Gowers, W. T. and Milicevic, L.. A quantitative inverse theorem for the U4 norm over finite fields, 2017 (https://arxiv.org/pdf/1712.00241.pdf). See page 470.Google Scholar
[570] Grassl, M.. Code tables: bounds on the parameters of various types of codes. Available at www.codetables.de/, Universitat Karlsruhe. See pages 6 and 316.Google Scholar
[571] Green, B.. Finite field models in additive combinatorics. Proceedings of British Combinatorial Conference 2005 , Surveys in Combinatorics, pp. 1–27, https://arxiv.org/pdf/math/0409420.pdf, 2005. See pages 469 and 470.Google Scholar
[572] Green, B. and Tao, T.. An inverse theorem for the Gowers U3 norm (arXiv:math/0503014 [math.NT]), 2006. See page 473.Google Scholar
[573] Green, B. and Tao, T.. The distribution of polynomials over finite fields, with applications to the Gowers norms. arXiv/0711.3191, 2007. See page 474.Google Scholar
[574] Gross, H. and , S. Mangard Reconciling d + 1 masking in hardware and software. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2017, Lecture Notes in Computer Science 10529, pp. 115–136, 2017. See page 444.Google Scholar
[575] Gross, H., Mangard, S., and Korak, T.. Domain-oriented masking: compact masked hardware implementations with arbitrary protection order. Proceedings of the 2016 ACM Workshop on Theory of Implementation Security (TIS) and IACR Cryptology ePrint Archive (http://eprint.iacr .org/) 2016/486, 2016. See page 444.Google Scholar
[576] Grover, L.. A fast quantum mechanical algorithm for database search. Proceedings of ACM STOC 1996, pp. 212–219, 1996 (also Bell Labs, New Jersey, Tech. Rep., 1996). See page 3.Google Scholar
[577] Guilley, S., Heuser, A., and Rioul, O.. Codes for side-channel attacks and protections. Proceedings of C2SI, Lecture Notes in Computer Science 10194, pp. 35–55, 2017. See page 429.Google Scholar
[578] Guillot, P.. Partial bent functions. Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, SCI 2000, 2000. See page 258.Google Scholar
[579] Guillot, P.. Completed GPS covers all bent functions. Journal of Combinatorial Theory, Series A 93, pp. 242–260, 2001. See pages 69 and 242.Google Scholar
[580] Gupta, K. and Sarkar, P.. Improved construction of nonlinear resilient S-boxes. Proceedings of ASIACRYPT 2002, Lecture Notes in Computer Science 2501, pp. 466–483, 2002. See pages 315 and 316.Google Scholar
[581] Gupta, K. and Sarkar, P.. Construction of perfect nonlinear and maximally nonlinear multiple-output Boolean functions satisfying higher order strict avalanche criteria. IEEE Transactions on Information Theory 50, pp. 2886–2894, 2004. See page 318.Google Scholar
[582] Gupta, K. C. and Sarkar, P.. Computing partial Walsh transform from the algebraic normal form of a Boolean function. IEEE Transactions on Information Theory 55 (3), pp. 1354–1359, 2009. See page 57.Google Scholar
[583] Guruswami, V. and Wootters, M.. Repairing Reed–Solomon codes. IEEE Transactions on Information Theory 63 (9), pp. 5684–5698, 2017. See page 146.Google Scholar
[584] Halevi, S. and Shoup, V.. Algorithms in HeLib. Proceedings of CRYPTO 2014, Lecture Notes in Computer Science 8616, pp. 554–571, 2014. See page 454.Google Scholar
[585] Hamming, R. W.. Error detecting and error correcting codes. The Bell System Technical Journal 29 (2), pp. 147–160, 1950. See page 5.Google Scholar
[586] Hammons, A. R., Kumar, P. V., Calderbank, A. R., Sloane, N. J. A., and Solé, P.. The Z 4 -linearity of Kerdock, Preparata, Goethals and related codes. IEEE Transactions on Information Theory 40, pp. 301–319, 1994. See page 255.Google Scholar
[587] Han, H. and Tang, C.. New classes of even-variable Boolean functions with optimal algebraic immunity and very high nonlinearity. International Journal of Advanced Computer Technology 5 (2), pp. 419–428, 2013. See page 340.Google Scholar
[588] Harrison, M. A.. On the classification of Boolean functions by the general linear and affine groups. Journal of the Society for Industrial and Applied Mathematics 12 (2), pp. 285–299, 1964. See page 143.Google Scholar
[589] Hawkes, P. and O’Connor, L.. XOR and Non-XOR differential probabilities. Proceedings of EUROCRYPT 1999, Lecture Notes in Computer Science 1592, pp. 272–285, 1999. See page 136.Google Scholar
[590] Hawkes, P. and Rose, G.. Rewriting variables: the complexity of fast algebraic attacks on stream ciphers. Proceedings of CRYPTO 2004 , Lecture Notes in Computer Science 3152, pp. 390–406, 2004. See page 94.Google Scholar
[591] Hedayat, A. S., Sloane, N. J. A., and Stufken, J.. Orthogonal Arrays, Theory and Applications. Springer Series in Statistics, 1999. See pages 87, 303, and 304.Google Scholar
[592] Helleseth, T.. Some results about the cross-correlation function between two maximal linear sequences. Discrete Mathematics 16 (3), pp. 209–232, 1976. See pages 72 and 372.Google Scholar
[593] Helleseth, T.. Open problems on the cross-correlation of m-sequences. Proceeding of the Conference Open Problems in Mathematical and Computational Sciences, September 18–20, 2013, Istanbul, Turkey. Springer, pp. 163–179, 2014. See page 384.Google Scholar
[594] Helleseth, T. and Kholosha, A.. On the equation x2l +1 + x + a = 0 over GF (2k). Finite Fields and Their Applications 14 (1), pp. 159–176, 2008. See page 495.Google Scholar
[595] Helleseth, T. and Kholosha, A.. x2l +1 + x + a and related affine polynomials over GF (2k). Cryptography and Communications 2 (1), pp. 85–109, 2010. See page 495.Google Scholar
[596] Helleseth, T., Kholosha, A., and Mesnager, S.. Niho bent functions and Subiaco hyperovals. Proceedings of the 10-th International Conference on Finite Fields and Their Applications (Fq’10), Contemporary Mathematics, 579, pp. 91–101, 2012. See pages 221 and 222.Google Scholar
[597] Helleseth, T., Kløve, T., and Mykkelveit, J.. On the covering radius of binary codes. IEEE Transactions on Information Theory 24 (5), pp. 627–628, 1978. See page 81.Google Scholar
[598] Helleseth, T. and Kumar, P. V.. Sequences with low correlation. Handbook of Coding Theory, Pless, V. and Huffman, W. C., eds. Elsevier, vol. II, pp. 1765–1854, 1998. See page 384.Google Scholar
[599] Helleseth, T. and Mattson, H. F.. On the cosets of the simplex code. Discrete Mathematics 56, pp. 169–189, 1985. See page 262.Google Scholar
[600] Helleseth, T. and Rønjom, S.. Simplifying algebraic attacks with univariate analysis. Proceedings of Information Theory and Applications Workshop, ITA 2011 , San Diego, California, USA, February 6–11, 2011, pp. 153–159, 2011. See pages 95, 326, and 327.Google Scholar
[601] Helleseth, T. and Zinoviev, V.. On Z4 -linear Goethals codes and Kloosterman sums. Designs, Codes and Cryptography 17, pp. 269–288, 1999. See page 402.Google Scholar
[602] Heng, Z., Ding, C., and Zhou, Z.. Minimal linear codes over finite fields. Finite Fields and Their Applications 54, pp. 176–196, 2018. See page 149.Google Scholar
[603] Hernando, F. and McGuire, G.. Proof of a conjecture on the sequence of exceptional numbers, classifying cyclic codes and APN functions. Journal of Algebra 343 (1), pp. 78–92, 2011. See page 404.Google Scholar
[604] Hertel, D. and Pott, A., Two results on maximum nonlinear functions, Designs, Codes and Cryptography 47 (1–3), pp. 225–235, 2008. See page 418.Google Scholar
[605] Hirose, S. and Ikeda, K.. Complexity of Boolean functions satisfying the propagation criterion. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 78 (4), pp. 470–478, 1995. Presented at 1995 Symposium on Cryptography and Information Security, SCIS95-B3.3, 1995. See page 318.Google Scholar
[606] Hoch, J. J. and Shamir, A.. Fault analysis of stream ciphers. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2004, Lecture Notes in Computer Science 3156, Springer, pp. 240–253, 2004. See page 427.Google Scholar
[607] Hofer, R. and Winterhof, A.. r-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm. Cryptography and Communications 11 (5), pp. 993–998, 2019. See page 85.CrossRefGoogle Scholar
[608] Hollmann, H. and Xiang, Q.. A proof of the Welch and Niho conjectures on crosscorrelations of binary m-sequences. Finite Fields and Their Applications 7, pp. 253–286, 2001. See page 395.CrossRefGoogle Scholar
[609] Horadam, K.. Hadamard Matrices and Their Applications. Princeton University Press, 2006. See page 53.Google Scholar
[610] Hou, X.-D.. Some results on the covering radii of Reed–Muller codes. IEEE Transactions on Information Theory 39 (2), pp. 366–378, 1993. See page 158.Google Scholar
[611] Hou, X.-D.. Classification of cosets of the Reed–Muller code R(m − 3, m). Discrete Mathematics, 128, pp. 203–224, 1994. See page 155.Google Scholar
[612] Hou, X.-D.. The covering radius of R(1, 9) in R(4, 9). Designs, Codes and Cryptography 8 (3), pp. 285–292, 1995. See page 158.Google Scholar
[613] Hou, X.-D.. AGL(m, 2) acting on R(r, m)/R(s, m). Journal of Algebra 171, pp. 921–938, 1995. See pages 144 and 155.CrossRefGoogle Scholar
[614] Hou, X.-D.. Covering radius of the Reed–Muller code R(1, 7) – a simpler proof. Journal of Combinatorial Theory, Series A 74, pp. 337–341, 1996. See page 158.Google Scholar
[615] Hou, X.-D.. GL(m, 2) acting on R(r, m)/R(r −1, m). Discrete Mathematics 149, pp. 99–122, 1996. See page 155.Google Scholar
[616] Hou, X.-D.. On the covering radius of R(1, m) in R(3, m). IEEE Transactions on Information Theory 42 (3), pp. 1035–1037, 1996. See pages 108 and 158.Google Scholar
[617] Hou, X.-D.. On the norm and covering radius of the first-order Reed–Muller codes. IEEE Transactions on Information Theory 43 (3), pp. 1025–1027, 1997. See pages 81 and 157.Google Scholar
[618] Hou, X.-D.. Cubic bent functions. Discrete Mathematics 189, pp. 149–161, 1998. See page 208.Google Scholar
[619] Hou, X.-D.. On the coefficients of binary bent functions. Proc. Amer. Math. Soc. 128 (4), pp. 987–996, 2000. See page 200.CrossRefGoogle Scholar
[620] Hou, X.-D.. New constructions of bent functions. Proceedings of the International Conference on Combinatorics, Information Theory and Statistics; Journal of Combinatorics, Information and System Sciences 25 (1–4), pp. 173–189, 2000. See pages 200, 234, and 236.Google Scholar
[621] Hou, X.-D.. On binary resilient functions. Designs, Codes and Cryptography 28 (1), pp. 93–112, 2003. See page 287.CrossRefGoogle Scholar
[622] Hou, X.-D.. Group actions on binary resilient functions. Applicable Algebra in Engineering, Communication and Computing (AAECC) 14 (2), pp. 97–115, 2003. See page 88.Google Scholar
[623] Hou, X.-D.. A note on the proof of a theorem of Katz. Finite Fields and Their Applications 11, pp. 316–319, 2005. See page 156.Google Scholar
[624] , X.-D. Hou. Affinity of permutations of F2.n Proceedings of Workshop on Coding and Cryptography WCC 2003, pp. 273–280, 2003. Completed version in Discrete Applied Mathematics 154 (2), pp. 313–325, 2006. See page 411.Google Scholar
[625] Hou, X.-D.. Explicit evaluation of certain exponential sums of binary quadratic functions. Finite Fields and Their Applications 13, pp. 843–868, 2007. See pages 173,174, 176, and 178.Google Scholar
[626] Hou, X.-D.. Classification of self dual quadratic bent functions. Designs, Codes and Cryptography 63 (2), pp. 183–198, 2012. See pages 198, 199, and 476.Google Scholar
[627] Hou, X.-D. and Langevin, P.. Results on bent functions. Journal of Combinatorial Theory, Series A 80, pp. 232–246, 1997. See pages 195 and 235.Google Scholar
[628] Hou, X.-D., Mullen, G. L., Sellers, J. A., and Yucas, J.. Reversed Dickson polynomials over finite fields. Finite Fields and Their Applications 15, pp. 748–773, 2009. See page 389.Google Scholar
[629] Hu, H. and Feng, D.. On quadratic bent functions in polynomial forms. IEEE Transactions on Information Theory 53, pp. 2610–2615, 2007. See pages 178, 206, 230, and 231.Google Scholar
[630] Hu, H. and Gong, G.. Periods on two kinds of nonlinear feedback shift registers with time varying feedback functions. International Journal of Foundations of Computer Science 22 (6), pp. 1317–1329, 2011. See page 23.Google Scholar
[631] Huang, H.. Induced subgraphs of hypercubes and a proof of the sensitivity conjecture. Annals of Mathematics 190 (3), pp. 949–955, 2019. See also arXiv preprint arXiv:1907.00847, 2019. See page 320.Google Scholar
[632] Huang, D., Tang, C., Qi, Y., and Xu, M.. New quadratic bent functions in polynomial forms with coefficients in extension fields. Applicable Algebra in Engineering, Communication and Computing (AAECC) 30, pp. 333–347, 2019. C. Tang, See also Qi, Y. and Xu, M. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2013/405, 2013. See page 206.Google Scholar
[633] Hyun, J.Y., Lee, H., and Lee, Y.. MacWilliams duality and Gleason-type theorem on self-dual bent functions. Designs, Codes and Cryptography 63 (3), pp. 295–304, 2012. See page 196.Google Scholar
[634] Hyun, J.Y., Lee, H., and Lee, Y.. Boolean functions with MacWilliams duality. Designs, Codes and Cryptography 72 (2), pp. 273–287, 2014. See page 196.Google Scholar
[635] Ireland, K. and Rosen, M.. A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics (Book 84) (second edition). Springer-Verlag, 2010. See page 486.Google Scholar
[636] Ishai, Y., Kushilevitz, E., Ostrovsky, R., and Sahai, A.. Cryptography with constant computational overhead. Proceedings of ACM STOC 2008, pp. 433–442, ACM Press, 2008. See page 467.Google Scholar
[637] Ishai, Y., Sahai, A., and Wagner, D.. Private circuits: securing hardware against probing attacks. Proceedings of CRYPTO 2003, Lecture Notes in Computer Science 2729, pp. 463–481, 2003. See pages 428 and 430.Google Scholar
[638] Iwata, T. and Kurosawa, K.. Probabilistic higher order differential attack and higher order bent functions. Proceedings of ASIACRYPT 1999, Lecture Notes in Computer Science 1716, pp. 62–74, 1999. See pages 83, 85, and 114.Google Scholar
[639] Jakobsen, T. and Knudsen, L. R.. The interpolation attack on block ciphers. Proceedings of Fast Software Encryption FSE 1997, Lecture Notes in Computer Science 1267, pp. 28–40, 1997. See page 142.Google Scholar
[640] Jansen, C. J. A. and Boekee, D. E.. The shortest feedback shift register that can generate a given sequence. Proceedings of CRYPTO 1989, Lecture Notes in Computer Science 435, pp. 90–99, 1990. See page 23.Google Scholar
[641] Janwa, H. and Wilson, R.. Hyperplane sections of Fermat varieties in P3 in char. 2 and some applications to cyclic codes. Proceedings of AAECC-10 Conference, Lecture Notes in Computer Science 673, pp. 180–194, 1993. See pages 378 and 400.Google Scholar
[642] Janwa, H., McGuire, G., and Wilson, R.. Double-error-correcting codes and absolutely irreducible polynomials over GF (2). Journal of Algebra 178, pp. 665–676, 1995. See pages 378 and 404.Google Scholar
[643] Jedlicka, D.. APN monomials over GF (2n) for infinitely many n. Finite Fields and Their Applications 13, pp. 1006–1028, 2007. See page 136.Google Scholar
[644] Jin, Q., Liu, Z., Wu, B., and Zhang, X.. A general conjecture similar to T-D conjecture and its applications in constructing Boolean functions with optimal algebraic immunity. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2011/515, 2011. See page 340.Google Scholar
[645] Johansson, T. and Jönsson, F.. Improved fast correlation attack on stream ciphers via convolutional codes. Proceedings of EUROCRYPT 1999, Lecture Notes in Computer Science 1592, pp. 347–362, 1999. See page 78.Google Scholar
[646] Johansson, T. and Jönsson, F.. Fast correlation attacks based on turbo code techniques. Proceedings of CRYPTO 1999, Lecture Notes in Computer Science 1666, pp. 181–197, 1999. See page 78.Google Scholar
[647] Johansson, T. and Jönsson, F.. Fast correlation attacks through reconstruction of linear polynomials. Proceedings of CRYPTO 2000, in Lecture Notes in Computer Science 1880, pp. 300–315, 2000. See page 78.Google Scholar
[648] Johansson, T. and Pasalic, E.. A construction of resilient functions with high nonlinearity. Proceedings of the IEEE International Symposium on Information Theory, Sorrento, Italy, pp. 494–501, 2000. See pages 314 and 316.Google Scholar
[649] Johnson, N., Jha, V., and Biliotti, M.. Handbook of Finite Translation Planes. Pure and Applied Mathematics 289. Chapman & Hall/CRC, 2007. See pages 224 and 225.Google Scholar
[650] Jönsson, F.. Some results on fast correlation attacks. PhD thesis, Lund University, 2002. See page 80.Google Scholar
[651] Jungnickel, D. and Pott, A.. Difference sets: an introduction. In Difference Sets, Sequences and Their Autocorrelation Properties. Pott, A. Kumar, P. V. Helleseth, T., and Jungnickeleds. Kluwer, D., pp. 259–295, 1999. See page 190.Google Scholar
[652] Kahn, J., Kalai, G., and Linian, N.. The influence of variables on Boolean functions. Proceedings of 29th Annual Symposium on Foundations of Computer Science (IEEE), pp. 68–80, 1988. See page 68.Google Scholar
[653] Kalai, G.. Boolean functions: influence, threshold and noise. European Congress of Mathematics, pp. 85–110, 2018. See page 68.Google Scholar
[654] Kaleyski, N.. Changing APN functions at two points. Special Issue on Boolean Functions and Their Applications 2018, Cryptography and Communications 11 (6), pp. 1165–1184, 2019 See page 373.Google Scholar
[655] Kaleyski, N.. An update on known invariants of vectorial Boolean functions. Proceedings of International Workshop on Signal Design and its Applications in Communications (IWSDA) 2019, pp. 1–3, 2019. See page 392.Google Scholar
[656] Kantor, W. M.. Symplectic groups, symmetric designs, and line ovals. Journal of Algebra 33, pp. 43–58, 1975. See page 201.Google Scholar
[657] Kantor, W. M.. An exponential number of generalized Kerdock codes. Information and Control 53, pp. 74–80, 1982. See page 255.Google Scholar
[658] Kantor, W. M.. Spreads, translation planes and Kerdock sets II. SIAM Journal on Algebraic and Discrete Methods 3, pp. 308–318, 1982. See page 255.Google Scholar
[659] Kantor, W. M.. Exponential numbers of two-weight codes, difference sets and symmetric designs. Discrete Mathematics 46 (1), pp. 95–98, 1983. See pages 192 and 226.Google Scholar
[660] Kantor, W. M.. Commutative semifields and symplectic spreads. Journal of Algebra 270, pp. 96–114, 2003. See page 217.Google Scholar
[661] Kantor, W. M.. Finite semifields. Finite Geometries, Groups, and Comput, ation (Proc. of Conf. at Pingree Park, CO Sept. 2005 ), pp. 103–114, de Gruyter, 2006. See pages 224 and 225.Google Scholar
[662] Kantor, W. M.. Bent functions generalizing Dillon’s partial spread functions. arXiv:1211.2600, 2012. See page 225.Google Scholar
[663] Kantor, W. M.. Bent functions and spreads. (https://pages.uoregon.edu/kantor/PAPERS/Bent+spreads Final.pdf), (not meant to be published), 2015. See page 217.Google Scholar
[664] Karpovsky, M. G., Kulikowski, K. J, and Wang, Z.. Robust error detection in communication and computational channels. Proceedings of Spectral Methods and Multirate Signal Processing, SMMSP2007. Citeseer, 2007. See page 447.Google Scholar
[665] Karpovsky, M. G. , Kulikowski, K. J., and Wang, Z.. On-line self error detection with equal protection against all errors. Int. J. High. Reliab. Electron. Syst. Des., 2008. See page 448.Google Scholar
[666] Karpovsky, M. G. and Nagvajara, P.. Optimal codes for the minimax criterion on error detection. IEEE Transactions on Information Theory 35 (6), pp. 1299–1305, 1989. See pages 447, 448, and 449.Google Scholar
[667] Karpovsky, M. G. and Taubin, A.. A new class of nonlinear systematic error detecting codes. IEEE Transactions on Information Theory 50 (8), pp. 1818–1820, 2004. See pages 447 and 448.Google Scholar
[668] Karpovsky, M. and Wang, Z.. Design of strongly secure communication and computation channels by nonlinear error detecting codes. IEEE Transactions on Computers 63 (11), pp. 2716–2728, 2014. See page 452.Google Scholar
[669] Kasami, T.. The weight enumerators for several classes of subcodes of the second order binary Reed–Muller codes. Information and Control 18, pp. 369–394, 1971. See pages 230, 394, 401, and 418.Google Scholar
[670] Kasami, T. and Tokura, N.. On the weight structure of the Reed–Muller codes, IEEE Transactions on Information Theory 16, pp. 752–759, 1970. See pages 157 and 181.Google Scholar
[671] Kasami, T., Tokura, N., and Azumi, S.. On the weight enumeration of weights less than 2.5d of Reed–Muller Codes. Information and Control, 30:380–395, 1976. See page 157.Google Scholar
[672] Kaşıkcı, C., Meidl, W., and Topuzoğlu, A.. Spectra of a class of quadratic functions: average behavior and counting functions. Cryptography and Communications 8 (2), pp. 191–214, 2016. See page 178.Google Scholar
[673] Katz, D. J.. Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth. Journal of Combinatorial Theory, Series A 119 (8), pp. 1644–1659, 2012. See page 73.Google Scholar
[674] Katz, D. J.. Divisibility of Weil sums of binomials. Proc. Amer. Math. Soc. 143 (11), pp. 4623–4632, 2015. See page 65.Google Scholar
[675] Katz, D. J. and Langevin, P.. New open problems related to old conjectures by Helleseth. Cryptography and Communications 8 (2), pp. 175–189, 2016. See page 73.Google Scholar
[676] Katz, D. J., Langevin, P., Lee, S., and Sapozhnikov, Y.. The p-adic valuations of Weil sums of binomials. Journal of Number Theory 181, pp. 1–26, 2017. See page 65.Google Scholar
[677] Katz, N.. On a theorem of Ax. American Journal of Mathematics 93, pp. 485–499, 1971. See page 156.CrossRefGoogle Scholar
[678] Kaufman, T. and Lovett, S.. New extension of the Weil bound for character sums with applications to coding. Proceedings of IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 788–796, 2011. See page 188.Google Scholar
[679] Kaufman, T., Lovett, S., and Porat, E.. Weight distribution and list-decoding size of Reed–Muller codes. IEEE Transactions on Information Theory 58 (5), pp. 2689–2696, 2012. See page 156.Google Scholar
[680] Kavut, S.. Results on rotation-symmetric s-boxes. Information Sciences 201, pp. 93–113, 2012. See page 362.Google Scholar
[681] Kavut, S.. Correction to the paper: Patterson–Wiedemann construction revisited. Discrete Applied Mathematics 202, pp. 185–187, 2016. See page 320.Google Scholar
[682] Kavut, S. and Baloğlu, S.. Results on symmetric S-boxes constructed by concatenation of RSSBs. Cryptography and Communications 11 (4), pp. 641–660, 2019. See page 145.Google Scholar
[683] Kavut, S., Maitra, S., and Tang, D.. Searching balanced boolean functions on even number of variables with excellent autocorrelation profile. Designs, Codes and Cryptography 87 (2–3), pp. 261–276, 2019. See page 320.Google Scholar
[684] Kavut, S., Maitra, S., and Yücel, M. D.. Search for Boolean functions with excellent profiles in the rotation symmetric class. IEEE Transactions on Information Theory 53 (5), pp. 1743–1751, 2007. See pages 81,157, 320, and 360.Google Scholar
[685] Kavut, S. and Yücel, M. D.. Generalized rotation symmetric and dihedral symmetric Boolean functions–9 variable Boolean functions with nonlinearity 242. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, pp. 321–329, 2007. See pages 82 and 362.Google Scholar
[686] Kavut, S. and Yücel, M. D.. 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class. Information and Computation 208 (4), pp. 341–350, 2010. See pages 81, 157, 158, and 360.CrossRefGoogle Scholar
[687] European Telecommunications Standards Institute. Technical Specification 135 202 V9.0.0: universal mobile telecommunications system (UMTS); LTE; specification of the 3GPP confidentiality and integrity algorithms; Document 2: KASUMI specification (3GPP TS 35.202 V9.0.0 Release 9). See page 410.Google Scholar
[688] Kerckhoffs, A.. La Cryptographie Militaire. Journal des Sciences Militaires, 1883. See page 1.Google Scholar
[689] Kerdock, A. M.. A class of low-rate non linear codes. Information and Control 20, pp. 182–187, 1972. See pages 177 and 254.Google Scholar
[690] Keren, O., Shumsky, I., and Karpovsky, M. G.. Robustness of security- oriented binary codes under non-uniform distribution of codewords. Proceedings of 6th Int. Conf. on Dependability 2013, pp. 25–30, 2013. See page 450.Google Scholar
[691] Key, J. D., McDonough, T. P., and Mavron, V. C.. Information sets and partial permutation decoding for codes from finite geometries. Finite Fields and Their Applications 12 (2), pp. 232–247, 2006. See page 335.Google Scholar
[692] Khalyavin, A. V., Lobanov, M. S. and Tarannikov, Y. V.. On plateaued Boolean functions with the same spectrum support. Sib. Elektron. Mat. Izv. 13, pp. 1346–1368, 2016. See pages 259 and 264.Google Scholar
[693] Khan, J., Kalai, G., and Linial, N.. The influence of variables on Boolean functions. IEEE 29th Symp. on Foundations of Computer Science, pp. 68–80, 1988. See page 59.Google Scholar
[694] Khan, M. A. and Özbudak, F.. Improvement in non-linearity of Carlet–Feng infinite class of Boolean functions. Cryptology and Network Security,Lecture Notes in Computer Science 7712, pp 280–295, 2012. See pages 144 and 335.Google Scholar
[695] Kholosha, A. and Pott, A.. Bent and related functions. Handbook of Finite Fields, CRC Press Book, Subsection 9.3, pp. 262–273, 2013. See page 197.Google Scholar
[696] Khoo, K. and Gong, G.. New constructions for resilient and highly nonlinear Boolean functions. Proceedings of 8th Australasian Conference, ACISP 2003 , Lecture Notes in Computer Science 2727, pp. 498–509, 2003. See pages 81, 299, and 317.Google Scholar
[697] Khoo, K., Gong, G., and Stinson, D. R.. A new family of Gold-like sequences. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2002, p. 181, 2002. See page 178.Google Scholar
[698] Khoo, K., Gong, G., and Stinson, D.. Highly nonlinear S-boxes with reduced bound on maximum correlation. Proceedings of 2003 IEEE International Symposium on Information Theory. 2003. www.cacr.math.uwaterloo.ca/techreports/2003/corr2003-12.ps. See page 133.Google Scholar
[699] Khoo, K., Gong, G., and Stinson, D.. A new characterization of semi-bent and bent functions on finite fields. Designs, Codes and Cryptography 38 (2), pp. 279–295, 2006. See pages 178, 206, 230, and 362.Google Scholar
[700] Kim, K. H. and Mesnager, S.. Solving x2k+1 +x+a = 0 in F 2n with gcd(n, k) = 1. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2019/307, 2019. See page 495.Google Scholar
[701] Kim, S. H. and No, J. S.. New families of binary sequences with low correlation. IEEE Transactions on Information Theory 49 (11), pp. 3059–3065, 2003. See page 230.Google Scholar
[702] Kjeldsen, K.. On the cycle structure of a set of nonlinear shift registers with symmetric feedback functions. Journal of Combinatorial Theory, Series A 20 (2), pp. 154–169, 1976. See page 23.Google Scholar
[703] Klapper, A. and Goresky, M.. Feedback shift registers, 2-adic span, and combiners with memory. Journal of Cryptology 10, pp. 111–147. 1997. See page 23.Google Scholar
[704] Klapper, A. and Goresky, M.. Arithmetic correlations and Walsh transforms. IEEE Transactions on Information Theory 58 (1), pp. 479–492, 2012. See page 57.Google Scholar
[705] Klimov, A. and Shamir, A.. Cryptographic applications of T-functions. Proceedings of Selected Areas in Cryptography 2003 , Lecture Notes in Computer Science 3006, pp. 248–261, 2004. See page 26.Google Scholar
[706] Knudsen, L.. Truncated and higher order differentials. Proceedings of Fast Software Encryption FSE 1995, Lecture Notes in Computer Science 1008, pp. 196–211, 1995. See pages 114, 136, and 142.Google Scholar
[707] Knudsen, L. R. and Robshaw, M. P. J.. Non-linear approximations in linear cryptanalysis. Proceedings of EUROCRYPT 1996, Lecture Notes in Computer Science 1070, pp. 224–236, 1996. See page 83.Google Scholar
[708] Knudsen, L. R. and Robshaw, M. P. J.. The Block Cipher Companion. Information Security and Cryptography. Springer, 2011. See page 26.Google Scholar
[709] Knudsen, L. R. and Wagner, D.. Integral cryptanalysis. Proceedings of Fast Software Encryption FSE 2002, Lecture Notes in Computer Science 2365, pp. 112–127, 2002. See page 114.Google Scholar
[710] Knuth, D. E.. Finite semifields and projective planes. Journal of Algebra 2, pp. 182–217, 1965. See page 226.Google Scholar
[711] Koçak, N., Mesnager, S., and F. Özbudak. Bent and semi-bent functions via linear translators. Proceedings of IMA Conference on Cryptography and Coding 2015 , Lecture Notes in Computer Science 9496, pp. 205–224, 2015. See pages 237 and 263.Google Scholar
[712] Kocher, P.. Timing attacks on implementations of Diffie–Hellman, RSA, DSS, and other systems. Proceedings of CRYPTO 1996, Lecture Notes in Computer Science 1109, pp. 104–113, 1996. See page 425.Google Scholar
[713] Kocher, P., Jaffe, J., and , B. Jun. Differential power analysis. Proceedings of CRYPTO 1999, Lecture Notes in Computer Science 1666, pp. 388–397, 1999. See pages 425, 426, and 427.Google Scholar
[714] Kolokotronis, N. and Limniotis, K.. Maiorana–McFarland Functions with high second-order nonlinearity. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2011/212. See pages 85 and 158.Google Scholar
[715] Kolokotronis, N., Limniotis, K., and Kalouptsidis, N.. Best affine and quadratic approximations of particular classes of Boolean functions. IEEE Transactions on Information Theory 55 (11), pp. 5211–5222, 2009. See pages 157 and 158.Google Scholar
[716] Kolomeec, N. A.. The graph of minimal distances of bent functions and its properties. Designs, Codes and Cryptography 85 (3), pp. 1–16, 2017. See page 205.Google Scholar
[717] Kulikowski, K. J., Karpovsky, M. G., and Taubin, A.. Robust codes and robust, fault-tolerant architectures of the advanced encryption standard. Journal of Systems Architecture 53 (2–3), pp. 139–149, 2007. See pages 448, 449, and 450.Google Scholar
[718] Kumar, P. V., Scholtz, R. A. and Welch, L. R.. Generalized bent functions and their properties. Journal of Combinatorial Theory, Series A 40, pp. 90–107, 1985. See page 193.Google Scholar
[719] Kurosawa, K., Iwata, T., and Yoshiwara, T.. New covering radius of Reed–Muller codes for t-resilient functions. Proceedings of Selected Areas in Cryptography, 8th Annual International Workshop, Lecture Notes in Computer Science 2259, pp. 75 ff, 2001, and IEEE Transactions on Information Theory 50, pp. 468–475, 2004. See page 287.Google Scholar
[720] Kurosawa, K., Johansson, T., and Stinson, D.. Almost k-wise independent sample spaces and their applications. Journal of Cryptology 14 (4), pp. 231–253, 2001. See page 290.Google Scholar
[721] Kurosawa, K. and Matsumoto, R.. Almost security of cryptographic Boolean functions. IEEE Transactions on Information Theory 50 (11), pp. 2752–2761, 2004. See pages 97 and 290.Google Scholar
[722] Kurosawa, K. and Satoh, T.. Design of SAC/PC(ℓ) of order k Boolean functions and three other cryptographic criteria. Proceedings of EUROCRYPT 1997, Lecture Notes in Computer Science 1233, pp. 434–449, 1997. See pages 319 and 320.Google Scholar
[723] Kurosawa, K., Satoh, T., and Yamamoto, K.. Highly nonlinear t-resilient functions. Journal of Universal Computer Science 3 (6), pp. 721–729, 1997. See pages 314 and 316.Google Scholar
[724] Kutzner, S., Nguyen, P. Ha, and Poschmann, A.. Enabling 3-share threshold implementations for all 4-bit s-boxes. Proceedings of ICISC 2013, Lecture Notes in Computer Science 8565, pp. 91–108, 2013. See page 441.Google Scholar
[725] Kuzmin, A. S., Markov, V. T., Nechaev, A. A. and Shishkov, A. B.. Approximation of Boolean functions by monomial ones. Discrete Mathematics and Applications 16 (1), pp. 7–28, 2006. See page 246.Google Scholar
[726] Kyureghyan, G.. Differentially affine maps. Proceedings of the Workshop on Coding and Cryptography, WCC 2005, pp. 296–305, 2005. See page 373.Google Scholar
[727] Kyureghyan, G.. Crooked maps in finite fields. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb’05), Discrete Mathematics & Theoretical Computer Science Proceedings, pp. 167–170, 2005. See pages 278 and 373.Google Scholar
[728] Kyureghyan, G.. The only crooked power functions are x2k +2l . European Journal of Combinatorics 28 (4), pp. 1345–1350, 2007. See pages 278 and 373.Google Scholar
[729] Kyureghyan, G.. Crooked maps in F 2n. Finite Fields and Their Applications 13 (3), pp. 713–726, 2007. See pages 278 and 373.Google Scholar
[730] Kyureghyan, G.. Special mappings of finite fields. Finite Fields and Their Applications, Radon Ser. Comput. Appl. Math. 11, pp. 117–144, De Gruyter, Berlin, 2013. See page 278.Google Scholar
[731] Kyureghyan, G. and Suder, V.. On inversion in Z 2n −1. Finite Fields and Their Applications 25, pp. 234–254, 2014. See pages 177 and 394.Google Scholar
[732] Lacharme, P.. Post processing functions for a physical random number generator. Proceedings of Fast Software Encryption FSE 2008, Lecture Notes in Computer Science 5086, pp 334–342, 2008. See page 290.Google Scholar
[733] Lachaud, G. and Wolfmann, J.. The weights of the orthogonals of the extended quadratic binary goppa codes. IEEE Transactions on Information Theory 36, pp. 686–692, 1990. See pages 72, 215, and 402.Google Scholar
[734] Lahtonen, J., McGuire, G., and Ward, H.. Gold and Kasami–Welch functions, quadratic forms and bent functions. Advances in Mathematics of Communications 1, pp. 243–250, 2007. See pages 178, 231, 395, and 396.Google Scholar
[735] Lai, X.. Higher order derivatives and differential cryptanalysis. Proceedings of the”Symposium on Communication, Coding and Cryptography”, in honor of J. L. Massey on the Occasion of his 60’th birthday, pp. 227–233, 1994. See pages 38, 114, and 142.Google Scholar
[736] Lai, X.. Additive and linear structures of cryptographic functions. Proceedings of Fast Software Encryption FSE 1995, Lecture Notes in Computer Science 1008, pp. 75–85, 1995. See page 100.Google Scholar
[737] Langevin, P.. Covering radius of RM(1, 9) in RM(3, 9). Eurocode 1990 , Lecture Notes in Computer Science 514, pp. 51–59, 1991. See page 63.Google Scholar
[738] Langevin, P.. On the orphans and covering radius of the Reed–Muller codes. Proceedings of AAECC-9 Conference, Lecture Notes in Computer Science 539, pp. 234–240, 1991. See page 262.Google Scholar
[739] Langevin, P. and Leander, G.. Classification of Boolean quartic forms in eight variables. NATO Science for Peace and Security Series – D: Information and Communication Security, IOS Press, vol. 18: Boolean Functions in Cryptology and Information Security, pp. 139–147, 2008. See page 144.Google Scholar
[740] Langevin, P. and Leander, G.. Monomial bent functions and Stickelberger’s theorem. Finite Fields and Their Applications 14 (3), pp. 727–742, 2008. See page 156.Google Scholar
[741] Langevin, P. and Leander, G.. Counting all bent functions in dimension eight 99270589265934370305785861242880. Designs, Codes and Cryptography 59 (1–3), pp. 193–205, 2011 (see also the proceedings of WCC 2009). See pages 144 and 208.Google Scholar
[742] Langevin, P., Leander, G., McGuire, G., and Zalinescu, E.. Analysis of Kasami–Welch functions in odd dimension using Stickelberger’s theorem. Journal of Combinatorics and Number Theory 2 (1), pp. 55–72, 2010. See page 396.Google Scholar
[743] Langevin, P., Leander, G., Rabizzoni, P., Veron, P., and Zanotti, J.-P.. Webpage http://langevin.univ-tln.fr/project/quartics/. See pages 208 and 243.Google Scholar
[744] Langevin, P., Rabizzoni, P., Veron, P., and Zanotti, J.-P.. On the number of bent functions with 8 variables. Proceedings of the Conference BFCA 2006, Publications des universités de Rouen et du Havre, pp. 125–136, 2007. See page 243.Google Scholar
[745] Langevin, P. and Solé, P.. Kernels and defaults. (Proceedings of the Conference Finite Fields and Applications Fq4) Contemporary Mathematics 225, pp. 77–85, 1999. See page 181.Google Scholar
[746] Langevin, P. and Véron, P.. On the nonlinearity of power functions. Designs, Codes and Cryptography 37 (1), pp. 31–43, 2005. See pages 73 and 156.Google Scholar
[747] Langevin, P. and Zanotti, J.-P.. Nonlinearity of some invariant Boolean functions. Designs, Codes and Cryptography 36, pp. 131–146, 2005. See page 81.CrossRefGoogle Scholar
[748] Lauradoux, C. and Videau, M.. Matriochka symmetric Boolean functions. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2008 pp. 1631–1635, 2008. See page 362.Google Scholar
[749] Leander, G.. Bent functions with 2 r Niho exponents. Proceedings of the Workshop on Coding and Cryptography 2005, pp. 454–461, 2005. See pages 221 and 231.Google Scholar
[750] Leander, G.. Monomial bent functions. Proceedings of the Workshop on Coding and Cryptography 2005, Bergen, pp. 462–470, 2005. And IEEE Transactions on Information Theory 52 (2), pp. 738–743, 2006. See pages 215, 230, and 246.CrossRefGoogle Scholar
[751] Leander, G.. Another class of non-normal bent functions. Proceedings of the Conference BFCA 2006, Publications des universités de Rouen et du Havre, pp. 87–98, 2006.Google Scholar
[752] Leander, G. and Kholosha, A.. Bent functions with 2r Niho exponents. IEEE Transactions on Information Theory. 52 (12), pp. 5529–5532, 2006. See pages 221 and 231.Google Scholar
[753] Leander, G. and Langevin, P.. On exponents with highly divisible Fourier–Hadamard coefficients and conjectures of Niho and Dobbertin. Proceedings of “The First Symposium on Algebraic Geometry and Its Applications” Dedicated to Gilles Lachaud (SAGA’07), 2007, World Scientific, Series on Number Theory and Its Applications 5, pp. 410–418, 2008. See page 390.Google Scholar
[754] Leander, G. and McGuire, G.. Spectra of functions, subspaces of matrices, and going up versus going down. Proceedings of AAECC-17 Conference, Lecture Notes in Computer Science 4851, pp. 51–66, 2007. See page 232.Google Scholar
[755] Leander, G. and McGuire, G.. Construction of bent functions from near-bent functions. Journal of Combinatorial Theory, Series A 116, pp. 960–970, 2009. See page 232.Google Scholar
[756] Leander, G. and Poschmann, A.. On the classification of 4 bit S-boxes. Proceedings of International Workshop on the Arithmetic of Finite Fields WAIFI 2007, Lecture Notes in Computer Science 4547, pp. 159–176, 2007. See pages 144 and 417.Google Scholar
[757] Leander, G. and Rodier, F.. Bounds on the degree of APN polynomials: the case of x−1 + g(x). Designs, Codes and Cryptography 59 (1–3), pp. 207–222, 2011. See page 401.Google Scholar
[758] Bars, J.-M. Le and Viola, A.. Equivalence classes of Boolean functions for first-order correlation. IEEE Transactions on Information Theory 56 (3), pp. 1247–1261, 2010. See page 313.Google Scholar
[759] Lechner, R. J.. Harmonic analysis of switching functions. Recent Developments in Switching Theory, Academic Press, pp. 121–228, 1971. See page 58.Google Scholar
[760] Levenshtein, V. I.. Split orthogonal arrays and maximum independent resilient systems of functions. Designs, Codes and Cryptography 12 (2), pp. 131–160, 1997. See page 129.Google Scholar
[761] Li, J., Carlet, C., Zeng, X., Li, C., Hu, L., and Shan, J.. Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks. Designs, Codes and Cryptography 76 (2), pp. 279–305, 2015. See page 340.Google Scholar
[762] Li, K., Qu, L., Sun, B., and Li, C.. New results about the boomerang uniformity of permutation polynomials. IEEE Transactions on Information Theory 65 (11), pp. 7542–7553, 2019. Also: arXiv preprint arXiv:1901.10999, 2019 – arxiv.org. See page 142.Google Scholar
[763] Li, N., Helleseth, T., Kholosha, A., and Tang, X.. On the Walsh transform of a class of functions from Niho exponents. IEEE Transactions on Information Theory 59 (7), pp. 4662–4667, 2013. See page 222.Google Scholar
[764] Li, N., Helleseth, T., Tang, X. and Kholosha, A.. Several new classes of bent functions from Dillon exponents. IEEE Transactions on Information Theory 59 (3), pp. 1818–1831, 2013. See pages 231 and 247.Google Scholar
[765] Li, N. and Qi, W.-F.. Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity. IEEE Transactions on Information Theory 52 (5), pp. 2271–2273, 2006. See page 357.Google Scholar
[766] Li, N. and Qi, W.-F.. Construction and analysis of Boolean functions of 2t + 1 variables with maximum algebraic immunity. Proceedings of ASIACRYPT 2006, Lecture Notes in Computer Science 4284, pp. 84–98, 2006. See page 336.Google Scholar
[767] Li, N., Qu, L., Qi, W.-F., Feng, G., Li, C., and Xie, D.. On the construction of Boolean functions with optimal algebraic immunity. IEEE Transactions on Information Theory 54 (3), pp. 1330–1334, 2008. See page 336.Google Scholar
[768] Li, N., Tang, X. and Helleseth, T.. New Constructions of Quadratic Bent Functions in Polynomial Form. IEEE Transactions on Information Theory 60 (9), pp. 5760–5767, 2014. See page 206.Google Scholar
[769] Li, N. and Zeng, X.. A survey on the applications of Niho exponents. Cryptography and Communications 11 (3), pp. 1–40, 2018. See pages 169, 220, and 222.Google Scholar
[770] Li, Y.. Characterization of robust immune symmetric boolean functions. Cryptography and Communications 7 (3), pp. 297–315, 2015. See page 91.Google Scholar
[771] Li, Y. and Wang, M.. The nonexistence of permutations EA-equivalent to certain AB functions. IEEE Transactions on Information Theory 59 (1), pp. 672–679, 2013. See pages 30 and 397.Google Scholar
[772] Li, Y. and Wang, M.. Constructing differentially 4-uniform permutations over GF (22m) from quadratic APN permutations over GF (22m+1). Designs, Codes and Cryptography 72 (2), pp. 249–264, 2014. See page 419.Google Scholar
[773] Li, Y., Wang, M., and Yu, Y.. Constructing differentially 4-uniform permutations over GF (22k) from the inverse function revisited. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2013/731, 2013. See page 421.Google Scholar
[774] Liao, Q., Liu, F., and Feng, K.. On (2m +1)-variable symmetric Boolean functions with submaximum algebraic immunity 2m−1 . Science China Mathematics 52(1), pp. 17–28, 2009. See page 358.Google Scholar
[775] Lidl, R. and Niederreiter, H.. Finite Fields. Cambridge University Press, vol. 20, 1997 See pages 41, 112, 187, 248, 254, and 480.Google Scholar
[776] Limniotis, K. and Kolokotronis, N.. Boolean functions with maximum algebraic immunity: further extensions of the Carlet–Feng construction. Designs, Codes and Cryptography 86 (8), pp. 1685–1706, 2018. See page 341.Google Scholar
[777] Limniotis, K., Kolokotronis, N., and Kalouptsidis, N.. Secondary constructions of Boolean functions with maximum algebraic immunity. Cryptography and Communications 5, pp. 179–199, 2013. See page 340.Google Scholar
[778] Lin, S. J., Han, Y. S. and Yu, N.. New Locally Correctable Codes Based on Projective Reed-Muller Codes. IEEE Transactions on Information Theory 67 (6), pp. 3834–3841, 2019. See page 151.Google Scholar
[779] Linial, N., Mansour, Y., and Nisan, N.. Constant depth circuits, Fourier transform, and learnability. Journal of the Association for Computing Machinery 40 (3), pp. 607–620, 1993. See pages 59 and 62.Google Scholar
[780] Lint, J. H.. Introduction to Coding Theory. Springer, 1982. See page 4.Google Scholar
[781] Lisoněk, P.. On the connection between Kloosterman sums and elliptic curves. Proceedings of International Conference on Sequences and Their Applications SETA 2008 , Lecture Notes in Computer Science 5203, pp. 182–187, 2008. See page 215.Google Scholar
[782] Lisoněk, P.. An efficient characterization of a family of hyperbent functions. IEEE Transactions on Information Theory 57 (9), pp. 6010–6014, 2011. See page 247.Google Scholar
[783] Lisoněk, P. and Marko, M.. On zeros of Kloosterman sums. Designs, Codes and Cryptography 59, pp. 223–230, 2011. See page 251.Google Scholar
[784] Litsyn, S. and Shpunt, A.. On the distribution of Boolean function nonlinearity. SIAM Journal on Discrete Mathematics 23 (1), pp. 79–95, 2008. See page 80.Google Scholar
[785] Liu, F. and Feng, K.. On the 2m -variable symmetric Boolean functions with maximum algebraic immunity 2m−1 . Proceedings of Workshop on Coding and Cryptography WCC 2007, pp. 225–232, 2007. See page 358.Google Scholar
[786] Liu, F. and Feng, K.. Efficient computation of algebraic immunity of symmetric Boolean functions. Proceedings of TAMC 2007, Lecture Notes in Computer Science 4484, pp. 318–329, 2007. See page 358.Google Scholar
[787] Liu, J. and Mesnager, S.. Weightwise perfectly balanced functions with high weightwise nonlinearity profile. Designs, Codes and Cryptography 87 (8), pp. 1797–1813, 2019; see also CoRR abs/1709.02959 (2017). See page 458.Google Scholar
[788] Liu, J., Mesnager, S., and Chen, L.. On the nonlinearity of S-boxes and linear codes. Cryptography and Communications 9 (3), pp. 345–361, 2017. See pages 122 and 161.Google Scholar
[789] Liu, M. and Lin, D.. Almost perfect algebraic immune functions with good nonlinearity. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2014, pp. 1837–1841, 2014, and IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2012/498. See pages 322 and 340.Google Scholar
[790] Liu, M. and Lin, D.. Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks. Information Sciences 421, pp. 181–203, 2017. See page 340.Google Scholar
[791] http://arxiv.org/abs/0910.4632). See pages 94, 322, and 358.Google Scholar
[792] Liu, M., Lin, D., and Pei, D.. Results on the immunity of Boolean functions against probabilistic algebraic attacks. Proceedings of ACISP 2011, Lecture Notes in Computer Science 6812, pp. 34–46, 2011. See page 331.Google Scholar
[793] Liu, M., Zhang, Y., and Lin, D.. Perfect algebraic immune functions. Proceedings of ASIACRYPT 2012, Lecture Notes in Computer Science 7658, pp. 172–189, 2012. See pages 322, 331, and 338.Google Scholar
[794] Liu, M., Zhang, Y., and Lin, D.. On the immunity of Boolean functions against fast algebraic attacks using bivariate polynomial representation. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2012/498, 2012. See pages 334 and 340.Google Scholar
[795] Liu, Y., Rijmen, V., and Leander, G.. Nonlinear diffusion layers. Designs, Codes and Cryptography 86 (11), pp. 2469–2484, 2018. See page 162.Google Scholar
[796] Liu, Z. and Wu, B.. Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields. J. Systems Science & Complexity 32 (1), pp. 356–374, 2019. See page 340.Google Scholar
[797] Lloyd, S.. Properties of binary functions. Proceedings of EUROCRYPT 1990, Lecture Notes in Computer Science 473, pp. 124–139, 1991. See pages 58 and 320.Google Scholar
[798] Lobanov, M.. Tight bound between nonlinearity and algebraic immunity. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2005/441, 2005. See page 331.Google Scholar
[799] Lobanov, M.. Exact relation between nonlinearity and algebraic immunity. Discrete Mathematics and Applications 16 (5), pp. 453–460, 2006. See page 331.Google Scholar
[800] Lobanov, M.. Tight bounds between algebraic immunity and nonlinearities of high orders. NATO Science for Peace and Security Series – D: Information and Communication Security, IOS Press, vol 18: Boolean Functions in Cryptology and Information Security, pp. 296–306, 2008, and IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2007/444, 2007 and Journal of Applied and Industrial Mathematics 3 (3), pp. 367–376, 2009 (title: Exact relations between nonlinearity and algebraic immunity) and private communication. See pages 328, 329, and 331.Google Scholar
[801] Lobanov, M.. A method for obtaining lower bounds on the higher order nonlinearity. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2013/332, 2013. See pages 329 and 332.Google Scholar
[802] Logachev, O. A., Salnikov, A. A. and Yashchenko, V. V.. Bent functions on a finite Abelian group. Discrete Mathematics and Applications 7 (6), pp. 547–564, 1997. See pages 193 and 212.Google Scholar
[803] Lomné, V., Prouff, E., and Roche, T.. Behind the scene of side channel attacks. Proceedings of ASIACRYPT 2013, Lecture Notes in Computer Science 8269, pp. 506–525, 2013. See page 427.Google Scholar
[804] Lou, Y., Han, H., Tang, C., Wu, Z., and Xu, M.. Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition. International Journal of Computer Mathematics 92 (3), pp. 451–462, 2015 (preliminary version by Y. Lou, , Han, H. Tang, C., and , M. Xu, IACR Cryptology ePrint Archive http://eprint.iacr.org/, 2012/335, 2012). See pages 168, 271, and 351.Google Scholar
[805] Lovett, S., Meshulam, R., and Samorodnitsky, A.. Inverse conjecture for the Gowers norm is false. Proceedings of ACM STOC 2008, pp. 547–556, 2008. See page 474.Google Scholar
[806] Luo, G., Cao, X., and Mesnager, S.. Several new classes of self-dual bent functions derived from involutions. Special Issue on Boolean Functions and Their Applications 2018, Cryptography and Communications 11 (6), pp. 1261–1273, 2019. See page 199.Google Scholar
[807] Lupanov, O. B.. On circuits of functional elements with delay. Probl. Kibern. 23, pp. 43–81, 1970. See page 103.Google Scholar
[808] Ma, W., Lee, M., and Zhang, F.. A new class of bent functions. EICE Trans. Fundamentals E88-A (7), pp. 2039–2040, 2005. See pages 230 and 250.Google Scholar
[809] MacWilliams, F. J. and Sloane, N. J.. The Theory of Error-Correcting Codes. North Holland, 1977. See pages 4, 7, 12, 13, 14, 15, 16, 44, 105, 107, 124, 128, 152, 153, 155, 156, 172, 173, 289, 333, 347, 353, 355, 359, 388, and 487.Google Scholar
[810] Maghrebi, H., Carlet, C., Guilley, S., and Danger, J.-L.. Optimal first-order masking with linear and non-linear bijections. Proceedings of AFRICACRYPT, Lecture Notes in Computer Science 7374, pp. 60–377, 2012. See pages 431 and 432.Google Scholar
[811] Maghrebi, M., Guilley, S., and Danger, J.-L.. Leakage squeezing countermeasure against high-order attacks. Proceedings of WISTP, Lecture Notes in Computer Science 6633, pp. 208–223, 2011. See page 431.Google Scholar
[812] Maiorana, J. A.. A classification of the cosets of the Reed–Muller code R(1, 6). Mathematics of Computation 57 (195), pp. 403–414, 1991. See pages 144 and 155.Google Scholar
[813] Maitra, S.. Highly nonlinear balanced Boolean functions with very good autocorrelation property. Proceedings of the Workshop on Coding and Cryptography 2001, Electronic Notes in Discrete Mathematics, Elsevier, vol. 6, pp. 355–364, 2001. See page 99.Google Scholar
[814] Maitra, S.. Autocorrelation properties of correlation immune Boolean functions. Proceedings of INDOCRYPT 2001, Lecture Notes in Computer Science 2247, pp. 242–253, 2001. See pages 288, 290, and 292.Google Scholar
[815] Maitra, S.. Boolean functions on odd number of variables having nonlinearity greater than the bent concatenation bound. NATO Science for Peace and Security Series – D: Information and Communication Security, IOS Press, vol 18: Boolean Functions in Cryptology and Information Security, pp. 173–182, 2008. See pages 81 and 82.Google Scholar
[816] Maitra, S., Kavut, S., and Yücel, M.. Balanced Boolean function on 13-variables having nonlinearity greater than the Bent concatenation bound. Proceedings of the Conference BFCA 2008 , Copenhagen, pp. 109–118, 2008. See pages 81 and 82.Google Scholar
[817] Maitra, S. and Pasalic, E.. Further constructions of resilient Boolean functions with very high nonlinearity. IEEE Transactions on Information Theory 48 (7), pp. 1825–1834, 2002. See page 295.Google Scholar
[818] Maitra, S. and Sarkar, P.. Maximum nonlinearity of symmetric Boolean functions on odd number of variables. IEEE Transactions on Information Theory 48, pp. 2626–2630, 2002. See page 356.Google Scholar
[819] Maitra, S. and Sarkar, P.. Highly nonlinear resilient functions optimizing Siegenthaler’s inequality. Proceedings of CRYPTO 1999, Lecture Notes in Computer Science 1666, pp. 198–215, 1999. See page 292.Google Scholar
[820] Maitra, S. and Sarkar, P.. Modifications of Patterson–Wiedemann functions for cryptographic applications. IEEE Transactions on Information Theory 48, pp. 278–284, 2002. See pages 81 and 320.Google Scholar
[821] Maity, S. and Maitra, S.. Minimum distance between bent and 1-resilient Boolean functions. Proceedings of Fast Software Encryption FSE 2004 , Lecture Notes in Computer Science 3017, pp. 143–160, 2004. See page 297.Google Scholar
[822] Mandal, B., Stănică, P., Gangopadhyay, S., and Pasalic, E.. An analysis of the C class of bent functions. Fundamenta Informaticae 146 (3), pp. 271–292, 2016. See page 211.Google Scholar
[823] Mangard, S., Oswald, E., and Popp, T.. Power Analysis Attacks: Revealing the Secrets of Smart Cards. Springer, 2006. www.dpabook.org/. See page 425.Google Scholar
[824] Mann, H. B.. Addition Theorems. Inderscience, 1965. See page 197.Google Scholar
[825] Maschietti, A.. Difference sets and hyperovals. Designs, Codes and Cryptography 14 (1), pp. 89–98, 1998. See page 416.Google Scholar
[826] Massey, J. L.. Shift-register analysis and BCH decoding. IEEE Transactions on Information Theory 15, pp. 122–127, 1969. See pages 21 and 76.Google Scholar
[827] Massey, J. L.. Minimal codewords and secret sharing. Proceedings of 6th Joint Swedish–Russian Workshop on Information Theory, Mlle, Sweden, August 22–27, 1993 See pages 146, 148, and 432.Google Scholar
[828] Massey, J. L.. Randomness, arrays, differences and duality. IEEE Transactions on Information Theory 48, pp. 1698–1703, 2002. See page 88.Google Scholar
[829] Matsui, M.. Linear cryptanalysis method for DES cipher. Proceedings of EUROCRYPT 1993, Lecture Notes in Computer Science 765, pp. 386–397, 1994. See pages 79, 115, and 121.Google Scholar
[830] Matsui, M.. Block encryption algorithm MISTY. Proceedings of Fast Software Encryption FSE 1997, Lecture Notes in Computer Science 1267, pp. 54–68, 1997. See pages 410 and 442.Google Scholar
[831] Maurer, U. M.. New approaches to the design of self-synchronizing stream ciphers. Proceedings of EUROCRYPT 1991, Lecture Notes in Computer Science 547, pp. 458–471, 1991. See page 83.Google Scholar
[832] https://arxiv.org/pdf/1804.00200), 2018. See page 1.Google Scholar
[833] McEliece, R. J.. Weight congruence for p-ary cyclic codes. Discrete Mathematics, 3, pp. 177–192, 1972. See pages 13 and 156.Google Scholar
[834] McFarland, R. L.. A family of noncyclic difference sets. Journal of Combinatorial Theory, Series A 15, pp. 1–10, 1973. See pages 165 and 209.Google Scholar
[835] McGuire, G. and Calderbank, A. R.. Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-sequences. IEEE Transactions on Information Theory 41 (4), pp. 1153–1155, 1995. See page 275.Google Scholar
[836] McLaughlin, J. and Clark, J. A.. Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2013/011, 2013. See page 335.Google Scholar
[837] McLoughlin, A.. The covering radius of the (m − 3)rd-order Reed–Muller codes and a lower bound on the (m−4)th-order Reed–Muller codes. SIAM Journal on Applied Mathematics 37, pp. 419–422, 1979. See page 158.Google Scholar
[838] Méaux, P., Carlet, C., Journault, A., and Standaert, F.-X.. Improved filter permutators for efficient FHE: better instances and implementations. Proceedings of Indocrypt 2019, Lecture Notes in Computer Science 11898, pp. 68–91, 2019. See page 469.Google Scholar
[839] Méaux, P., Journault, A., Standaert, F.-X., and Carlet, C.. Towards stream ciphers for efficient FHE with low-noise ciphertexts. Proceedings of EUROCRYPT 2016, Lecture Notes in Computer Science 9665, pp. 311–343, 2016. See pages 232, 321, 363, 453, 454, 455, and 456.Google Scholar
[840] Meidl, W., Roy, S. and Topuzoğlu, A.. Enumeration of quadratic functions with prescribed Walsh spectrum. IEEE Transactions on Information Theory 60, pp. 6669–6680, 2014. See page 178.Google Scholar
[841] Meidl, W. and Topuzoğlu, A.. Quadratic functions with prescribed spectra. Designs, Codes and Cryptography 66, pp. 257–273, 2013. See page 178.Google Scholar
[842] Meier, W., Pasalic, E., and Carlet, C.. Algebraic attacks and decomposition of Boolean functions. Proceedings of EUROCRYPT 2004, Lecture Notes in Computer Science 3027, pp. 474–491, 2004. See pages 76, 90, and 91.Google Scholar
[843] Meier, W. and Staffelbach, O.. Fast correlation attacks on stream ciphers. Proceedings of EURO-CRYPT 1988, Lecture Notes in Computer Science 330, pp. 301–314, 1988. See pages 76, 78, 103, and 115.Google Scholar
[844] Meier, W. and Staffelbach, O.. Nonlinearity criteria for cryptographic functions. Proceedings of EUROCRYPT 1989, Lecture Notes in Computer Science 434, pp. 549–562, 1990. See pages 76, 101, and 103.Google Scholar
[845] Meier, W. and Staffelbach, O.. Correlation properties of combiners with memory in stream ciphers. Proceedings of EUROCRYPT 1990, Lecture Notes in Computer Science 473, pp. 204–213, 1990. See page 286.Google Scholar
[846] Menezes, A., Oorschot, P. van, and Vanstone, S.. Handbook of Applied Cryptography. CRC Press Series on Discrete Mathematics and Its Applications, 1996. See page 2.Google Scholar
[847] Meng, Q., Chen, L., and Fu, F.-W.. On homogeneous rotation symmetric bent functions. Discrete Applied Mathematics 158 (10), pp. 111–1117, 2010. See page 248.Google Scholar
[848] Meng, Q., Zhang, H., Yang, M., and Cui, J.. On the degree of homogeneous bent functions. Discrete Applied Mathematics 155 (5), pp. 665–669, 2007. See page 248.Google Scholar
[849] Mesnager, S.. Improving the lower bound on the higher order nonlinearity of Boolean functions with prescribed algebraic immunity. IEEE Transactions on Information Theory 54 (8), pp. 3656–3662, 2008. Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2007/117, 2007. See page 331.Google Scholar
[850] Mesnager, S.. On the number of resilient Boolean functions. Proceedings of “The First Symposium on Algebraic Geometry and Its Applications” Dedicated to Gilles Lachaud (SAGA’07), Tahiti, 2007, Published by World Scientific, Series on Number Theory and Its Applications 5, pp. 419–433, 2008. See page 312.Google Scholar
[851] Mesnager, S.. A new family of hyper-bent Boolean functions in polynomial form. Proceedings of IMA Conference on Cryptography and Coding 2009 , Lecture Notes in Computer Science 5921, pp. 402–417, 2009. See pages 231 and 246.Google Scholar
[852] Mesnager, S.. Hyper-bent Boolean functions with multiple trace terms. Proceedings of International Workshop on the Arithmetic of Finite Fields WAIFI 2010, Lecture Notes in Computer Science 6087, pp. 97–113, 2010. See pages 231 and 247.Google Scholar
[853] Mesnager, S.. A new class of bent and hyper-bent Boolean functions in polynomial forms. Designs, Codes and Cryptography 59 (1–3), pp. 265–279, 2011. See pages 231 and 246.Google Scholar
[854] Mesnager, S.. Bent and hyper-bent functions in polynomial form and their link with some exponential sums and Dickson polynomials. IEEE Transactions on Information Theory 57 (9), pp. 5996–6009, 2011. See pages 189 and 272.Google Scholar
[855] Mesnager, S.. Semi-bent functions from Dillon and Niho exponents, Kloosterman sums, and Dickson polynomials. IEEE Transactions on Information Theory 57, pp. 7443–7458, 2011. See page 263.Google Scholar
[856] Mesnager, S.. Semi-bent functions with multiple trace terms and hyperelliptic curves. Proceeding of International Conference on Cryptology and Information Security in Latin America (IACR), Latincrypt 2012 , Lecture Notes in Computer Science 7533. CpbfcCPM, pp. 18–36, 2012. See page 263.Google Scholar
[857] Mesnager, S.. Semi-bent functions from oval polynomials. Proceedings of IMA Conference on Cryptography and Coding 2013 , Lecture Notes in Computer Science 8308, pp. 1–15, 2013. See page 263.Google Scholar
[858] Mesnager, S.. Characterizations of plateaued and bent functions in characteristic p. Proceedings of International Conference on Sequences and Their Applications SETA 2014 , Lecture Notes in Computer Science 8865, pp. 72–82, 2014. See pages 258, 261, and 281.Google Scholar
[859] Mesnager, S.. On semi-bent functions and related plateaued functions over the Galois field F 2n. Proceedings of the Conference Open Problems in Mathematical and Computational Sciences, September 18–20, 2013, in Istanbul, Turkey, Springer, pp. 243–273, 2014. See pages 262 and 263.Google Scholar
[860] Mesnager, S.. Several new infinite families of bent functions and their duals. IEEE Transactions on Information Theory 60 (7), pp. 4397–4407, 2014. See page 237.Google Scholar
[861] Mesnager, S.. Bent functions from spreads. Proceedings of the 11th International Conference on Finite Fields and Their Applications (Fq’11), Journal of the American Mathematical Society (AMS), Contemporary Mathematic 632, pp. 295–316, 2015. See page 223.Google Scholar
[862] Mesnager, S.. Bent vectorial functions and linear codes from o-polynomials. Designs, Codes and Cryptography. 77 (1), pp. 99–116, 2015. See pages 149, 161, and 271.Google Scholar
[863] Mesnager, S.. A note on constructions of bent functions from involutions. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2015/982, 2015. See page 237.Google Scholar
[864] Mesnager, S.. Further constructions of infinite families of bent functions from new permutations and their duals. Cryptography and Communications 8 (2), pp. 229–246, 2016. See page 237.Google Scholar
[865] Mesnager, S.. Bent functions: Fundamentals and Results. Springer, pp. 1–544, 2016. See pages 189 and 190.Google Scholar
[866] Mesnager, S.. Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptography and Communications 9 (1), pp. 71–84, 2017 (preliminary version available in IACR Cryptology ePrint Archive, http://eprint.iacr.org/2015/1103). See page 189.Google Scholar
[867] Mesnager, S.. Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptography and Communications 9 (1), pp. 71–84, 2017. See page 147.Google Scholar
[868] Mesnager, S. and Cohen, G.. On the link of some semi-bent functions with Kloosterman sums. Proceedings of International Workshop on Coding and Cryptology, IWCC 2011, Lecture Notes in Computer Science 6639, Springer, pp. 263–272, 2011. See page 263.Google Scholar
[869] Mesnager, S. and Cohen, G.. Cyclic codes and algebraic immunity of Boolean functions. Proceedings of ITW 2015, pp. 1–5, 2015. See page 327.Google Scholar
[870] Mesnager, S. and Cohen, G.. Fast algebraic immunity of Boolean functions. Advances in Mathematics of Communications 11 (2), pp. 373–377, 2017. See pages 94 and 323.Google Scholar
[871] Mesnager, S. and Flori, J. P.. Hyper-bent functions via Dillon-like exponents. IEEE Transactions on Information Theory 59 (5), pp. 3215–3232, 2013. See pages 231, 247, and 362.Google Scholar
[872] Mesnager, S., McGrew, G., Davis, J., Steele, D., and Marsten, K.. A comparison of Carlet’s second-order nonlinearity bounds. International Journal of Computer Mathematics 94 (3), pp. 427–436, 2017. See page 86.Google Scholar
[873] Mesnager, S., Ongan, P., and F. Özbudak. New bent functions from permutations and linear translators. Proceedings of C2SI 2017, Lecture Notes in Computer Science 10194, pp. 282–297, 2017. See page 237.Google Scholar
[874] Mesnager, S., Özbudak, F., and Sınak, A.. Linear codes from weakly regular plateaued functions and their secret sharing schemes. Designs, Codes and Cryptography 87 (2–3), pp. 463–480, 2019. See pages 147 and 262.Google Scholar
[875] Mesnager, S., Tang, C., and Xiong, M.. On the boomerang uniformity of quadratic permutations over F2n. IACR Cryptology ePrint Archive (http://eprint.iacr.org/2019/277 and arXiv preprint arXiv:1903.00501, 2019 – arxiv.org). See page 142.Google Scholar
[876] Mesnager, S. and Zhang, F.. On constructions of bent, semi-bent and five valued spectrum functions from old bent functions. Advances in Mathematics of Communications 11 (2), pp. 339–345, 2017. See pages 233 and 263.Google Scholar
[877] Mesnager, S., Zhang, F., Tang, C., and Zhou, Y.. Further study on the maximum number of bent components of vectorial functions. Designs, Codes and Cryptography 87 (11), pp. 2597–2610, 2019. Also: arXiv:1801.06542. See page 243.Google Scholar
[878] Mesnager, S., Zhou, Z., and Ding, C.. On the nonlinearity of Boolean functions with restricted input. Cryptography and Communications 11 (1), pp. 63–76, 2019. See page 460.Google Scholar
[879] Messerges, T.S.. Using Second-order Power Analysis to Attack DPA Resistant software. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2000 , Lecture Notes in Computer Science 1965, pp. 238–251, 2000. See page 427.Google Scholar
[880] Micali, S. and Reyzin, L.. Physically observable cryptography (extended abstract). Proceedings of TCC, Lecture Notes in Computer Science 2951, pp. 278–296, 2004. See page 429.Google Scholar
[881] Mihaljevic, M. J., Gangopadhyay, S., Paul, G., and Imai, H.. Generic cryptographic weakness of k-normal boolean functions in certain stream ciphers and cryptanalysis of grain-128. Periodica Mathematica Hungarica 65 (2), pp. 205–227, 2012. See page 105.Google Scholar
[882] Millan, W.. Low order approximation of cipher functions. Proceedings of Cryptographic Policy and Algorithms, Lecture Notes in Computer Science 1029, pp. 144–155, 1996. See page 83.Google Scholar
[883] Millan, W., Burnett, L., Carter, G., Clark, A., and Dawson, E.. Evolutionary heuristics for finding cryptographically strong S-boxes. Proceedings of Information and Communication Security, Lecture Notes in Computer Science 1726, pp. 263–274, 1999. See page 145.Google Scholar
[884] Millan, W., Clark, A. and Dawson, E.. An effective genetic algorithm for finding highly nonlinear boolean functions. Proceedings of ICICS 1997, Lecture Notes in Computer Science 1334, pp. 149–158, 1997. See page 144.Google Scholar
[885] Millan, W., Clark, A., and Dawson, E.. Heuristic design of cryptographically strong balanced Boolean functions. Proceedings of EUROCRYPT 1998, Lecture Notes in Computer Science 1403, pp. 489–499, 1998.Google Scholar
[886] Minsky, M. and Papert, S. A.. Perceptrons: An Introduction to Computational Geometry. Reissue of the 1988 Expanded Edition. MIT Press, 2017. See page 47.Google Scholar
[887] Mitchell, C. J.. Enumerating Boolean functions of cryptographic signifiance. Journal of Cryptology 2 (3), pp. 155–170, 1990. See pages 356 and 357.Google Scholar
[888] Moradi, A., Poschmann, A., Ling, S., Paar, C., and Wang, H.. Pushing the limits: a very compact and a threshold implementation of AES. Proceedings of EUROCRYPT 2011, Lecture Notes in Computer Science 6632, pp. 69–88, 2011.Google Scholar
[889] Mossel, E., Shpilka, A., and Trevisan, L.. On e-biased generators in NC0. Proceedings of 44th FOCS, pp. 136–145. IEEE Computer Society Press, 2003. See page 468.Google Scholar
[890] Mullen, G. and Panario, D.. Handbook of Finite Fields. CRC Press Book, 2013. See pages 20, 41, 76, 248, 254, 389, 480, and 488.Google Scholar
[891] Muller, D. E.. Application of boolean algebra to switching circuit design and to error detection. Trans. I.R.E. Prof. Group on Electronic Computers, 3 (3), pp. 6–12, 1954. See page 151.Google Scholar
[892] Muratović-Ribić, A., Pasalic, E., and Bajrić, S.. Vectorial bent functions from multiple terms trace Functions. IEEE Transactions on Information Theory 60 (2), pp. 1337–1347, 2014. See page 272.Google Scholar
[893] Muratović-Ribić, A., Pasalic, E., and Bajrić, S.. Vectorial hyperbent trace functions from the PSap Class – Their Exact Number and Specification. IEEE Transactions on Information Theory 60 (7), pp. 4408–4413, 2014. See page 272.Google Scholar
[894] Mykkelveit, J.. The covering radius of the [128,8] Reed–Muller code is 56. IEEE Transactions on Information Theory 26 (3), pp. 359–362, 1980. See pages 81 and 157.Google Scholar
[895] Nakagawa, N.. On equations of finite fields of characteristic 2 and APN functions. AKCE International Journal of Graphs and Combinatorics 12, pp. 75–93, 2015. See page 383.Google Scholar
[896] Nakagawa, N. and Yoshiara, S.. A construction of differentially 4-uniform functions from commutative semifields of characteristic 2. Proceedings of International Workshop on the Arithmetic of Finite Fields WAIFI 2007, Lecture Notes in Computer Science 4547, pp. 134–146, 2007. See pages 394 and 422.Google Scholar
[897] Nassar, M., Guilley, S., and Danger, J.-L.. Formal analysis of the entropy/security trade-off in first-order masking countermeasures against side-channel attacks. Proceedings of INDOCRYPT 2011, Lecture Notes in Computer Science 7107, pp. 22–39, 2011. See page 429.Google Scholar
[898] Nassar, M., Souissi, Y., Guilley, S., and Danger, J.-L.. RSM: a small and fast countermeasure for AES, secure against 1st and 2nd-order zero-offset SCAs. Proceedings of 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE 2012) IEEE 2012, pp. 1173–1178, 2012. See page 432.Google Scholar
[899] Nawaz, Y., Gong, G., and Gupta, K.. Upper bounds on algebraic immunity of power functions. Proceedings of Fast Software Encryption FSE 2006, Lecture Notes in Computer Science 4047, pp. 375–389, 2006. See page 323.Google Scholar
[900] Nawaz, Y., Gupta, K., and Gong, G.. Algebraic immunity of S-boxes based on power mappings: analysis and construction. IEEE Transactions on Information Theory 55 (9), pp. 4263–4273, 2009 (preliminary version available in IACR Cryptology ePrint Archive http://eprint.iacr.org/2006/322). See page 323.Google Scholar
[901] Project, NESSIE. www.cosic.esat.kuleuven.be/nessie/. See pages 3 and 23.Google Scholar
[902] Niho, Y.. Multi-valued cross-correlation functions between two maximal linear recursive sequences. PhD dissertation, University of Southern California, Los Angeles, 1972. See page 169.Google Scholar
[903] Nikova, S., Rechberger, C., and Rijmen, V.. Threshold implementations against side-channel attacks and glitches. Proceedings of ICICS 2006, Lecture Notes in Computer Science 4307, pp. 529–545, 2006. See pages 437, 440, and 441.Google Scholar
[904] Nikova, S., Rijmen, V., and Schläffer, M.. Secure hardware implementation of nonlinear functions in the presence of glitches. Journal of Cryptology 24 (2), pp. 292–321, 2011. See pages 437 and 440.Google Scholar
[905] Nisan, N. and Szegedy, M.. On the degree of Boolean functions as real polynomials. Comput. Complexity 4, pp. 301–313, 1994. See pages 47, 48, 62, 67, 68, and 320.Google Scholar
[906] Nyberg, K.. Perfect non-linear S-boxes. Proceedings of EUROCRYPT 1991, Lecture Notes in Computer Science 547, pp. 378–386, 1992. See pages 135, 190, 269, 270, and 314.Google Scholar
[907] Nyberg, K.. On the construction of highly nonlinear permutations. Proceedings of EUROCRYPT 1992, Lecture Notes in Computer Science 658, pp. 92–98, 1993. See pages 28, 117, 135, 177, and 316.Google Scholar
[908] Nyberg, K.. Differentially uniform mappings for cryptography. Proceedings of EUROCRYPT 1993, Lecture Notes in Computer Science 765, pp. 55–64, 1994. See pages 135, 137, 394, 395, 400, 401, and 417.Google Scholar
[909] Nyberg, K.. New bent mappings suitable for fast implementation. Proceedings of Fast Software Encryption FSE 1993, Lecture Notes in Computer Science 809, pp. 179–184, 1994. See page 270.Google Scholar
[910] Nyberg, K.. S-boxes and round functions with controllable linearity and differential uniformity. Proceedings of Fast Software Encryption FSE 1994, Lecture Notes in Computer Science 1008, pp. 111–130, 1995. See pages 136, 372, 391, and 411.Google Scholar
[911] Nyberg, K.. Multidimensional Walsh transform and a characterization of bent functions. Proceedings of the IEEE Information Theory Workshop ITW 2007, pp. 1–4, 2007. See page 74.Google Scholar
[912] Nyberg, K. and Knudsen, L. R.. Provable security against differential cryptanalysis. Journal of Cryptology 8 (1), pp. 27–37, 1995, (extended version of the Proceedings of CRYPT0’ 92, Lecture Notes in Computer Science 740, pp. 566–574, 1993). See pages 135 and 137.Google Scholar
[913] O’Connor, L.. On the distribution of characteristics in bijective mappings. Proceedings of EURO-CRYPT 1993, Lecture Notes in Computer Science 765, pp. 360–370, 1993. See page 136.Google Scholar
[914] O’Donnell, R.. Analysis of Boolean Functions. Cambridge University Press, 2014. See pages 37, 59, 68, 102, and 358.Google Scholar
[915] O’Donnell, R. and Witmer, D.. Goldreich’s PRG: evidence for near-optimal polynomial stretch. IEEE Conference on Computational Complexity 2014, pp. 1–12, 2014. See page 468.Google Scholar
[916] Ogata, W. and Kurosawa, K.. Optimum secret sharing scheme secure against cheating. Proceedings of EUROCRYPT 1996, Lecture Notes in Computer Science 1070, pp. 200–211, 1996. See page 452.Google Scholar
[917] Olejár, D. and Stanek, M.. On cryptographic properties of random Boolean functions. Journal of Universal Computer Science 4 (8), pp. 705–717, 1998. See page 80.Google Scholar
[918] Olmez, O.. Plateaued functions and one-and-half difference sets. Designs, Codes and Cryptography 76 (3), pp. 537–549, 2015. See page 259.Google Scholar
[919] Olsen, J. D., Scholtz, R. A., and Welch, L. R.. Bent-function sequences. IEEE Transactions on Information Theory 28 (6), pp. 858–864, 1982. See page 189.Google Scholar
[920] Oswald, E., Mangard, S., Herbst, C., and Tillich, S.. Practical second-order DPA attacks for masked smart card implementations of block ciphers. Proceedings of CT-RSA 2006 , Lecture Notes in Computer Science 3860, pp. 192–207, 2006. See page 427.Google Scholar
[921] Panario, D., Sakzad, A., Stevens, B., Thomson, D., and Wang, Qiang. Ambiguity and deficiency of permutations over finite fields with linearized difference map. IEEE Transactions on Information Theory 59 (9), pp. 5616–5626, 2013. See page 139.Google Scholar
[922] Panario, D., Sakzad, A., Stevens, B., and Wang, Q.. Two new measures for permutations: ambiguity and deficiency. IEEE Transactions on Information Theory 57 (11), pp. 7648–7657, 2011. See page 139.Google Scholar
[923] Panario, D., Sakzad, A., and Thomson, D.. Ambiguity and deficiency of reversed Dickson permutations. Proceedings of Fq13, Contemporary Mathematics: Topics in Finite Fields 632, pp. 347–358, 2013. See page 139.Google Scholar
[924] Panario, D., Santana, D., and Wang, Q.. Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields. Finite Fields and Their Applications 47, pp. 330–350, 2017. See page 139.Google Scholar
[925] Panario, D., Stevens, B., and Wang, Q.. Ambiguity and deficiency in Costas arrays and APN permutations. Proceedings of LATIN 2010, Lecture Notes in Computer Science 6034, pp. 397–406, 2010. See page 139.Google Scholar
[926] Park, S. M., Lee, S., Sung, S. H., and Kim, K.. Improving bounds for the number of correlation-immune Boolean functions. Information Processing Letters 61, pp. 209–212, 1997. See page 312.Google Scholar
[927] Parker, M. G. and Pott, A.. On Boolean functions which are bent and negabent. Sequences, Subsequences, and Consequences, Lecture Notes in Computer Science 4893, pp. 9–23, 2007. See pages 266 and 267.Google Scholar
[928] Pasalic, E.. Maiorana–McFarland class: degree optimization and algebraic properties. IEEE Transactions on Information Theory 52 (10), pp. 4581–4594, 2006. See page 295.Google Scholar
[929] Pasalic, E.. Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysis. Proceedings of ICISC 2008, Lecture Notes in Computer Science 5461, pp. 399–414, 2008. See pages 322 and 336.Google Scholar
[930] Pasalic, E.. A note on nonexistence of vectorial bent functions with binomial trace representation in the PS- class. Information Processing Letters 115 (2), pp. 139–140, 2015. See page 272.Google Scholar
[931] Pasalic, E.. Corrigendum to “a note on nonexistence of vectorial bent functions with binomial trace representation in the PS- class” [Information Processing Letters 115 (2) (2015) 139–140].Information Processing Letters 115 (4): 520, 2015. See page 272.Google Scholar
[932] Pasalic, E., Hodžić, S., Zhang, F., and Wei, Y.. Bent functions from nonlinear permutations and conversely. Cryptography and Communications 11 (2), pp. 207–225, 2019. See page 236.Google Scholar
[933] Pasalic, E. and Maitra, S.. Linear codes in generalized construction of resilient functions with very high nonlinearity. IEEE Transactions on Information Theory 48, pp. 2182–2191, 2002, completed version of a paper published in the Proceedings of Selected Areas in Cryptography, SAC 2001, Lecture Notes in Computer Science 2259, pp. 60–74, 2002. See pages 315 and 316.Google Scholar
[934] Pasalic, E., Maitra, S., Johansson, T., and Sarkar, P.. New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity. Proceedings of the Workshop on Coding and Cryptography 2001, published by Electronic Notes in Discrete Mathematics, Elsevier, vol. 6, pp. 425–434, 2001. See pages 291, 295, and 300.Google Scholar
[935] Pasalic, E. and Zhang, W.-G.. On multiple output bent functions. Information Processing Letters 112 (21), pp. 811–815, 2012. See page 272.Google Scholar
[936] Patterson, N. J. and Wiedemann, D. H.. The covering radius of the [215 , 16] Reed–Muller code is at least 16276. IEEE Transactions on Information Theory 29, pp. 354–356, 1983. See pages 81, 157, and 543.Google Scholar
[937] Patterson, N. J. and Wiedemann, D. H.. Correction to . IEEE Transactions on Information Theory 36 (2), pp. 443, 1990. See pages 81 and 157.Google Scholar
[938] Peng, J. and Tan, C. H.. New explicit constructions of differentially 4-uniform permutations via special partitions of F22k . Finite Fields and Their Applications 40, pp. 73–89, 2016. See page 420.Google Scholar
[939] Peng, J. and Tan, C. H.. New differentially 4-uniform permutations by modifying the inverse function on subfields. Cryptography and Communications 9 (3), pp. 363–378, 2017. See pages 420 and 421.Google Scholar
[940] Peng, J., Tan, C. H., and Wang, Q.. A new family of differentially 4-uniform permutations over F 2k for odd k. Science China Mathematics 59 (6), pp. 1221–1234, 2016. See pages 420 and 421.Google Scholar
[941] Peng, J., Wu, Q., and Kan, H.. On symmetric Boolean functions with high algebraic immunity on even number of variables. IEEE Transactions on Information Theory 57 (10), pp. 7205–7220, 2011. See page 358.Google Scholar
[942] Penttila, T. (Joint work with L. Budaghyan, C. Carlet, T. Helleseth, and A. Kholosha). Projective equivalence of ovals and EA-equivalence of Niho bent functions. Invited talk at the Finite Geometries Fourth Irsee Conference (2014). See pages 220 and 221.Google Scholar
[943] Perrin, L., Canteaut, A., and Tian, S.. If a generalised butterfly is APN then it operates on 6 bits. Special Issue on Boolean Functions and Their Applications 2018, Cryptography and Communications 11 (6), pp. 1147–1164, 2019. See page 411.Google Scholar
[944] Perrin, L., Udovenko, A., and Biryukov, A.. Cryptanalysis of a theorem: decomposing the only known solution to the big APN problem. Proceedings of CRYPTO 2016, Lecture Notes in Computer Science 9815, part II, pp. 93–122, 2016. See pages 411 and 421.Google Scholar
[945] Picek, S., Carlet, C., Guilley, S., Miller, J. F., and Jakobovic, D.. Evolutionary algorithms for Boolean functions in diverse domains of cryptography. Evolutionary Computation 24 (4), pp. 667–694, 2016. See page 144.Google Scholar
[946] Picek, S., Guilley, S., Carlet, C., Jakobovic, D., and Miller, J. F.. Evolutionary approach for finding correlation immune Boolean functions of order t with minimal hamming weight. Proceedings of TPNC 2015, Lecture Notes in Computer Science 9477, pp. 71–82, 2015. See pages 144 and 305.Google Scholar
[947] Picek, S. and Jakobovic, D.. Evolving algebraic constructions for designing bent Boolean functions. Proceedings of the Genetic and Evolutionary Computation Conference GECCO 2016, pp. 781–788, 2016. See page 144.Google Scholar
[948] Picek, S., Knezevic, K., and Jakobovic, D.. On the evolution of bent (n, m) functions. Proceedings of CEC 2017, pp. 2137–2144, 2017. See page 145.Google Scholar
[949] Picek, S., Knezevic, K., Jakobovic, D., and Carlet, C.. A search for differentially-6 uniform (n, n − 2) functions. Proceedings of IEEE CEC 2018. See pages 145 and 424.Google Scholar
[950] Picek, S., Mariot, L., Yang, B., Jakobovic, D., and Mentens, N.. Design of S-boxes defined with cellular automata rules. Proceedings of the Computing Frontiers Conference, CF’17, pp. 409–414, 2017. See page 145.Google Scholar
[951] Picek, S., McKay, R. I., Santana, R., and Gedeon, T.. Fighting the symmetries: the structure of cryptographic Boolean function spaces. Proceedings of the Conference on Genetic and Evolutionary Computation GECCO 2015, pp. 457–464, 2015. See page 144.Google Scholar
[952] Picek, S., Sisejkovic, D., and Jakobovic, D.. Immunological algorithms paradigm for construction of Boolean functions with good cryptographic properties. Engineering Applications of Artificial Intelligence 62, pp. 320–330, 2017. See page 144.Google Scholar
[953] Picek, S., Yang, B., Rozic, V., and Mentens, N.. On the construction of hardware-friendly 4 × 4 and 5 × 5 S-boxes. Proceedings of Selected Areas in Cryptography – SAC 2016 , Lecture Notes in Computer Science 10532, pp. 161–179, 2016. See page 145.Google Scholar
[954] Pieprzyk, J. and Qu, C.. Fast hashing and rotation symmetric functions, Journal of Unversal Computer Science 5, pp. 20–31, 1999. See page 248.Google Scholar
[955] Pieprzyk, J. and Zhang, X.-M.. Computing Möbius transforms of Boolean functions and characterizing coincident Boolean functions. Proceedings of the Conference BFCA 2007, Publications des universités de Rouen et du Havre, 2007. See page 37.Google Scholar
[956] Pirsic, G. and Winterhof, A.. Boolean functions derived from pseudorandom binary sequences. Proceedings of International Conference on Sequences and Their Applications SETA 2012 , Lecture Notes in Computer Science 7280, pp. 101–109, 2012. See page 104.Google Scholar
[957] Piret, G., Roche, T., and Carlet, C.. PICARO – a block cipher allowing efficient higher-order side-channel resistance. Proceedings of ACNS 2012, Lecture Notes in Computer Science 7341, pp. 311–328, 2012. See pages 26, 112, 142, 189, and 422.Google Scholar
[958] Pless, V.. Power moment identities on weight distributions in error-correcting codes. Information and Control 6, pp. 147–152, 1963. See page 381.Google Scholar
[959] Pless, V. S. Huffman, W. C., eds., , R. A. Brualdi , assistant editor. Handbook of Coding Theory. Elsevier, 1998. See pages 20, 21, and 156.Google Scholar
[960] Poussier, R., Guo, Q., Standaert, F.-X., Carlet, C., and Guilley, S.. Connecting and improving direct sum masking and inner product masking. Proceedings of CARDIS 2017, Lecture Notes in Computer Science 10728, pp. 123–141, 2017. See pages 445 and 446.Google Scholar
[961] Pott, A., Pasalic, E., Muratović-Ribić, A., and Bajrić, S.. Vectorial quadratic bent functions as a product of two linearized polynomials. Proceedings of Workshop on Coding and Cryptography WCC, 2015. See page 272.Google Scholar
[962] Pott, A., Pasalic, E., Muratović-Ribić, A., and Bajrić, S.. On the maximum number of bent components of vectorial functions. IEEE Transactions on Information Theory 64 (1), pp. 403–411, 2018. See page 243.Google Scholar
[963] Pott, A., Schmidt, K.-U., and Zhou, Y.. Semifields, relative difference sets, and bent functions. Proceedings of the Workshop “Emerging Applications of Finite Fields”, Algebraic Curves and Finite Fields, Radon Series on Computational and Applied Mathematics, de Gruyter, pp. 161–177, 2014. See pages 217 and 269.Google Scholar
[964] Pott, A., Tan, Y., Feng, T., and Ling, S.. Association schemes arising from bent functions. Designs, Codes and Cryptography 59 (1–3), pp. 319–331, 2011. See page 163.Google Scholar
[965] Pott, A., Wang, Q., and Zhou, Y.. Sequences and functions derived from projective planes and their difference sets. Proceedings of International Workshop on the Arithmetic of Finite Fields WAIFI 2012, Lecture Notes in Computer Science 7369, pp. 64–80, 2012. See page 197.Google Scholar
[966] Pott, A. and Zhou, Y.. CCZ and EA equivalence between mappings over finite Abelian groups. Designs, Codes and Cryptography 66 (1–3), pp. 99–109, 2013. See page 29.Google Scholar
[967] Prabowo, T. F. and Tan, C. H.. Implicit quadratic property of differentially 4-uniform permutations. Proceedings of INDOCRYPT 2016, Lecture Notes in Computer Science 10095, pp 364–379, 2016. See page 421.Google Scholar
[968] Preneel, B.. Analysis and Design of Cryptographic Hash Functions, PhD thesis, Katholieke Universiteit Leuven, K. Mercierlaan 94, 3001 Leuven, Belgium, U.D.C. 621. 391.7, 1993. See pages 97, 109, 208, 243, and 319.Google Scholar
[969] Preneel, B., Govaerts, R., and Vandevalle, J.. Boolean functions satisfying higher order propagation criteria. Proceedings of EUROCRYPT 1991, Lecture Notes in Computer Sciences 547, pp. 141–152, 1991. See pages 97 and 256.Google Scholar
[970] Preneel, B., Leekwijck, W. Van, Linden, L. Van, Govaerts, R., and Vandevalle, J.. Propagation characteristics of Boolean functions. Proceedings of EUROCRYPT 1990, Lecture Notes in Computer Sciences 473, pp. 161–173, 1991. See pages 76, 97, and 320.Google Scholar
[971] Prouff, E.. DPA attacks and S-boxes. Proceedings of Fast Software Encryption FSE 2005 , Lecture Notes in Computer Science 3557, pp. 424–442, 2005.Google Scholar
[972] Prouff, E. and Rivain, M.. A generic method for secure Sbox implementation. Proceedings of WISA 2007, Lecture Notes in Computer Science 4867, pp. 227–244, 2007. See page 429.Google Scholar
[973] Prouff, E. and Rivain, M.. Masking against side-channel attacks: a formal security proof. Proceedings of EUROCRYPT 2013, Lecture Notes in Computer Science 7881, pp. 142–159, 2013. See page 429.Google Scholar
[974] Prouff, E. and Roche, T.. Higher-order glitches free Implementation of the AES using secure multi-party computation protocols. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2011, Lecture Notes in Computer Science 6917, pp. 63–78, 2011. Extended version (T. Roche and E. Prouff): Journal of Cryptographic Engineering JCEN 2 (2), pp. 111–127, 2012. See pages 428, 431, 436, and 447.Google Scholar
[975] Qu, C., Seberry, J., and Pieprzyk, J.. Homogeneous bent functions. Discrete Applied Mathematics 102 (1–2), pp. 133–139, 2000. See page 248.Google Scholar
[976] Qu, L., Feng, K., Feng, L., and Wang, L.. Constructing symmetric Boolean functions with maximum algebraic immunity. IEEE Transactions on Information Theory 55, pp. 2406–2412, 2009. See page 358.Google Scholar
[977] Qu, L., Fu, S., Dai, Q., and Li, C.. When a Boolean function can be expressed as the sum of two bent functions. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2014/48, 2014. See page 242.Google Scholar
[978] Qu, L. and Li, C.. Weight support technique and the symmetric Boolean functions with maximum algebraic immunity on even number of variables. Proceedings of INSCRYPT 2007, Lecture Note in Computer Science 4990, pp. 271–282. See page 358.Google Scholar
[979] Qu, L., Li, C., and Feng, K.. A note on symmetric Boolean functions with maximum algebraic immunity in odd number of variables. IEEE Transactions on Information Theory 53, pp. 2908–2910, 2007. See pages 357 and 358.Google Scholar
[980] Qu, L., Tan, Y., and Li, C.. On the Walsh spectrum of a family of quadratic APN functions with five terms. Science China Information Sciences 57 (2), pp. 1–7, 2014. See page 409.Google Scholar
[981] Qu, L., Tan, Y., Li, C., and Gong, G.. More constructions of differentially 4-uniform permutations on F22 2k . Designs, Codes and Cryptography 78 (2), pp. 391–408, 2016. See page 420.Google Scholar
[982] Qu, L., Tan, Y., Tan, C. H., and Li, C.. Constructing differentially 4-uniform permutations over F 2k via the switching method. IEEE Transactions on Information Theory 59 (7), pp. 4675–4686, 2013.2 See page 420.Google Scholar
[983] Qu, L., Xiong, H., and Li, C.. A negative answer to Bracken–Tan–Tan’s problem on differentially 4-uniform permutations over F 2 n. Finite Fields and Their Applications 24, pp. 55–65, 2013. See page 418.Google Scholar
[984] Quisquater, J.-J. and Samyde, D.. ElectroMagnetic Analysis (EMA): measures and countermeasures for smart cards. Proceedings of E-smart 2001, Lecture Notes in Computer Science 2140, pp. 200–210, 2001. See page 425.Google Scholar
[985] Quisquater, M.. Applications of character theory and the Möbius inversion principle to the study of cryptographic properties of Boolean functions. PhD thesis, Katholieke Universiteit Leuven, 2004. See page 69.Google Scholar
[986] Quisquater, M., Preneel, B., and Vandewalle, J.. A new inequality in discrete Fourier–Hadamard theory. IEEE Transactions on Information Theory 49, pp. 2038–2040, 2003. See page 256.Google Scholar
[987] Quisquater, M., Preneel, B., and Vandewalle, J.. Spectral characterization of cryptographic Boolean functions satisfying the (extended) propagation criterion of degree l and order k. Information Processing Letters 93 (1), pp. 25–28, 2005. See page 320.Google Scholar
[988] Rao, C. R.. Factorial experiments derivable from combinatorial arrangements of arrays. J. Royal Statist. Soc. 9, pp. 128–139, 1947. See pages 86, 87, and 129.Google Scholar
[989] Reed, I. S.. A class of multiple-error-correcting codes and the decoding scheme. Transactions of the IRE Professional Group on Information Theory 4 (4), pp. 38–49, 1954. See page 151.Google Scholar
[990] Renauld, M., Standaert, F.-X., and Veyrat-Charvillon, N.. Algebraic side-channel attacks on the AES: why time also matters in DPA. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2009, Lecture Notes in Computer Science 5747, pp. 97–111, 2009. See page 436.Google Scholar
[991] Renner, S.. Protection des algorithmes cryptographiques embarqués. Thesis, Bordeaux. (https://tel.archives-ouvertes.fr/tel-01149061/document). See page 147.Google Scholar
[992] Reparaz, O., Bilgin, B., Nikova, S., Gierlichs, B., and Verbauwhede, I.. Consolidating Masking Schemes. Proceedings of CRYPTO (1) 2015, Lecture Notes in Computer Science 9215, pp. 764–783, 2015. See page 437.Google Scholar
[993] Riera, C. and Parker, M. G.. Generalised bent criteria for Boolean functions. IEEE Transactions on Information Theory 52 (9), pp. 4142–4159, 2006. See pages 191 and 266.Google Scholar
[994] Rijmen, V., Barreto, P. S. L. M., and Filho, D. L. G.. Rotation symmetry in algebraically generated cryptographic substitution tables. Information Processing Letters 106 (6), pp. 246–250, 2008 See page 362.Google Scholar
[995] Rijmen, V., Preneel, B., and Win, E. De. On weaknesses of non-surjective round functions. Designs, Codes and Cryptography 12 (3), pp. 253–266, 1997. See page 142.Google Scholar
[996] Rivain, M. and Prouff, E.. Provably secure higher-order masking of aes. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2010, Lecture Notes in Computer Science 6225, pp. 413–427, 2010. See page 430.Google Scholar
[997] Rizomiliotis, P.. On the resistance of Boolean functions against algebraic attacks using univariate polynomial representation. IEEE Transactions on Information Theory 56, pp. 4014–4024, 2010. See pages 334, 339, and 340.Google Scholar
[998] Rizomiliotis, P.. Improving the higher order nonlinearity lower bound for Boolean functions with given algebraic immunity. Discrete Applied Mathematics 158 (18), pp. 2049–2055, 2010. See page 331.Google Scholar
[999] Rizomiliotis, P.. On the security of the Feng–Liao–Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks. Designs, Codes and Cryptography 57 (3), pp. 283–292, 2010. See page 334.Google Scholar
[1000] Rodier, F.. Asymptotic nonlinearity of Boolean functions. Designs, Codes and Cryptography 40 (1), pp 59–70, 2006 (preliminary version: Proceedings of WCC 2003, Workshop on Coding and Cryptography, pp. 397–405, 2003). See pages 80, 84, and 334.Google Scholar
[1001] Rønjom, S.. Improving algebraic attacks on stream ciphers based on linear feedback shift register over F 2 k . Designs, Codes and Cryptography 82, pp. 27–41, 2017. See pages 95 and 96.Google Scholar
[1002] Rønjom, S., Gong, G., and Helleseth, T.. On attacks on filtering generators using linear subspace structures. Proceedings of Sequences, Subsequences, and Consequences, Lecture Notes in Computer Science 4893, pp. 204–217, 2007. See page 95.Google Scholar
[1003] Rønjom, S. and Helleseth, T.. A new attack on the filter generator. IEEE Transactions on Information Theory 53 (5), pp. 1752–1758, 2007. See pages 95 and 284.Google Scholar
[1004] Rønjom, S. and Helleseth, T.. Attacking the filter generator over GF (2m). Proceedings of International Workshop on the Arithmetic of Finite Fields WAIFI 2007, Lecture Notes in Computer Science 4547, pp. 264–275, June 2007. See page 95.Google Scholar
[1005] On, O. S. Rothaus “bent” functions. Journal of Combinatorial Theory, Series A 20, pp. 300–305, 1976. See pages 144, 190, 197, 200, 208, and 232.Google Scholar
[1006] Rueppel, R. A.. Analysis and Design of Stream Ciphers. Com. and Contr. Eng. Series. Springer, 1986. See pages 21 and 77.Google Scholar
[1007] Rueppel, R. A. and Staffelbach, O. J.. Products of linear recurring sequences with maximum complexity. IEEE Transactions on Information Theory 33 (1), pp. 124–131, 1987. See page 77.Google Scholar
[1008] Ryazanov, B.V.. On the distribution of the spectral complexity of Boolean functions. Discrete Mathematics and Applications 4 (3), pp. 279–288, 1994. See pages 109 and 110.Google Scholar
[1009] Saarinen, M.-J. O.. Cryptographic analysis of all 4 × 4-bit S-boxes. Proceedings of SAC 2011, Lecture Notes in Computer Science 7118, pp. 118–133, 2011. See page 144.Google Scholar
[1010] Samorodnitsky, A.. Low-degree tests at large distances. Proceedings of ACM STOC 2007, pp. 506–515 (https://arxiv.org/pdf/math/0604353.pdf), 2007. See page 474.Google Scholar
[1011] Sarkar, P. and Maitra, S.. Construction of nonlinear Boolean functions with important cryptographic properties. Proceedings of EUROCRYPT 2000, Lecture Notes in Computer Science 1807, pp. 485–506, 2000. See pages 291, 292, and 320.Google Scholar
[1012] Sarkar, P. and Maitra, S.. Nonlinearity bounds and constructions of resilient Boolean functions. Proceedings of CRYPTO 2000, Lecture Notes in Computer Science 1880, pp. 515–532, 2000. See pages 287, 288, and 291.Google Scholar
[1013] Sarkar, P. and Maitra, S.. Construction of nonlinear resilient Boolean functions using “small” affine functions. IEEE Transactions on Information Theory 50 (9), pp. 2185–2193, 2004. See page 295.Google Scholar
[1014] Sarkar, P. and Maitra, S.. Balancedness and correlation immunity of symmetric Boolean functions. Discrete Mathematics 307, pp. 2351–2358, 2007. See page 357.Google Scholar
[1015] Sarkar, P. and Maitra, S.. Construction of rotation symmetric Boolean functions on odd number of variables with maximum algebraic immunity. Proceedings of AAECC 2007, Lecture Notes in Computer Science 4851, pp. 271–280, 2007. See page 362.Google Scholar
[1016] Sarkar, S. and Maitra, S.. Idempotents in the neighbourhood of Patterson–Wiedemann functions having Walsh spectra zeros. Designs, Codes and Cryptography, 49, pp. 95–103, 2008. See pages 81 and 82.Google Scholar
[1017] Sarwate, D. V. and Pursley, M. B.. Crosscorrelation properties of pseudorandom and related sequences. Proceedings of the IEEE 68 (5), pp. 593–619 (1980). Correction in Proceedings of the IEEE 68 (12), pp. 1554, 1980.Google Scholar
[1018] Satoh, T., Iwata, T., and Kurosawa, K.. On cryptographically secure vectorial Boolean functions. Proceedings of ASIACRYPT 1999, Lecture Notes in Computer Science 1716, pp. 20–28, 1999. See page 270.Google Scholar
[1019] Savicky, P.. On the bent Boolean functions that are symmetric. European Journal of Combinatorics 15, pp. 407–410, 1994. See page 355.Google Scholar
[1020] Schatz, J.. The second-order Reed–Muller code of length 64 has covering radius 18. IEEE Transactions in Information Theory 27 (4), pp. 529–530, 1981. See page 158.Google Scholar
[1021] Schmidt, K.-U.. Nonlinearity measures of random Boolean functions. Cryptography and Communications 8 (4), pp. 637–645, 2016. See pages 84 and 159.Google Scholar
[1022] Schmidt, K.-U.. Asymptotically optimal Boolean functions. Journal of Combinatorial Theory, Series A 164, pp. 50–59, 2019. See page 157.Google Scholar
[1023] Schmidt, K.-U. and Zhou, Y.. Planar functions over fields of characteristic two. CoRR abs/1301.6999, 2013. See page 269.Google Scholar
[1024] Schneider, M.. A note on the construction and upper bounds of correlation-immune functions. Proceedings of IMA Conference on Cryptography and Coding 1997 , Lecture Notes In Computer Science 1355, pp. 295–306, 1997. An extended version appeared under the title “On the construction and upper bounds of balanced and correlation-immune functions,” Selected Areas in Cryptography (SAC), pp. 73–87, 1997. See page 312.Google Scholar
[1025] Seberry, J. and X-.M. Zhang. Constructions of bent functions from two known bent functions. Australasian Journal of Combinatorics 9, pp. 21–35, 1994. See page 234.Google Scholar
[1026] Seberry, J., X-.M. Zhang, and Zheng, Y.. On constructions and nonlinearity of correlation immune Boolean functions. Proceedings of EUROCRYPT 1993, Lecture Notes in Computer Science 765, pp. 181–199, 1994. See page 294.Google Scholar
[1027] Seberry, J., X-.M. Zhang, and Zheng, Y.. Nonlinearly balanced Boolean functions and their propagation characteristics. Proceedings of CRYPTO 1993, Lecture Notes in Computer Science 773, pp. 49–60, 1994. See page 81.Google Scholar
[1028] Seberry, J., Zhang, X.-M., and Zheng, Y.. Nonlinearity characteristics of quadratic substitution boxes. Proceedings of Selected Areas in Cryptography (SAC 1994 ). This paper appeared under the title “Relationship among nonlinearity criteria” in the Proceedings of EUROCRYPT 1994, Lecture Notes in Computer Science, 950 pp. 376–388, 1995. See page 391.Google Scholar
[1029] Semakov, N. V. and Zinoviev, V. A.. Balanced codes and tactical configurations. Problems of Information Transmission 5 (3), pp. 22–28 (1969) See page 255.Google Scholar
[1030] Shamir, A.. How to share a secret. Commun. ACM 22 (11), pp. 612–613, 1979. See page 145.Google Scholar
[1031] Shan, J., Hu, L., and Zeng, X.. Cryptographic properties of nested functions and algebraic immunity of the Boolean function in Hitag2 stream cipher. Cryptography and Communications 6 (3), pp. 233–254, 2014. See page 335.Google Scholar
[1032] Shanbhag, A., Kumar, V., and Helleseth, T.. An upper bound for the extended Kloosterman sums over Galois rings. Finite Fields and Their Applications 4, pp. 218–238, 1998. See page 188.Google Scholar
[1033] Shannon, C. E.. A mathematical theory of communication. Bell System Technical Journal, 27, pp. 379–423, 1948. See page 4.Google Scholar
[1034] Shannon, C. E.. Communication theory of secrecy systems. Bell System Technical Journal, 28, pp. 656–715, 1949. See pages 19, 76, and 89.Google Scholar
[1035] Shannon, C. E.. The synthesis of two-terminal switching circuits. Bell System Technical Journal, 28, pp. 59–98, 1949. See page 103.Google Scholar
[1036] Shaltiel, R.. Dispersers for affine sources with sub-polynomial entropy. Proceedings of 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 247–256, 2011. See pages 105 and 108.Google Scholar
[1037] Shimoyama, T. and Kaneko, T.. Quadratic relation of S-box and its application to the linear attack of full round DES. Proceedings of CRYPTO 1998, Lecture Notes in Computer Science 1462, pp. 200–211, 1998. See page 122.Google Scholar
[1038] Shparlinski, I.. On the singularity of generalised Vandermonde matrices over finite fields. Finite Fields and Their Applications 11, pp. 193–199, 2005. See page 96.Google Scholar
[1039] Shuai, L., Wang, L., Miao, L., and Zhou, X.. Differential uniformity of the composition of two functions. Cryptography and Communications 12 (2), pp. 205–220, 2020, See page 421.Google Scholar
[1040] Sidelnikov, V. M.. On the mutual correlation of sequences. Soviet Math. Dokl. 12, pp. 197–201, 1971. See page 118.Google Scholar
[1041] Siegenthaler, T.. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory 30 (5), pp. 776–780, 1984. See pages 76, 86, 284, 285, 297, and 298.Google Scholar
[1042] Siegenthaler, T.. Decrypting a Class of stream ciphers using ciphertext only. IEEE Transactions on Computer C-34 (1), pp. 81–85, 1985. See pages 76 and 87.Google Scholar
[1043] Singh, R., Sarma, B., and Saikia, A.. Public key cryptography using permutation p-polynomials over finite fields. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2009/208, 2009. See page 250.Google Scholar
[1044] Smyshlyaev, S.. Perfectly balanced Boolean functions and Golić conjecture. Journal of Cryptology 25, pp. 464–48, 2012. See page 344.Google Scholar
[1045] Søreng, J.. The periods of the sequences generated by some symmetric shift registers. Journal of Combinatorial Theory, Series A 21 (2), pp. 164–187, 1976. See page 23.Google Scholar
[1046] Søreng, J.. Symmetric shift registers. Pacific J. Math. 85 (1), pp. 201–229, 1979. See page 23.Google Scholar
[1047] Standaert, F.-X., Veyrat-Charvillon, N., Oswald, E., , etc. The world is not enough: another look on second-order dpa. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2010/180, 2010. See page 427.Google Scholar
[1048] Stănică, P., Maitra, S., and Clark, J.. Results on rotation symmetric bent and correlation immune Boolean functions. Proceedings of Fast Software Encryption FSE 2004 , Lecture Notes in Computer Science 3017, pp. 161–177, 2004. See page 360.Google Scholar
[1049] Stinson, D. R.. Resilient functions and large sets of orthogonal arrays. Congressus Numer. 92, pp. 105–110, 1993. See page 314.Google Scholar
[1050] Stinson, D. R. and Massey, J. L.. An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. Journal of Cryptology 8, n◦ 3, pp. 167–173, 1995. See page 314.Google Scholar
[1051] Stoffelen, K.. Optimizing S-box implementations for several criteria using SAT solvers. Proceedings of Fast Software Encryption FSE 2016, Lecture Notes in Computer Science 9783, pp. 140–160, 2016. See page 144.Google Scholar
[1052] Strassen, V.. Gaussian elimination is not optimal. Numerische Math. 13, pp. 354–356, 1969. See page 90.Google Scholar
[1053] Strazdins, I.. Universal affine classification of Boolean functions. Acta Applicandae Mathematicae 46, pp. 147–167, 1997. See page 155.Google Scholar
[1054] Su, S. and Tang, X.. Systematic constructions of rotation symmetric bent functions, 2-rotation symmetric bent functions, and bent idempotent functions. IEEE Transactions on Information Theory 63 (7), pp. 4658–4667, 2017. See also: On the systematic constructions of rotation symmetric bent functions with any possible algebraic degrees. IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2015/451, 2015. See page 252.Google Scholar
[1055] Su, W., Zeng, X., and Hu, L.. Construction of 1-resilient Boolean functions with optimum algebraic immunity. International Journal of Computer Mathematics 88 (2), pp. 222–238, 2011. See page 344.Google Scholar
[1056] Sugawara, T.. 3-share threshold implementation of AES S-box without fresh randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems 2019 (1), pp. 123–145, 2019. See page 443.Google Scholar
[1057] Sugita, T., Kasami, T., and Fujiwara, T.. Weight distributions of the third and fifth order Reed–Muller codes of length 512. Nara Inst. Sci. Tech. Report, 1996. See page 155.Google Scholar
[1058] Sun, T.-F., Hu, B., Liu, Y., and Xu, L.-P.. On primary construction of plateaued functions. Proceedings of 3rd International Conference on Material, Mechanical and Manufacturing Engineering IC3ME 2015, Atlantis Press, 2015. See page 265.Google Scholar
[1059] Sung, S. H., Chee, S., and Park, C.. Global avalanche characteristics and propagation criterion of balanced Boolean functions. Information Processing Letters 69, pp. 21–24, 1999.Google Scholar
[1060] Tan, Y., Gong, G., and Zhu, B.. Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions. Cryptography and Communications 8 (2), pp. 291–311, 2016. See page 136.Google Scholar
[1061] Tan, Y., Qu, L., Ling, S., and Tan, C. H.. On the Fourier spectra of new APN functions. SIAM Journal on Discrete Mathematics 27 (2), pp. 791–801, 2013. See page 412.Google Scholar
[1062] Tang, C. and Qi, Y.. Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice. Proceedings of International Conference on Sequences and Their Applications SETA 2014 , Lecture Notes in Computer Science, pp. 60–71, 2014. See page 247.Google Scholar
[1063] Tang, C. and Qi, Y.. A class of hyper-bent functions and Kloosterman sums. Cryptography and Communications 9 (5), pp. 647–664, 2017. See page 247.Google Scholar
[1064] Tang, C., Qi, Y., and Xu, M.. Multiple output bent functions characterized by families of bent functions. Journal of Cryptologic Research 1 (4), pp. 321–326, 2014. See page 272.Google Scholar
[1065] Tang, C., Qi, Y., Zhou, Z., and Fan, C.. Two infinite classes of rotation symmetric bent functions with simple representation. Applicable Algebra in Engineering Communication and Computing (AAECC) 29 (3), pp. 197–208, 2018. See pages 249 and 251.Google Scholar
[1066] Tang, D., Carlet, C., and Tang, X.. On the second-order nonlinearities of some bent functions. Information Sciences 223, pp. 322–330, 2013. See page 85.Google Scholar
[1067] Tang, D., Carlet, C., and Tang, X.. Highly nonlinear Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks. IEEE Transactions on Information Theory 59 (1), pp. 653–664, 2013 (preliminary version available in IACR Cryptology ePrint Archive, http://eprint.iacr.org/2011/366, 2011). See pages 332 and 340.Google Scholar
[1068] Tang, D., Carlet, C., and Tang, X.. A class of 1-resilient Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks. International Journal of Foundations of Computer Science 25 (6), pp. 763–780, 2014. See page 340.Google Scholar
[1069] Tang, D., Carlet, C., and Tang, X.. Differentially 4-uniform bijections by permuting the inverse function. Designs, Codes and Cryptography 77 (1), pp. 117–141, 2015. See page 421.Google Scholar
[1070] Tang, D., Carlet, C., Tang, X., and Zhou, Z.. Construction of highly nonlinear 1-resilient Boolean functions with optimal algebraic immunity and provably high fast algebraic immunity. IEEE Transactions on Information Theory 63 (9), pp. 6113–6125, 2017. See page 344.Google Scholar
[1071] Tang, D., Carlet, C., and Zhou, Z.. Binary linear codes from vectorial Boolean functions and their weight distribution. Discrete Mathematics 340 (12), pp. 3055–3072, 2017. See page 161.Google Scholar
[1072] Tang, D., Kavut, S., Mandal, B., and Maitra, S.. Modifying Maiorana–McFarland type bent functions for good cryptographic properties and efficient implementation. SIAM Journal of Discrete Mathematics 33 (1), pp. 238–256, 2019. See page 99.Google Scholar
[1073] Tang, D. and Liu, J.. A family of weightwise (almost) perfectly balanced Boolean functions with optimal algebraic immunity. Special Issue on Boolean Functions and Their Applications 2018, Cryptography and Communications 11 (6), pp. 1185–1197, 2019. See page 459.Google Scholar
[1074] Tang, D. and Maitra, S.. Construction of n-variable (n ≡ 2 mod 4) balanced Boolean functions with maximum absolute value in autocorrelation spectra < 2n2 . IEEE Transactions on Information Theory 64 (1), pp. 393–402, 2018. See page 320.Google Scholar
[1075] Tang, C., Zhou, Z., Qi, Y., Zhang, X., Fan, C., and Helleseth, T.. Generic construction of bent functions and bent idempotents with any possible algebraic degrees. IEEE Transactions on Information Theory 63 (10), pp. 6149–6157, 2017. See page 251.Google Scholar
[1076] Tang, X. H., Tang, D., Zeng, X., and Hu, L.. Balanced Boolean functions with (almost) optimal algebraic immunity and very high nonlinearity. IACR Cryptology ePrint Archive (http://eprint.iacr. org/) 2010/443, 2010. See pages 340 and 344.Google Scholar
[1077] Taniguchi, H.. On some quadratic APN functions. Designs, Codes and Cryptography 87 (9), pp. 1973–1983, 2019. See pages 407 and 410.Google Scholar
[1078] Tao, T.. Structure and randomness in combinatorics. Proceedings of FOCS 2007, pp. 3–15 (also arXiv:0707.4269v2[math.CO], 2007).Google Scholar
[1079] Tapia-Recillas, H. and Vega, G.. An upper bound on the number of iterations for transforming a Boolean function of degree greater than or equal than 4 to as function of degree 3. Designs, Codes and Cryptography 24, pp. 305–312, 2001.Google Scholar
[1080] Tarannikov, Y. V.. On resilient Boolean functions with maximum possible nonlinearity. Proceedings of INDOCRYPT 2000, Lecture Notes in Computer Science 1977, pp. 19–30, 2000. See pages 287, 288, 291, and 300.Google Scholar
[1081] Tarannikov, Y. V.. New constructions of resilient Boolean functions with maximum nonlinearity. Proceedings of Fast Software Encryption FSE 2001, Lecture Notes in Computer Science 2355, pp. 66–77, 2001. See pages 287 and 291.Google Scholar
[1082] Tarannikov, Y. V. and Kirienko, D.. Spectral analysis of high order correlation immune functions. Proceedings of 2001 IEEE International Symposium on Information Theory, p. 69, 2001. Preliminary version available in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2000/050, 2000. See pages 101 and 313.Google Scholar
[1083] Tarannikov, Y. V., Korolev, P., and Botev, A.. Autocorrelation coefficients and correlation immunity of Boolean functions. Proceedings of ASIACRYPT 2001, Lecture Notes in Computer Science 2248, pp. 460–479, 2001 See pages 287, 290, and 313.Google Scholar
[1084] Tardy-Corfdir, A. and Gilbert, H.. A known plaintext attack on feal-4 and feal-6. Proceedings of CRYPTO 1991, Lecture Notes in Computer Science 576, pp. 172–181, 1991. See page 115.Google Scholar
[1085] Thomé, E.. Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm. Journal of Symbolic Computation 33 (5), pp. 757–775, 2002. See page 21.Google Scholar
[1086] Todo, Y.. Structural evaluation by generalized integral property. Proceedings of EUROCRYPT 2015, Part I. Lecture Notes in Computer Science 9056, pp. 287–314, 2015. See page 114.Google Scholar
[1087] Tokareva, N.. On the number of bent functions from iterative constructions: lower bounds and hypotheses. Advances in Mathematics of Communications 5 (4), pp., 609–621, 2011. See page 242.Google Scholar
[1088] Tokareva, N.. Duality between bent functions and affine functions. Discrete Mathematics 312, pp. 666–670, 2012. See page 191.Google Scholar
[1089] Tokareva, N.. Bent Functions, Results and applications to cryptography. Elsevier, 2015. See page 190.Google Scholar
[1090] Tsai, S.. Lower bounds on representing Boolean functions as polynomials in Z m.∗ SIAM Journal on Discrete Mathematics 9 (1), pp. 55–62, 1996. See page 37.Google Scholar
[1091] Tu, Z. and Deng, Y.. A conjecture on binary string and its applications on constructing Boolean functions of optimal algebraic immunity. Designs, Codes and Cryptography 60 (1), pp. 1–14, 2011. See pages 332, 337, and 339.Google Scholar
[1092] Tu, Z. and Deng, Y.. Boolean functions optimizing most of the cryptographic criteria. Discrete Applied Mathematics 160 (4), pp. 427–435, 2012. See page 344.Google Scholar
[1093] Tu, Z., Zheng, D., Zeng, X., and Hu, L.. Boolean functions with two distinct Walsh coefficients. Applicable Algebra in Engineering, Communication and Computing AAECC 22 (5–6), pp. 359–366, 2011. See page 190.Google Scholar
[1094] Varici, K., Nikova, S., Nikov, V., and Rijmen, V.. Constructions of S-boxes with uniform sharing. Cryptography and Communications 11 (3), pp. 385–398, 2019. Preliminary version in IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/92, 2018. See pages 442 and 479.Google Scholar
[1095] Vaudenay, S.. On the need for multipermutations: cryptanalysis of MD4 and SAFER. Proceedings of Fast Software Encryption FSE 1995, Lecture Notes in Computer Science 1008, pp. 286–297, 1995. See page 129.Google Scholar
[1096] Villa, I.. On APN functions L1 (x3) + L2 (x9) with linear L1 and L2 . Cryptography and Communications 11 (1), pp. 3–20, 2019. See page 406.Google Scholar
[1097] Vinokurov, S. F. and Peryazev, N. A.. An expansion of Boolean function into a sum of products of subfunctions. Discrete Mathematics and Applications 3 (5), pp. 531–533, 1993.Google Scholar
[1098] Voloch, J. F.. Symmetric cryptography and algebraic curves. Proceedings of “The First Symposium on Algebraic Geometry and Its Applications” Dedicated to Gilles Lachaud (SAGA’07), Tahiti, 2007, Published by World Scientific, Series on Number Theory and Its Applications 5, pp. 135–141, 2008. See pages 136 and 369.Google Scholar
[1099] Wadayama, T., Hada, T., Wagasugi, K., and Kasahara, M.. Upper and lower bounds on the maximum nonlinearity of n-input m-output Boolean functions. Designs, Codes and Cryptography 23, pp. 23–33, 2001. See pages 160, 370, and 378.Google Scholar
[1100] Waddle, J. and Wagner, D.. Towards efficient second-order power analysis. Proceedings of International Workshop Cryptographic Hardware and Embedded Systems CHES 2010 , Lecture Notes in Computer Science 3156, pp. 1–15, 2004. See page 427.Google Scholar
[1101] Wagner, D.. The boomerang attack. Proceedings of Fast Software Encryption FSE 1999, Lecture Notes in Computer Science 1636, pp. 156–170, 1999. See page 141.Google Scholar
[1102] Wang, Q.. The covering radius of the Reed–Muller code RM (2, 7) is 40. Discrete Mathematics 342 (12), p. 111625, 2019. See pages 157 and 158.Google Scholar
[1103] Wang, H., Peng, J., Li, Y., and Kan, H.. On 2k-variable symmetric Boolean functions with maximum algebraic immunity k. IEEE Transactions on Information Theory 58 (8), pp. 5612–5624, 2012. See page 358.Google Scholar
[1104] Wang, Q.. Hadamard matrices, d-linearly independent sets and correlation-immune Boolean functions with minimum hamming weights. Designs, Codes and Cryptography 87 (10), pp. 2321–2333, 2019 . See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2018/284. See pages 291, 304, 305, and 306.Google Scholar
[1105] Wang, Q., Carlet, C., Stănică, P., and Tan, C. H.. Cryptographic properties of the hidden weighted bit function. Discrete Applied Mathematics 174, pp. 1–10, 2014. See page 343.Google Scholar
[1106] Wang, Q. and Johansson, T.. A note on fast algebraic attacks and higher order nonlinearities. Proceedings of INSCRYPT 2010, Lecture Notes in Computer Science 6584, pp. 84–98, 2010. See pages 94, 332, and 340.Google Scholar
[1107] Wang, Q. and Kan, H.. A note on the construction of differentially uniform permutations using extension fields. IEICE Transactions 95-A (11), pp. 2080–2083, 2012. See page 419.Google Scholar
[1108] Wang, Q. and Stănică, P.. A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions. Designs, Codes and Cryptography 87 (8), pp. 1749–1763, 2019. See page 340.Google Scholar
[1109] Wang, Q., Tan, C. H., and Prabowo, T. F.. On the covering radius of the third order Reed–Muller code RM (3, 7). Designs, Codes and Cryptography 86 (1), pp. 151–159, 2018. See page 158.Google Scholar
[1110] Wang, Z. and Gong, G.. Discrete Fourier transform of Boolean functions over the complex field and its applications. IEEE Transactions on Information Theory 64 (4) (Special Issue in Honor of Solomon Golomb), pp. 3000–3009, 2018. See pages 44, 52, 53, and 88.Google Scholar
[1111] Wang, T., Liu, M., and Lin, D.. Construction of resilient and nonlinear Boolean functions with almost perfect immunity to algebraic and fast algebraic attacks. Information Security and Cryptology. Inscrypt 2012, Kutyłowski, M. and Yung, M., eds. Lecture Notes in Computer Science, vol. 7763, Springer, pp. 276–293, 2013. See page 344.Google Scholar
[1112] Wang, Z. and Karpovsky, M.. Algebraic manipulation detection codes and their applications for design of secure cryptographic devices. Proceedings of On-Line Testing Symposium (IOLTS), 2011, pp. 234–239, 2011. See pages 451 and 452.Google Scholar
[1113] Wang, Z. and Karpovsky, M.. New error detecting codes for the design of hardware resistant to strong fault injection attacks. Proceedings of International Conference on Security and Management, SAM, 2012. See pages 451, 452, and 453.Google Scholar
[1114] Wang, Z., Karpovsky, M., and Kulikowski, K. J. Design of memories with concurrent error detection and correction by nonlinear SEC-DED codes. Journal of Electronic Testing 26 (5), pp. 559–580, 2010. See page 453.Google Scholar
[1115] Wang, Z., Zhang, X., Wang, S., Zheng, Z., and Wang, W.. Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation. International Journal of Computer Mathematics, 93 (3), pp. 425–444, 2016. See page 344.Google Scholar
[1116] Webster, A. F. and Tavares, S. E.. On the design of S-boxes. Proceedings of CRYPTO 1985, Lecture Notes in Computer Science 219, pp. 523–534, 1985. See page 97.Google Scholar
[1117] Wegener, I., The Complexity of Boolean Functions, John Wiley & Sons, 1987. See pages 19 and 352.Google Scholar
[1118] Weng, G., Tan, Y., and Gong, G.. On almost perfect nonlinear functions and their related algebraic objects. Proceedings of International Workshop on Coding and Cryptography, pp. 48–57, 2013. See pages 393 and 399.Google Scholar
[1119] Williams, K. S., Note on cubics over GF (2 n) and GF (3n). Journal of Number Theory 7 (4), pp. 361–365, 1975. See page 495.Google Scholar
[1120] Wolfmann, J.. Bent functions and coding theory. Difference Sets, Sequences and their Correlation Properties, Pott, A. Kumar, P. V. Helleseth, T., and Jungnickel, D., eds., , Kluwer, pp. 393–417. 1999. See pages 160, 195, and 196.Google Scholar
[1121] Wolfmann, J.. Cyclic code aspects of bent functions. Finite Fields Theory and Applications, Contemporary Mathematics Series of the AMS, Amer. Math Soc., vol. 518, pp. 363–384, 2010. See page 262.Google Scholar
[1122] Wolfmann, J.. Sequences of bent and near-bent functions. Cryptography and Communications 9 (6), pp. 729–736, 2017. See page 240.Google Scholar
[1123] Wu, B.. PS bent functions constructed from finite pre-quasifield spreads. http://arxiv.org/abs/1308 .3355, 2013. See pages 217, 225, and 226.Google Scholar
[1124] Wu, B., Zheng, J. and Lin, D.: Constructing Boolean functions with (potentially) optimal algebraic immunity based on multiplicative decompositions of finite fields. Proceedings of IEEE International Symposium on Information Theory (ISIT) 2015, pp. 491–495, 2015. See page 340.Google Scholar
[1125] Wu, C.-K. and Feng, D.. Boolean Functions and Their Applications in Cryptography. Springer, 2016. See page 76.Google Scholar
[1126] Xia, T., Seberry, J., Pieprzyk, J., and Charnes, C.. Homogeneous bent functions of degree n in 2n variables do not exist for n > 3. Discrete Applied Mathematics 142 (1–3), pp. 127–132, 2004. See page 248.Google Scholar
[1127] Xia, Y., Li, N., Zeng, X., and Helleseth, T.. An open problem on the distribution of a Niho type crosscorrelation function. IEEE Transactions on Information Theory 62 (12), pp. 7546–7554, 2016. See page 384.Google Scholar
[1128] Xiao, G.-Z. and Massey, J. L.. A spectral characterization of correlation-immune combining functions. IEEE Transactions on Information Theory 34 (3), pp. 569–571, 1988. See page 87.Google Scholar
[1129] Xiong, M., Yan, H., and Yuan, P.. On a conjecture of differentially 8-uniform power functions. Designs, Codes and Cryptography 86 (8), pp. 1601–1621, 2018. See page 422.Google Scholar
[1130] Xu, G. and Cao, X.. Constructing new piecewise differentially 4-uniform permutations from known APN functions. International Journal of Foundations of Computer Science 26 (5), pp. 599–609, 2015. See page 420.Google Scholar
[1131] Xu, G., Cao, X., and Xu, S.. Several new classes of Boolean functions with few Walsh transform values. Applicable Algebra in Engineering Communication and Computing (AAECC) 28 (2), pp. 155–176, 2017. See pages 231 and 263.Google Scholar
[1132] Xu, G. and Qu, L.. Two classes of differentially 4-uniform permutations over F n2 with n even. To appear in Advances in Mathematics of Communications 14 (1), 2020. See page 420.Google Scholar
[1133] Xu, Y., Carlet, C., Mesnager, S., and Wu, C.. Classification of bent monomials, constructions of bent multinomials and upper bounds on the nonlinearity of vectorial functions. IEEE Transactions on Information Theory 64 (1), pp. 367–383, 2018. See pages 122, 140, and 272.Google Scholar
[1134] Yang, X. and Massey, J. L.. The condition for a cyclic code to have a complementary dual. Discrete Mathematics 126, pp. 391–393, 1994. See page 446.Google Scholar
[1135] Yang, Y. X. and Guo, B.. Further enumerating Boolean functions of cryptographic signifiance. Journal of Cryptology 8 (3), pp. 115–122, 1995. See pages 356 and 357.Google Scholar
[1136] Yao, A. C.. Protocols for secure computations (extended abstract). Proceedings of FOCS 1982, pp. 160–164, 1982. See page 146.Google Scholar
[1137] Yarlagadda, R. and Hershey, J. E.. Analysis and synthesis of bent sequences, IEE Proceedings. Part E. Computers and Digital Techniques 136, pp. 112–123, 1989. See pages 231 and 293.Google Scholar
[1138] Yasunaga, K. and Fujiwara, T.. On correctable errors of binary linear codes. IEEE Transactions on Information Theory 56 (6), pp. 2537–2548, 2010. See page 79.Google Scholar
[1139] Yoshiara, S.. Equivalences of quadratic APN functions. Journal of Algebraic Combinatorics 35, pp. 461–475, 2012. See pages 30 and 281.Google Scholar
[1140] Yoshiara, S.. Equivalences of power APN functions with power or quadratic APN functions. Journal of Algebraic Combinatorics 44 (3), pp. 561–585, 2016. See pages 281, 396, 398, 402, 405, and 406.Google Scholar
[1141] Yoshiara, S.. Equivalences among plateaued APN functions. Designs, Codes and Cryptography 85 (2), pp. 205–217, 2017. See pages 281 and 402.Google Scholar
[1142] Yoshiara, S.. Plateaudness of Kasami APN functions. Finite Fields and Their Applications 47, pp. 11–32, 2017. See pages 382 and 400.Google Scholar
[1143] Youssef, A. M. and Gong, G.. Hyper-bent functions. Proceedings of EUROCRYPT 2001, Lecture Notes in Computer Science 2045, Berlin, pp. 406–419, 2001. See pages 244 and 272.Google Scholar
[1144] Yu, N. Y. and Gong, G.. Constructions of quadratic bent functions in polynomial forms. IEEE Transactions on Information Theory 52 (7), pp. 3291–3299, 2006. See pages 206, 230, 231, and 250.Google Scholar
[1145] Yu, Y., Wang, M., and Li, Y.. A matrix approach for constructing quadratic APN functions. Proceedings of International Workshop on Coding and Cryptography, pp. 39–47, 2013, and Designs, Codes and Cryptography 73 (2), pp 587–600, 2014. See pages 392, 393, and 399.Google Scholar
[1146] Yu, Y., Wang, M. S., and Li, Y. Q.. Constructing low differential uniformity functions from known ones. Chinese Journal of Electronics 22 (3), pp. 495–499, 2013. See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2011/47, entitled “Constructing differential 4-uniform permutations from known ones.” See page 420.Google Scholar
[1147] Yuan, J., Carlet, C., and Ding, C.. The weight distribution of a class of linear codes from perfect nonlinear functions. IEEE Transactions on Information Theory 52 (2), pp. 712–717, 2006. See page 160.Google Scholar
[1148] Zeng, X., Carlet, C., Shan, J., and Hu, L.. More balanced Boolean functions with optimal algebraic immunity and good nonlinearity and resistance to fast algebraic attacks. IEEE Transactions on Information Theory 57 (9), pp. 6310–6320, 2011. See pages 337 and 339.Google Scholar
[1149] Zeng, X. and Hu, L.. Constructing Boolean functions by modifying Maiorana–McFarland’s superclass functions. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 88-A (1), pp. 59–66, 2005. See page 340.Google Scholar
[1150] Zha, Z., Hu, L., and Sun, S.. Constructing new differentially 4-uniform permutations from the inverse function. Finite Fields and Their Applications 25, pp. 64–78, 2014. See page 420.Google Scholar
[1151] Zha, Z., Hu, L., Sun, S., and Shan, J.. Further results on differentially 4-uniform permutations over F2 2m. Science China Mathematics 58 (7), pp. 1577–1588, 2015. See page 420.Google Scholar
[1152] Zhang, F., Carlet, C., Hu, Y., and Cao, T.-J.. Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions. Information Sciences 283, pp. 94–106, 2014. See page 266.Google Scholar
[1153] Zhang, F., Carlet, C., Hu, Y., and Zhang, W.. New secondary constructions of bent functions. Applicable Algebra in Engineering, Communication and Computing (AAECC) 27 (5), pp. 413–434, 2016. See page 234.Google Scholar
[1154] Zhang, F., Pasalic, E., Cepak, N., and Wei, Y.. Bent functions in C and D Outside the completed Maiorana–McFarland class. Proceedings of C2SI 2017, Lecture Notes in Computer Science 10194, pp. 298–313, 2017. See page 211.Google Scholar
[1155] Zhang, M.. Maximum correlation analysis of nonlinear combining functions in stream ciphers. Journal of Cryptology 13 (3), pp. 301–313, 2000. See pages 101 and 290.Google Scholar
[1156] Zhang, M. and Chan, A.. Maximum correlation analysis of nonlinear S-boxes in stream ciphers. Proceedings of CRYPTO 2000, Lecture Notes in Computer Science 1880, pp. 501–514, 2000. See pages 131 and 132.Google Scholar
[1157] Zhang, W.. High-meets-low: construction of strictly almost optimal resilient Boolean functions via fragmentary Walsh spectra. IEEE Transactions on Information Theory 65 (9), pp. 5856–5864, 2019. See page 317.Google Scholar
[1158] Zhang, W., Bao, Z., Rijmen, V., and Liu, M.. A new classification of 4-bit optimal S-boxes and its application to PRESENT, RECTANGLE and SPONGENT. Proceedings of Fast Software Encryption FSE 2015, Lecture Notes in Computer Science 9054, pp. 494–515, 2015; see also https://eprint.iacr.org/2015/433. See page 144.Google Scholar
[1159] Zhang, W., Li, L., and Pasalic, E.. Construction of resilient S-boxes with higher-dimensional vectorial outputs and strictly almost optimal non-linearity. IET Information Security 11 (4), pp. 199–203, 2017. See page 317.Google Scholar
[1160] Zhang, W. and Pasalic, E.. Highly nonlinear balanced S-boxes with good differential properties. IEEE Transactions on Information Theory 60 (12), pp. 7970–7979, 2014. See page 422.Google Scholar
[1161] Zhang, W. and Pasalic, E.. Constructions of resilient S-Boxes with strictly almost optimal nonlinearity through disjoint linear codes. IEEE Transactions on Information Theory 60 (3), pp. 1638–1651, 2014. See page 317.Google Scholar
[1162] Zhang, W., Xing, Z., and Feng, K.. A construction of bent functions with optimal algebraic degree and large symmetric group. Advances in Mathematics of Communications 14 (1), pp. 23–33, 2020. See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2017/197. See page 192.Google Scholar
[1163] Zhang, W.-G. and Pasalic, E.. Generalized Maiorana–McFarland construction of resilient Boolean functions with high nonlinearity and good algebraic properties. IEEE Transactions on Information Theory 60 (10), pp. 6681–6695, 2014. See page 295.Google Scholar
[1164] Zhang, W. G. and Xiao, G. Z.. Constructions of almost optimal resilient Boolean functions on large even number of variables. IEEE Transactions on Information Theory 55 (12), pp. 5822–5831, 2009. See page 295.Google Scholar
[1165] Zhang, X., Cao, X., and Feng, R.. A method of evaluation of exponential sum of binary quadratic functions. Finite Fields and Their Applications 18, pp. 1089–1103, 2012. See page 179.Google Scholar
[1166] Zhang, X. and Zhou, M.. Construction of CCZ transform for quadratic APN functions. Cognitive Systems Research 57, pp. 41–45, 2019. See page 404.Google Scholar
[1167] Zhang, X.-M. and Zheng, Y.. GAC – the criterion for global avalanche characteristics of cryptographic functions. Journal of Universal Computer Science, 1 (5), pp. 320–337, 1995. See pages 97 and 320.Google Scholar
[1168] Zhang, X.-M. and Zheng, Y.. On nonlinear resilient functions. Proceedings of EUROCRYPT 1995, Lecture Notes in Computer Science 921, pp. 274–288, 1995. See pages 129 and 317.Google Scholar
[1169] Zhang, X.-M. and Zheng, Y.. Auto-correlations and new bounds on the nonlinearity of Boolean functions. Proceedings of EUROCRYPT 1996, Lecture Notes in Computer Science 1070, pp. 294–306, 1996. See pages 81, 98, and 318.Google Scholar
[1170] Zhang, X.-M. and Zheng, Y.. Cryptographically resilient functions. IEEE Transactions on Information Theory 43, pp. 1740–1747, 1997. See page 317.Google Scholar
[1171] Zhang, X.-M. and Zheng, Y.. The nonhomomorphicity of Boolean functions. Proceedings of SAC 1998, Lecture Notes in Computer Science 1556, pp. 280–295, 1999. See page 111.Google Scholar
[1172] Zheng, J., Wu, B., Chen, Y., and Liu, Z.. Constructing 2m-variable Boolean functions with optimal algebraic immunity based on polar decomposition of F∗22m. International Journal of Foundations of Computer Science 25 (5), pp. 537–552, 2014. See page 340.Google Scholar
[1173] Zheng, Y. and Zhang, X. M.. Plateaued functions. Proceedings of ICICS 1999, Lecture Notes in Computer Science 1726, pp. 284–300, 1999. See pages 81, 98, 190, 258, 259, and 264.Google Scholar
[1174] Zheng, Y. and Zhang, X. M.. Relationships between bent functions and complementary plateaued functions. Lecture Notes in Computer Science 1787, pp. 60–75, 1999. See page 258.Google Scholar
[1175] Zheng, Y. and Zhang, X.-M.. On relationships among avalanche, nonlinearity and correlation immunity. Proceedings of ASIACRYPT 2000, Lecture Notes in Computer Science 1976, pp. 470–483, 2000. See page 290.Google Scholar
[1176] Zheng, Y. and Zhang, X. M.. On plateaued functions. IEEE Transactions on Information Theory 47 (3), pp. 1215–1223, 2001. See page 258.Google Scholar
[1177] Zheng, Y. and Zhang, X.-M.. Improving upper bound on the nonlinearity of high order correlation immune functions. Proceedings of Selected Areas in Cryptography 2000 , Lecture Notes in Computer Science 2012, pp. 262–274, 2001. See page 287.Google Scholar
[1178] Zheng, Y. and Zhang, X.-M.. On balanced nonlinear Boolean functions. NATO Science for Peace and Security Series – D: Information and Communication Security, IOS Press, Vol 18: Boolean Functions in Cryptology and Information Security, pp. 243–282, 2008. See pages 257, 258, and 320.Google Scholar
[1179] Zheng, Y., Zhang, X.-M., and Imai, H.. Restriction, terms and nonlinearity of Boolean functions. Theoretical Computer Science, 226 (1–2), pp. 207–223, 1999. See pages 71, 106, and 153.Google Scholar
[1180] Zhou, Y.. On the distribution of auto-correlation value of balanced Boolean functions. Advances in Mathematics of Communications 7 (3), pp. 335–347, 2013. See page 98.Google Scholar
[1181] Zhou, Y. and Li, C.. The Walsh spectrum of a new family of APN functions. Proceedings of WSPC, 2008. See also IACR Cryptology ePrint Archive (http://eprint.iacr.org/) 2008/154. See page 408.Google Scholar
[1182] Zhou, Y. and Pott, A.. A new family of semifields with 2 parameters. Advances in Mathematics 234, pp. 43–60, 2013. See pages 407 and 410.Google Scholar
[1183] Zierler, N. and Mills, W. H.. Products of linear recurring sequences. Journal of Algebra 27, pp. 147–157, 1973. See page 77.Google Scholar
[1184] Zieve, M.. On a theorem of Carlitz. Journal of Group Theory 17, pp. 667–669, 2014. See page 442.Google Scholar

Save book to Kindle

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

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

Find out more about the Kindle Personal Document Service.

  • References
  • Claude Carlet
  • Book: Boolean Functions for Cryptography and Coding Theory
  • Online publication: 31 October 2020
Available formats
×

Save book to Dropbox

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

  • References
  • Claude Carlet
  • Book: Boolean Functions for Cryptography and Coding Theory
  • Online publication: 31 October 2020
Available formats
×

Save book to Google Drive

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

  • References
  • Claude Carlet
  • Book: Boolean Functions for Cryptography and Coding Theory
  • Online publication: 31 October 2020
Available formats
×