{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:45:27Z","timestamp":1777376727483,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Fonds Sp\u00e9cial de Recherche FSR"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s12095-021-00505-y","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T08:02:40Z","timestamp":1624953760000},"page":"741-762","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the fast algebraic immunity of threshold functions"],"prefix":"10.1007","volume":"13","author":[{"given":"Pierrick","family":"M\u00e9aux","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"key":"505_CR1","doi-asserted-by":"crossref","unstructured":"Courtois, N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003, volume 2729 of LNCS, pp 176\u2013194. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-45146-4_11"},{"key":"505_CR2","doi-asserted-by":"crossref","unstructured":"Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003, volume 2656 of LNCS. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-39200-9_21"},{"key":"505_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Lovett, S.: Algebraic attacks against random local functions and their countermeasures. In: Wichs, Daniel, Mansour, Y (eds.) 48th ACM STOC. ACM Press, June (2016)","DOI":"10.1145\/2897518.2897554"},{"key":"505_CR4","doi-asserted-by":"crossref","unstructured":"Armknecht, F.: Improving fast algebraic attacks. In: Roy, B.K., Meier, Willi (eds.) FSE 2004, volume 3017 of LNCS, pp 65\u201382. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-25937-4_5"},{"key":"505_CR5","doi-asserted-by":"crossref","unstructured":"Hawkes, P., Rose, G.G.: Rewriting variables: The complexity of fast algebraic attacks on stream ciphers. In: Franklin, M. (ed.) CRYPTO 2004, volume 3152 of LNCS, pp 390\u2013406. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-28628-8_24"},{"key":"505_CR6","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: Vaudenay, S. (ed.) EUROCRYPT 2006, volume 4004 of LNCS. Springer, Heidelberg (2006)","DOI":"10.1007\/11761679_10"},{"key":"505_CR7","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part I, volume 9665 of LNCS, pp 311\u2013343. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"505_CR8","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P., Carlet, C., Journault, A., Standaert, F.-X.: Improved filter permutators for efficient FHE: better instances and implementations. In: Hao, F., Ruj, S., Gupta, S.S. (eds.) Progress in cryptology - INDOCRYPT, volume 11898 of LNCS, pp. 68\u201391. Springer (2019)","DOI":"10.1007\/978-3-030-35423-7_4"},{"key":"505_CR9","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. Electron. Colloq. Comput. Complex. (ECCC) 7(90) (2000)"},{"key":"505_CR10","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. Cryptol. ePrint Arch., Report 2019\/483 (2019)"},{"key":"505_CR11","doi-asserted-by":"crossref","unstructured":"Hoffmann, C., M\u00e9aux, P., Ricosset, T.: Transciphering, using filip and TFHE for an efficient delegation of computation. In: Progress in cryptology - INDOCRYPT 2020 - 21st International conference on cryptology in India, Bangalore, India, December 13-16, 2020, Proceedings, pp. 39\u201361 (2020)","DOI":"10.1007\/978-3-030-65277-7_3"},{"key":"505_CR12","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Lovett, S.: Algebraic attacks against random local functions and their countermeasures. SIAM J. Comput., 52\u201379 (2018)","DOI":"10.1137\/16M1085942"},{"key":"505_CR13","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.1109\/TIT.2002.801482","volume":"48","author":"S Maitra","year":"2002","unstructured":"Maitra, S., Sarkar, P.: Maximum nonlinearity of symmetric boolean functions on odd number of variables. IEEE Trans. Inf. Theory 48, 2626\u20132630 (2002). https:\/\/doi.org\/10.1109\/TIT.2002.801482","journal-title":"IEEE Trans. Inf. Theory"},{"key":"505_CR14","doi-asserted-by":"crossref","unstructured":"Carlet, C.: On the degree, nonlinearity, algebraic thickness, and nonnormality of boolean functions, with developments on symmetric functions. IEEE Trans. Inf. Theory, 2178\u20132185 (2004)","DOI":"10.1109\/TIT.2004.833361"},{"key":"505_CR15","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Videau, M.: Symmetric boolean functions. IEEE Trans. Inf. Theory, 2791\u20132811 (2005)","DOI":"10.1109\/TIT.2005.851743"},{"key":"505_CR16","doi-asserted-by":"crossref","unstructured":"An, B., Preneel, B.: On the algebraic immunity of symmetric boolean functions. In: Progress in cryptology - INDOCRYPT 2005, 6th International conference on cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings, pp. 35\u201348 (2005)","DOI":"10.1007\/11596219_4"},{"key":"505_CR17","doi-asserted-by":"crossref","unstructured":"Qu, L., Feng, K., Liu, F., Wang, L.: Constructing symmetric boolean functions with maximum algebraic immunity. IEEE Trans. Inf. Theory, 2406\u20132412 (2009)","DOI":"10.1109\/TIT.2009.2015999"},{"issue":"4","key":"505_CR18","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/TIT.2011.2111810","volume":"57","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Lu, P.: Two classes of symmetric boolean functions with optimum algebraic immunity: Construction and analysis. IEEE Trans. Inf. Theory 57(4), 2522\u20132538 (2011). ISSN 1557-9654. https:\/\/doi.org\/10.1109\/TIT.2011.2111810","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"505_CR19","doi-asserted-by":"publisher","first-page":"5199","DOI":"10.1109\/TIT.2015.2455052","volume":"62","author":"G Gao","year":"2016","unstructured":"Gao, G., Guo, Y., Zhao, Y.: Recent results on balanced symmetric boolean functions. IEEE Trans. Inf. Theory 62(9), 5199\u20135203 (2016). ISSN 1557-9654. https:\/\/doi.org\/10.1109\/TIT.2015.2455052","journal-title":"IEEE Trans. Inf. Theory"},{"key":"505_CR20","doi-asserted-by":"crossref","unstructured":"Carlet, C., M\u00e9aux, P.: Boolean functions for homomorphic-friendly stream ciphers. In: Proceedings of the Conference on Algebra, Codes and Cryptology (A2C), pp 166\u2013182. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-36237-9_10"},{"key":"505_CR21","first-page":"1562","volume":"2020","author":"C Carlet","year":"2020","unstructured":"Carlet, C., M\u00e9aux, P.: A complete study of two classes of boolean functions for homomorphic-friendly stream ciphers. IACR Cryptol. ePrint Arch. 2020, 1562 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"505_CR22","doi-asserted-by":"crossref","unstructured":"Tang, D., Luo, R., Du, X.: The exact fast algebraic immunity of two subclasses of the majority function. IEICE Trans., 2084\u20132088 (2016)","DOI":"10.1587\/transfun.E99.A.2084"},{"key":"505_CR23","doi-asserted-by":"crossref","unstructured":"Chen, Y., Guo, F., Zhang, L., Fast algebraic immunity of 2m +\u20092 and 2m +\u20093 variables majority function. Cryptol. ePrint Arch. Report 2019\/286 (2019)","DOI":"10.1109\/ACCESS.2019.2923456"},{"key":"505_CR24","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P.: On the fast algebraic immunity of majority functions. In: Schwabe, P., Th\u00e9riault, N. (eds.) Progress in cryptology - LATINCRYPT, volume 11774 of LNCS, pp. 86\u2013105. Springer (2019)","DOI":"10.1007\/978-3-030-30530-7_5"},{"key":"505_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/9781108606806","volume-title":"Boolean Functions for Cryptography and Coding Theory","author":"C Carlet","year":"2020","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2020)"},{"key":"505_CR26","doi-asserted-by":"crossref","unstructured":"Dalai, D.K., Maitra, S., Sarkar, S.: Basic theory in construction of boolean functions with maximum possible annihilator immunity. Des. Codes Cryptogr. (2006)","DOI":"10.1007\/s10623-005-6300-x"},{"key":"505_CR27","doi-asserted-by":"crossref","unstructured":"Qu, L., Li, C., Feng, K.: A note on symmetric boolean functions with maximum algebraic immunity in odd number of variables. IEEE Trans. Inf. Theory 53 (2007)","DOI":"10.1109\/TIT.2007.901189"},{"key":"505_CR28","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Maitra, S.: Balancedness and correlation immunity of symmetric boolean functions. Discrete Math. :2351\u20132358. ISSN 0012-365X (2007)","DOI":"10.1016\/j.disc.2006.08.008"},{"key":"505_CR29","doi-asserted-by":"publisher","first-page":"09","DOI":"10.1137\/0602037","volume":"2","author":"N Linial","year":"1981","unstructured":"Linial, N., Rothschild, B.: Incidence matrices of subsets\u2014a rank formula. SIAM J. Algebraic. Discrete Methods 2, 09 (1981)","journal-title":"SIAM J. Algebraic. Discrete Methods"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00505-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-021-00505-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-021-00505-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T05:43:50Z","timestamp":1633844630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-021-00505-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["505"],"URL":"https:\/\/doi.org\/10.1007\/s12095-021-00505-y","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,29]]},"assertion":[{"value":"9 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}