{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T15:13:22Z","timestamp":1790090002712,"version":"4.0.1"},"reference-count":98,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10623-023-01220-w","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T15:02:24Z","timestamp":1685026944000},"page":"3035-3079","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the algebraic immunity\u2014resiliency trade-off, implications for Goldreich\u2019s pseudorandom generator"],"prefix":"10.1007","volume":"91","author":[{"given":"Aur\u00e9lien","family":"Dupin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5733-4341","authenticated-orcid":false,"given":"Pierrick","family":"M\u00e9aux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M\u00e9lissa","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"1220_CR1","unstructured":"Akavia A., Bogdanov A., Guo S., Kamath A., Rosen A.: Candidate weak pseudorandom functions in AC0 MOD2. In: ITCS. ITCS \u201914 (2014)"},{"key":"1220_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht M. R., Rechberger C., Schneider T., Tiessen T., Zohner M.: Ciphers for MPC and FHE. In: EUROCRYPT 2015, Part I. LNCS. pp. 430\u2013454 (2015).","DOI":"10.1007\/978-3-662-46800-5_17"},{"issue":"1\u20133","key":"1220_CR3","first-page":"51","volume":"35","author":"M Alekhnovich","year":"2005","unstructured":"Alekhnovich M., Hirsch E.A., Itsykson D.: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Autom. Reason. 35(1\u20133), 51\u201372 (2005).","journal-title":"J. Autom. Reason."},{"key":"1220_CR4","doi-asserted-by":"crossref","unstructured":"Ananth P., Jain A., Lin H., Matt C., Sahai A.: Indistinguishability obfuscation without multilinear maps: new paradigms via low degreeweak pseudorandomness and security amplification. In: CRYPTO. pp. 284\u2013332 (2019).","DOI":"10.1007\/978-3-030-26954-8_10"},{"key":"1220_CR5","doi-asserted-by":"crossref","unstructured":"Andrej B., Youming Q.: On the security of Goldreich\u2019s one-way function. In: RANDOM. pp. 392\u2013405 (2009)","DOI":"10.1007\/978-3-642-03685-9_30"},{"key":"1220_CR6","first-page":"805","volume-title":"44th ACM STOC","author":"B Applebaum","year":"2012","unstructured":"Applebaum B.: Pseudorandom generators with long stretch and low locality from random local one-way functions. In: Karloff H.J., Pitassi T. (eds.) 44th ACM STOC, pp. 805\u2013816. ACM Press, New York (2012)."},{"key":"1220_CR7","doi-asserted-by":"crossref","unstructured":"Applebaum B.: Cryptographic hardness of random local functions-survey. In: Amit S. (ed.) TCC 2013. LNCS., vol. 7785. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-36594-2_33"},{"key":"1220_CR8","unstructured":"Applebaum B.: The cryptographic hardness of random local functions-survey. In: IACR Cryptology ePrint Archive 2015, p. 165 (2015)"},{"key":"1220_CR9","volume-title":"48th ACM STOC","author":"B Applebaum","year":"2016","unstructured":"Applebaum B., Lovett S.: Algebraic attacks against random local functions and their countermeasures. In: Wichs D., Mansour Y. (eds.) 48th ACM STOC. ACM Press, New York (2016)."},{"key":"1220_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/16M1085942","volume":"2016","author":"B Applebaum","year":"2018","unstructured":"Applebaum B., Lovett S.: Algebraic attacks against random local functions and their countermeasures. SIAM J. Comput. 2016, 52\u201379 (2018).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1220_CR11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s00037-007-0237-6","volume":"17","author":"B Applebaum","year":"2008","unstructured":"Applebaum B., Ishai Y., Kushilevitz E.: On pseudorandom generators with linear stretch in NC 0. Comput. Complex. 17(1), 38\u201369 (2008).","journal-title":"Comput. Complex."},{"key":"1220_CR12","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/978-3-642-28914-9_34","volume-title":"Theory of Cryptography","author":"B Applebaum","year":"2012","unstructured":"Applebaum B., Bogdanov A., Rosen A.: A dichotomy for local small-bias generators. In: Cramer R. (ed.) Theory of Cryptography, pp. 600\u2013617. Springer, Berlin (2012)."},{"key":"1220_CR13","doi-asserted-by":"crossref","unstructured":"Applebaum B., Bogdanov A., Rosen A.: A dichotomy for local small-bias generators. J. Cryptol. 29(3), 577\u2013596 (2016) ISSN: 0933-2790.","DOI":"10.1007\/s00145-015-9202-8"},{"key":"1220_CR14","doi-asserted-by":"crossref","unstructured":"Armknecht F., Carlet C., Gaborit P., K\u00fcnzli S., Meier W., Ruatta O.: Efficient computation of algebraic immunity for algebraic and fast algebraic attacks. In: Serge V. (ed.) EUROCRYPT 2006. LNCS, vol. 4004. Springer, Heidelberg (2006).","DOI":"10.1007\/11761679_10"},{"key":"1220_CR15","first-page":"247","volume-title":"CRYPTO\u201994","author":"J Bierbrauer","year":"1994","unstructured":"Bierbrauer J., Gopalakrishnan K., Stinson D.R.: Bounds for resilient functions and orthogonal arrays. In: Yvo D. (ed.) CRYPTO\u201994, pp. 247\u2013256. LNCS. Springer, Heidelberg (1994)."},{"key":"1220_CR16","doi-asserted-by":"crossref","unstructured":"Boneh D., Ishai Y., Passel\u00e8gue A., Sahai A., Wu D.J.: Exploring crypto dark matter: new simple PRF candidates and their applications. In: TCC. pp. 699\u2013729 (2018).","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"1220_CR17","doi-asserted-by":"crossref","unstructured":"Boyle E., Couteau G., Gilboa N., Ishai Y., Orr\u00fa M.: Homomorphic Secret Sharing: Optimizations and Applications. In: ACM SIGSAC. New York. pp. 2105\u20132122 (2017)","DOI":"10.1145\/3133956.3134107"},{"key":"1220_CR18","doi-asserted-by":"crossref","unstructured":"Boyle E., Couteau G., Gilboa N., Ishai Y., Kohl L., Scholl P.: Correlated Pseudorandom Functions from Variable-Density LPN. In: FOCS. pp. 1069\u20131080 (2020)","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"1220_CR19","doi-asserted-by":"crossref","unstructured":"Braeken A., Preneel B.: On the algebraic immunity of symmetric Boolean functions. In: INDOCRYPT. pp. 35\u201348 (2005)","DOI":"10.1007\/11596219_4"},{"key":"1220_CR20","volume-title":"FSE 2016","author":"A Canteaut","year":"2018","unstructured":"Canteaut A., Carpov S., Fontaine C., Lepoint T., Naya-Plasencia M., Paillier P., Sirdey R.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. In: Thomas P. (ed.) FSE 2016, vol. 9783. LNCS, Heidelberg (2018)."},{"key":"1220_CR21","doi-asserted-by":"crossref","unstructured":"Carlet C.: A method of construction of balanced functions with optimum algebraic immunity. In: International Workshop on Coding and Cryptography (2007)","DOI":"10.1142\/9789812832245_0003"},{"key":"1220_CR22","volume-title":"Boolean Functions for Cryptography and Coding Theory","author":"C Carlet","year":"2021","unstructured":"Carlet C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)."},{"key":"1220_CR23","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-540-89255-7_26","volume-title":"ASIACRYPT 2008","author":"C Carlet","year":"2008","unstructured":"Carlet C., Feng K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Josef P. (ed.) ASIACRYPT 2008, vol. 5350, pp. 425\u2013440. LNCS. Springer, Heidelberg (2008)."},{"key":"1220_CR24","doi-asserted-by":"crossref","unstructured":"Carlet C., Gaborit P.: On the construction of Boolean functions with a good algebraic immunity. In: Boolean Functions: Cryptography and Applications. pp. 1101\u20131105 (2005)","DOI":"10.1109\/ISIT.2005.1523510"},{"key":"1220_CR25","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-030-36237-9_10","volume-title":"Algebra, Codes and Cryptology","author":"C Carlet","year":"2019","unstructured":"Carlet C., M\u00e9aux P.: Boolean functions for homomorphic-friendly stream ciphers. In: Gueye C.T., Persichetti E., Cayrel P.-L., Buchmann J. (eds.) Algebra, Codes and Cryptology, pp. 166\u2013182. Springer, Cham (2019)."},{"key":"1220_CR26","unstructured":"Carlet C., M\u00e9aux P.: A complete study of two classes of Boolean functions for homomorphic-friendly stream ciphers. In: IACR Cryptol. ePrint Arch. 2020, p. 1562 (2020)"},{"key":"1220_CR27","unstructured":"Carlet C., Mesnager S.: On the supports of the Walsh transforms of Boolean functions. Cryptology ePrint Archive, Report 2004\/256 (2004)"},{"issue":"5","key":"1220_CR28","doi-asserted-by":"publisher","first-page":"3404","DOI":"10.1109\/TIT.2021.3139804","volume":"68","author":"C Carlet","year":"2022","unstructured":"Carlet C., M\u00e9aux P.: A complete study of two classes of Boolean functions: direct sums of monomials and threshold functions. IEEE Trans. Inf. Theory 68(5), 3404\u20133425 (2022). https:\/\/doi.org\/10.1109\/TIT.2021.3139804.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1220_CR29","first-page":"3105","volume":"52","author":"C Carlet","year":"2006","unstructured":"Carlet C., Dalai D.K., Gupta K.C., Maitra S.: Algebraic immunity for cryptographically significant boolean functions: analysis and construction. IEEE 52(7), 3105\u20133121 (2006).","journal-title":"IEEE"},{"key":"1220_CR30","first-page":"303","volume":"52","author":"C Carlet","year":"2009","unstructured":"Carlet C., Zeng X., Li C., Lei H.: Further properties of several classes of Boolean functions with optimum algebraic immunity. DCC 52, 303\u2013338 (2009).","journal-title":"DCC"},{"issue":"5","key":"1220_CR31","first-page":"437","volume":"1","author":"YD Chen","year":"2014","unstructured":"Chen Y.D., Zhang Y.N., Tian W.: Construction of even-variable rotation symmetric Boolean functions with optimal algebraic immunity. J. Cryptol. Res. 1(5), 437 (2014).","journal-title":"J. Cryptol. Res."},{"key":"1220_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.dam.2019.02.041","volume":"262","author":"Y Chen","year":"2019","unstructured":"Chen Y., Guo F., Ruan J.: Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks. Discret. Appl. Math. 262, 1\u201312 (2019).","journal-title":"Discret. Appl. Math."},{"key":"1220_CR33","doi-asserted-by":"crossref","first-page":"133335","DOI":"10.1109\/ACCESS.2019.2939296","volume":"7","author":"Y Chen","year":"2019","unstructured":"Chen Y., Lin L., Liao L., Ruan J., Guo F., Cai W.: Constructing higher nonlinear odd-variable RSBFs with optimal AI and almost optimal FAI. IEEE Access 7, 133335\u2013133341 (2019).","journal-title":"IEEE Access"},{"key":"1220_CR34","doi-asserted-by":"crossref","unstructured":"Chen H., Ding C., Mesnager S., Tang C.: A novel application of Boolean functions with high algebraic immunity in minimal codes. In: CoRR arXiv:2004.04932 (2020)","DOI":"10.1109\/TIT.2021.3102314"},{"key":"1220_CR35","doi-asserted-by":"crossref","unstructured":"Chor B., Goldreich O., Hasted J., Freidmann J., Rudich S., Smolensky R.: The bit extraction problem or t-resilient functions. In: FOCS. pp. 396\u2013407 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"key":"1220_CR36","volume-title":"Covering Codes","author":"G Cohen","year":"1997","unstructured":"Cohen G.: Covering Codes. International Congress Series. Elsevier, Amsterdam (1997)."},{"issue":"3","key":"1220_CR37","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/2633602","volume":"6","author":"J Cook","year":"2014","unstructured":"Cook J., Etesami O., Miller R., Trevisan L.: On the one-way function candidate proposed by Goldreich. ACM Trans. Comput. Theory 6(3), 14 (2014).","journal-title":"ACM Trans. Comput. Theory"},{"key":"1220_CR38","volume-title":"EUROCRYPT 2003","author":"N Courtois","year":"2003","unstructured":"Courtois N., Meier W.: Algebraic attacks on stream ciphers with linear feedback. In: Eli B. (ed.) EUROCRYPT 2003, vol. 2656. LNCS. Springer, Heidelberg (2003)."},{"key":"1220_CR39","doi-asserted-by":"crossref","unstructured":"Couteau G., Dupin A., M\u00e9aux P., Rossi M., Rotella Y.: On the Concrete Security of Goldreich\u2019s Pseudorandom Generator. In: ASIACRYPT (2018)","DOI":"10.1007\/978-3-030-03329-3_4"},{"key":"1220_CR40","doi-asserted-by":"crossref","unstructured":"Cryan M., Miltersen P.B.: On pseudorandom generators in NC 0. In: International Symposium on Mathematical Foundations of Computer Science (2001)","DOI":"10.1007\/3-540-44683-4_24"},{"key":"1220_CR41","doi-asserted-by":"crossref","unstructured":"Cusick T., St\u0103nic\u0103 P.: Fast evaluation, weights and nonlinearity of rotation-symmetric functions. In: Discrete Mathematics 258 (2000)","DOI":"10.1016\/S0012-365X(02)00354-0"},{"key":"1220_CR42","unstructured":"Dalai D.K., Maitra S.: Results on Rotation Symmetric Bent Functions. Cryptology ePrint Archive, Report 2005\/118 (2005)"},{"key":"1220_CR43","doi-asserted-by":"crossref","unstructured":"Dalai D.K., Gupta K.C., Maitra S.: Results on Algebraic Immunity for Cryptographically Significant Boolean Functions. In: INDOCRYPT. LNCS. pp. 92\u2013106 (2004)","DOI":"10.1007\/978-3-540-30556-9_9"},{"key":"1220_CR44","doi-asserted-by":"crossref","unstructured":"Dalai D., Gupta K., Maitra S.: Cryptographically Significant Boolean Functions: Construction and Analysis in Terms of Algebraic Immunity. In: FSE 2005. LNCS. pp. 98\u2013111 (2005)","DOI":"10.1007\/11502760_7"},{"key":"1220_CR45","doi-asserted-by":"crossref","unstructured":"Dalai D.K., Maitra S., Sarkar S.: Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. In: DCC (2006)","DOI":"10.1007\/s10623-005-6300-x"},{"key":"1220_CR46","unstructured":"Daniely A., Vardi G.: From Local Pseudorandom Generators to Hardness of Learning. In: CoRR arXiv:2101.08303 (2021)"},{"key":"1220_CR47","unstructured":"Didier F.: Codes de Reed-Muller et cryptanalyse du registre filtr\u00e9. PhD thesis. \u00c9cole Polytechnique, Palaiseau, France (2007)"},{"key":"1220_CR48","first-page":"359","volume-title":"FSE 2006","author":"F Didier","year":"2006","unstructured":"Didier F., Tillich J.-P.: Computing the Algebraic Immunity Efficiently. In: Robshaw Matthew J.B. (ed.) FSE 2006, vol. 4047, pp. 359\u2013374. LNCS. Springer, Heidelberg (2006)."},{"key":"1220_CR49","first-page":"402","volume-title":"CANS 09","author":"S Fu","year":"2009","unstructured":"Fu S., Li C., Matsuura K., Qu L.: Construction of rotation symmetric Boolean functions with maximum algebraic immunity. In: Garay J.A., Miyaji A., Otsuka A. (eds.) CANS 09, vol. 5888, pp. 402\u2013412. LNCS. Springer, Heidelberg (2009)."},{"key":"1220_CR50","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1049\/iet-ifs.2010.0048","volume":"5","author":"S Fu","year":"2011","unstructured":"Fu S., Qu L., Li C., Sun B.: Balanced rotation symmetric Boolean functions with maximum algebraic immunity. Secur. Inform. 5, 93\u201399 (2011).","journal-title":"Secur. Inform."},{"key":"1220_CR51","doi-asserted-by":"crossref","unstructured":"Gay R., Jain A., Lin H., Sahai A.: Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification. In: IACR Cryptol. ePrint Arch. 2020 (2020)","DOI":"10.1007\/978-3-030-77883-5_4"},{"issue":"90","key":"1220_CR52","first-page":"1","volume":"7","author":"O Goldreich","year":"2000","unstructured":"Goldreich O.: Candidate one-way functions based on expander graphs. Electr. Colloquium Comput. Complex. (ECCC) 7(90), 1\u201312 (2000).","journal-title":"Electr. Colloquium Comput. Complex. (ECCC)"},{"key":"1220_CR53","doi-asserted-by":"crossref","unstructured":"Grassi L., Rechberger C., Rotaru D., Scholl P., Smart N.P.: MPC-Friendly Symmetric Key Primitives. In: Weippl E.R., Katzenbeisser S., Kruegel C., Myers A.C., Halevi S. (eds.) ACM SIGSAC CCS. (2016)","DOI":"10.1145\/2976749.2978332"},{"key":"1220_CR54","doi-asserted-by":"crossref","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Cryptography with constant computational overhead. In: 40th ACM STOC. ACM Press, pp. 433\u2013442 (2008)","DOI":"10.1145\/1374376.1374438"},{"key":"1220_CR55","doi-asserted-by":"crossref","unstructured":"Jain A., Lin H., Matt C., Sahai A.: How to leverage hardness of constant-degree expanding polynomials over R to build iO. In: Ishai Y., Rijmen V. (eds.) EUROCRYPT. Vol. 11476. Lecture Notes in Computer Science. pp. 251\u2013281 (2019)","DOI":"10.1007\/978-3-030-17653-2_9"},{"key":"1220_CR56","unstructured":"Jain A., Lin H., Sahai A.: Simplifying Constructions and Assumptions for iO. In: IACR Cryptol. ePrint Arch. 2019, p. 1252 (2019)"},{"key":"1220_CR57","unstructured":"Jin Q., Liu Z., Wu B., Zhang X.: A general conjecture similar to T-D conjecture and its applications in constructing Boolean functions with optimal algebraic immunity. Cryptology ePrint Archive, Report 2011\/515. (2011)"},{"key":"1220_CR58","unstructured":"Jin Q., Liu Z., Wu B.: 1-Resilient Boolean Function with Optimal Algebraic Immunity. Cryptology ePrint Archive, Report 2011\/549 (2011)"},{"key":"1220_CR59","doi-asserted-by":"crossref","unstructured":"Kavut S., Maitra S., Sarkar S., Y\u00fccel M.D.: Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity $$> 240$$. In: INDOCRYPT, pp. 266\u2013279 (2006)","DOI":"10.1007\/11941378_19"},{"key":"1220_CR60","doi-asserted-by":"crossref","unstructured":"Li N., Qi W.-F.: Construction and analysis of Boolean functions of 2t+1 variables with maximum algebraic immunity. In: Lai X., Chen K. (eds.) ASIACRYPT 2006. vol. 4284, pp. 84\u201398. LNCS (2006)","DOI":"10.1007\/11935230_6"},{"issue":"3","key":"1220_CR61","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1109\/TIT.2007.915914","volume":"54","author":"N Li","year":"2008","unstructured":"Li N., Qu L., Qi W., Feng G., Li C., Xie D.: On the construction of Boolean functions with optimal algebraic immunity. IEEE Trans. Inf. Theory 54(3), 1330\u20131334 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1220_CR62","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10623-014-9949-1","volume":"76","author":"J Li","year":"2014","unstructured":"Li J., Carlet C., Zeng X., Hu L., Shan J.: Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks. Des. Codes Cryptogr. 76, 279\u2013305 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1220_CR63","first-page":"1685","volume":"86","author":"K Limniotis","year":"2018","unstructured":"Limniotis K., Kolokotronis N.: Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction. DCC 86, 1685\u20131706 (2018).","journal-title":"DCC"},{"key":"1220_CR64","doi-asserted-by":"crossref","unstructured":"Limniotis K., Kolokotronis N., Kalouptsidis N.: Secondary constructions of Boolean functions with maximum algebraic immunity. In: Cryptography and Communications 5 (2013)","DOI":"10.1007\/s12095-013-0081-2"},{"key":"1220_CR65","doi-asserted-by":"crossref","unstructured":"Liu M., Lin D.: Almost perfect algebraic immune functions with good nonlinearity. In: 2014 IEEE International Symposium on Information Theory, pp. 1837\u20131841 (2014)","DOI":"10.1109\/ISIT.2014.6875151"},{"key":"1220_CR66","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.ins.2017.08.097","volume":"421","author":"M Liu","year":"2017","unstructured":"Liu M., Lin D.: Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks. Inf. Sci. 421, 181\u2013203 (2017).","journal-title":"Inf. Sci."},{"key":"1220_CR67","doi-asserted-by":"crossref","unstructured":"Lombardi A., Vaikuntanathan V.: Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. In: TCC, pp. 119\u2013137 (2017)","DOI":"10.1007\/978-3-319-70500-2_5"},{"key":"1220_CR68","unstructured":"McLaughlin J., Clark J.A.: Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity. Cryptology ePrint Archive, Report 2013\/011 (2013)"},{"key":"1220_CR69","doi-asserted-by":"crossref","unstructured":"M\u00e9aux P., Journault A.F., Carlet C.: Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts. In: EUROCRYPT, pp. 311\u2013343 (2016)","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"1220_CR70","doi-asserted-by":"crossref","unstructured":"M\u00e9aux P., Carlet C., Journault A., Standaert F.: Improved Filter Permutators for Efficient FHE: Better Instances and Implementations. In: Hao F., Ruj S., Gupta S.S. (eds.) INDOCRYPT. vol. 11898, pp. 68\u201391. LNCS (2019)","DOI":"10.1007\/978-3-030-35423-7_4"},{"key":"1220_CR71","unstructured":"M\u00e9aux P., Carlet C., Journault A., Standaert F.-X.: Improved Filter Permutators: Combining Symmetric Encryption Design, Boolean Functions, Low Complexity Cryptography, and Homomorphic Encryption, for Private Delegation of Computations. Cryptology ePrint Archive, Report 2019\/483 (2019)"},{"key":"1220_CR72","first-page":"474","volume-title":"Advances in Cryptology-EUROCRYPT","author":"W Meier","year":"2004","unstructured":"Meier W., Pasalic E., Carlet C.: Algebraic attacks and decomposition of Boolean functions. In: Cachin C., Camenisch J. (eds.) Advances in Cryptology-EUROCRYPT, vol. 3027, pp. 474\u2013491. Lecture Notes in Computer Science. Springer, Berlin (2004)."},{"issue":"1","key":"1220_CR73","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10623-020-00806-y","volume":"89","author":"S Mesnager","year":"2021","unstructured":"Mesnager S., Sihong S., Zhang H.: A construction method of balanced rotation symmetric Boolean functions on arbitrary even number of variables with optimal algebraic immunity. Des. Codes Cryptogr. 89(1), 1\u201317 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1220_CR74","doi-asserted-by":"crossref","unstructured":"Mossel E., Shpilka A., Trevisan L.: On e-Biased Generators in NC0. In: 44th FOCS, pp. 136\u2013145. IEEE Computer Society Press (2003)","DOI":"10.1109\/SFCS.2003.1238188"},{"key":"1220_CR75","doi-asserted-by":"crossref","unstructured":"ODonnell R., Witmer D.: Goldreich\u2019s PRG: evidence for near-optimal polynomial stretch. In: Conference on Computational Complexity (CCC), pp. 1\u201312. IEEE (2014)","DOI":"10.1109\/CCC.2014.9"},{"key":"1220_CR76","first-page":"269","volume":"26","author":"S-S Pan","year":"2011","unstructured":"Pan S.-S., Xiao-Tong F., Zhang W.-G.: Construction of 1resilient Boolean functions with optimal algebraic immunity and good nonlinearity. JCST 26, 269\u2013275 (2011).","journal-title":"JCST"},{"key":"1220_CR77","first-page":"399","volume-title":"ICISC 08","author":"E Pasalic","year":"2009","unstructured":"Pasalic E.: Almost Fully Optimized Infinite Classes of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis. In: Lee P.J., Cheon J.H. (eds.) ICISC 08, vol. 5461, pp. 399\u2013414. LNCS. Springer, Heidelberg (2009)."},{"key":"1220_CR78","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BFb0053731","volume-title":"Information Security and Privacy","author":"J Pieprzyk","year":"1998","unstructured":"Pieprzyk J., Qu C.X.: Rotation-symmetric functions and fast hashing. In: Boyd C., Dawson E. (eds.) Information Security and Privacy, pp. 169\u2013180. Springer, Berlin (1998)."},{"issue":"8","key":"1220_CR79","doi-asserted-by":"crossref","first-page":"4014","DOI":"10.1109\/TIT.2010.2050801","volume":"56","author":"P Rizomiliotis","year":"2010","unstructured":"Rizomiliotis P.: On the resistance of Boolean functions against algebraic attacks using univariate polynomial representation. IEEE Trans. Inf. Theory 56(8), 4014\u20134024 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1220_CR80","unstructured":"Sarkar S., Maitra S.: Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on Odd Number of Variables. Cryptology ePrint Archive, Report 2007\/290 (2007)"},{"issue":"5","key":"1220_CR81","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"30","author":"T Siegenthaler","year":"1984","unstructured":"Siegenthaler T.: Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE IT 30(5), 776\u2013780 (1984).","journal-title":"IEEE IT"},{"key":"1220_CR82","doi-asserted-by":"crossref","unstructured":"Song S., Zhang J., Du J., Wen Q.: On the construction of Boolean functions with optimal algebraic immunity and good other properties by concatenation. In: 2010 IEEE International Conference on Progress in Informatics and Computing. vol. 1, pp. 417\u2013422 (2010)","DOI":"10.1109\/PIC.2010.5687590"},{"key":"1220_CR83","first-page":"161","volume-title":"FSE 2004","author":"P Stanica","year":"2004","unstructured":"Stanica P., Maitra S., Clark J.A.: Results on rotation symmetric bent and correlation immune Boolean functions. In: Roy B.K., Meier W. (eds.) FSE 2004, vol. 3017, pp. 161\u2013177. LNCS, Heidelberg (2004)."},{"key":"1220_CR84","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10623-012-9727-x","volume":"71","author":"S Su","year":"2014","unstructured":"Su S., Tang X.: Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity. Des. Codes Cryptogr. 71, 183\u2013199 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1220_CR85","unstructured":"Tang X., Tang D., Zeng X., Hu .Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity. Cryptology ePrint Archive, Report 2010\/443 (2010)"},{"issue":"1","key":"1220_CR86","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/TIT.2012.2217476","volume":"59","author":"D Tang","year":"2013","unstructured":"Tang D., Carlet C., Tang X.: Highly nonlinear Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks. IEEE Trans. Inf. Theory 59(1), 653\u2013664 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1220_CR87","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1142\/S0129054114500324","volume":"25","author":"D Tang","year":"2014","unstructured":"Tang D., Carlet C., Tang X.: A class of 1-resilient Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks. Int. J. Found. Comput. Sci. 25, 763\u2013780 (2014).","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1220_CR88","first-page":"6113","volume":"63","author":"D Tang","year":"2017","unstructured":"Tang D., Carlet C., Tang X., Zhou Z.: Construction of highly nonlinear 1-resilient Boolean functions with optimal algebraic immunity and provably high fast algebraic immunity. IEEE Trans. Inf. Theory 63, 6113\u20136125 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1220_CR89","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-44495-5_3","volume-title":"INDOCRYPT 2000","author":"Y Tarannikov","year":"2000","unstructured":"Tarannikov Y.: On Resilient Boolean Functions with Maximal Possible Nonlinearity. In: Roy B.K., Okamoto E. (eds.) INDOCRYPT 2000, vol. 1977, pp. 19\u201330. LNCS. Springer, Heidelberg (2000)."},{"key":"1220_CR90","doi-asserted-by":"crossref","unstructured":"Wang T., Liu M., Lin D.: Construction of resilient and nonlinear Boolean functions with almost perfect immunity to algebraic and fast algebraic attacks. In: International Conference on Information Security and Cryptology (2013)","DOI":"10.1007\/978-3-642-38519-3_18"},{"key":"1220_CR91","doi-asserted-by":"crossref","unstructured":"Wu B., Zheng J., Lin D.: Constructing Boolean functions with (potentially) optimal algebraic immunity based on multiplicative decompositions of finite fields. In: ISIT, pp. 491\u2013495 (2015)","DOI":"10.1109\/ISIT.2015.7282503"},{"issue":"2","key":"1220_CR92","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1109\/TIT.2021.3128315","volume":"68","author":"J Yang","year":"2022","unstructured":"Yang J., Guo Q., Johansson T., Lentmaier M.: Revisiting the concrete security of Goldreich\u2019s pseudorandom generator. IEEE Trans. Inf. Theory 68(2), 1329\u20131354 (2022). https:\/\/doi.org\/10.1109\/TIT.2021.3128315.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1220_CR93","doi-asserted-by":"crossref","first-page":"6310","DOI":"10.1109\/TIT.2011.2109935","volume":"57","author":"X Zeng","year":"2011","unstructured":"Zeng X., Carlet C., Shan J., Hu L.: More balanced Boolean functions with optimal algebraic immunity and good nonlinearity and resistance to fast algebraic attacks. IEEE Trans. Inf. Theory 57(9), 6310\u20136320 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1220_CR94","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.dam.2019.02.030","volume":"262","author":"H Zhang","year":"2019","unstructured":"Zhang H., Su S.: A new construction of rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity. Discret. Appl. Math. 262, 13\u201328 (2019).","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1220_CR95","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1016\/j.mcm.2011.09.008","volume":"55","author":"P Zhang","year":"2012","unstructured":"Zhang P., Dong D., Shaojing F., Li C.: New constructions of evenvariable rotation symmetric Boolean functions with maximum algebraic immunity. Math. Comput. Model. 55(3), 828\u2013836 (2012).","journal-title":"Math. Comput. Model."},{"key":"1220_CR96","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1142\/S0129054114500208","volume":"25","author":"J Zheng","year":"2014","unstructured":"Zheng J., Baofeng W., Chen Y.-F., Liu Z.: Constructing 2m-variable Boolean functions with optimal algebraic immunity based on polar decomposition of F22m. Int. J. Found. Comput. Sci. 25, 537\u2013551 (2014).","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1220_CR97","first-page":"1","volume":"60","author":"T Ziran","year":"2011","unstructured":"Ziran T., Deng Y.: A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity. DCC 60, 1\u201314 (2011).","journal-title":"DCC"},{"key":"1220_CR98","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.dam.2011.08.006","volume":"160","author":"T Ziran","year":"2012","unstructured":"Ziran T., Deng Y.: Boolean functions optimizing most of the cryptographic criteria. Discret. Appl. Math. 160, 427\u2013435 (2012).","journal-title":"Discret. Appl. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01220-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01220-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01220-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T03:26:26Z","timestamp":1729481186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01220-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,25]]},"references-count":98,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1220"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01220-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,25]]},"assertion":[{"value":"27 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}