{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:35:05Z","timestamp":1767321305084,"version":"3.48.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-10536-3_9","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:56Z","timestamp":1767321176000},"page":"235-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Revisited Hidden Weight Bit Function"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5733-4341","authenticated-orcid":false,"given":"Pierrick","family":"M\u00e9aux","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4200-7553","authenticated-orcid":false,"given":"Tim","family":"Seur\u00e9","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8373-9200","authenticated-orcid":false,"given":"Deng","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Guimar\u00e3es, A., Hoffmann, C., M\u00e9aux, P.: Secure and Efficient Transciphering for FHE-Based MPC. IACR Cryptology ePrint Archive (2024)","DOI":"10.46586\/tches.v2025.i3.745-780"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Armknecht, F.: Improving fast algebraic attacks. In: Fast Software Encryption, Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-25937-4_5"},{"key":"9_CR3","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: Advances in Cryptology, EUROCRYPT 2006. Springer, Heidelberg (2006)","DOI":"10.1007\/11761679_10"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Beierle, C., Leander, G.: 4-uniform permutations with null nonlinearity. Crypt. Commun. 12 (2020)","DOI":"10.1007\/s12095-020-00434-2"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bollig, B., L\u00f6bbing, M., Sauerhoff, M., Wegener, I.: On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theoret. Inf. Appl. 33(2) (1999)","DOI":"10.1051\/ita:1999108"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Braeken, A., Preneel, B.: On the Algebraic Immunity of Symmetric Boolean Functions. In: Progress in Cryptology, INDOCRYPT 2005. Springer, Heidelberg (2005)","DOI":"10.1007\/11596219_4"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40(2) (1991)","DOI":"10.1109\/12.73590"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Budaghyan, L., Carlet, C., Helleseth, T.: On Bent functions associated to AB functions. In: IEEE Information Theory Workshop 2011. IEEE (2011)","DOI":"10.1109\/ITW.2011.6089365"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00145-017-9273-9","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9273-9","journal-title":"J. Cryptol."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Videau, M.: Symmetric Boolean functions. IEEE Trans. Inf. Theor. (2005)","DOI":"10.1109\/TIT.2005.851743"},{"key":"9_CR11","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. Theor. (2004)","DOI":"10.1109\/TIT.2004.833361"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press (2021)","DOI":"10.1017\/9781108606806"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Carlet, C.: A wide class of Boolean functions generalizing the hidden weight bit function. IEEE Trans. Inf. Theor. 68(2) (2022)","DOI":"10.1109\/TIT.2021.3126684"},{"key":"9_CR14","doi-asserted-by":"crossref","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. Theor. (2021)","DOI":"10.1109\/TIT.2021.3139804"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Carlet, C., M\u00e9aux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Trans. Symmetric Cryptol. 2017 (2017)","DOI":"10.46586\/tosc.v2017.i3.192-227"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Carlet, C., Sarkar, P.: Constructions of efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks. IACR Cryptology ePrint Archive (2024)","DOI":"10.1016\/j.dam.2025.05.004"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Carlet, C., Tang, D.: Enhanced Boolean functions suitable for the filter model of pseudo-random generator. Des. Codes Crypt. 76(3) (2015)","DOI":"10.1007\/s10623-014-9978-9"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Chen, Y., Lu, P.: Two classes of symmetric Boolean functions with optimum algebraic immunity: construction and analysis. IEEE Trans. Inf. Theor. 57 (2011)","DOI":"10.1109\/TIT.2011.2111810"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Cid, C., Indr\u00f8y, J.P., Raddum, H.: FASTA \u2013 a stream cipher for fast FHE evaluation. In: Topics in Cryptology, CT-RSA 2022. Springer, Heidelberg (2022)","DOI":"10.1007\/978-3-030-95312-6_19"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Cong, K., Das, D., Park, J., Pereira, H.V.L.: SortingHat: efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. ACM (2022)","DOI":"10.1145\/3548606.3560702"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Courtois, N.T.: Fast algebraic attacks on stream ciphers with linear feedback. In: Advances in Cryptology, CRYPTO 2003. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-45146-4_11"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345\u2013359. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_21"},{"key":"9_CR23","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 Crypt. (2006)","DOI":"10.1007\/s10623-005-6300-x"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Dobbertin, H.: Construction of Bent functions and balanced Boolean functions with high nonlinearity. In: Fast Software Encryption. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-60590-8_5"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-96884-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Dobraunig","year":"2018","unstructured":"Dobraunig, C., et al.: Rasta: a cipher with low ANDdepth and few ANDs per bit. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 662\u2013692. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Gini, A., M\u00e9aux, P.: On the weightwise nonlinearity of weightwise perfectly balanced functions. Discrete Appl. Math. 322 (2022)","DOI":"10.1016\/j.dam.2022.08.017"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-28628-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"P Hawkes","year":"2004","unstructured":"Hawkes, P., Rose, G.G.: Rewriting variables: the complexity of fast algebraic attacks on stream ciphers. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 390\u2013406. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_24"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-65277-7_3","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"C Hoffmann","year":"2020","unstructured":"Hoffmann, C., M\u00e9aux, P., Ricosset, T.: Transciphering, using FiLIP and TFHE for an efficient delegation of computation. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 39\u201361. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_3"},{"key":"9_CR29","unstructured":"Jiao, L., Zhang, B., Wang, M.: Establishing equations: the complexity of algebraic and fast algebraic attacks revisited. In: Information Security. Springer, Heidelberg (2013)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Liu, M., Lin, D., Pei, D.: Fast algebraic attacks and decomposition of symmetric Boolean functions. IEEE Trans. Inf. Ther. 57(7) (2011)","DOI":"10.1109\/TIT.2011.2145690"},{"key":"9_CR31","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company (1978)"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of Boolean functions. In: Advances in Cryptology, EUROCRYPT 2004. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24676-3_28"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Mesnager, S.: Bent Functions. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-319-32595-8"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-30530-7_5","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"P M\u00e9aux","year":"2019","unstructured":"M\u00e9aux, P.: On the fast algebraic immunity of majority functions. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 86\u2013105. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_5"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P.: On the fast algebraic immunity of threshold functions. Crypt. Commun. 13 (2021)","DOI":"10.1007\/s12095-021-00505-y"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-35423-7_4","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"P M\u00e9aux","year":"2019","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., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 68\u201391. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_4"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","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. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P., Ozaim, Y.: On the cryptographic properties of weightwise affine and weightwise quadratic functions. Discrete Appl. Math. 355 (2024)","DOI":"10.1016\/j.dam.2024.04.008"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"M\u00e9aux, P., Park, J., Pereira, H.V.L.: Towards practical transciphering for FHE with setup independent of the plaintext space. IACR Commun. Cryptol. 1(1) (2024)","DOI":"10.62056\/anxrxrxqi"},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K.E., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Cloud Computing Security Workshop, CCSW 2011. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Qu, L., Feng, K., Liu, F., Wang, L.: Constructing symmetric boolean functions with maximum algebraic immunity. IEEE Trans. Inf. Theor. (2009)","DOI":"10.1109\/TIT.2009.2015999"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Rothaus, O.S.: On \u201cBent\u201d functions. J. Comb. Theor. Ser. A 20 (1976)","DOI":"10.1016\/0097-3165(76)90024-8"},{"key":"9_CR43","unstructured":"Rudin, W.: Real and Complex Analysis. McGraw-Hill Book Company (1987)"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Maitra, S.: Balancedness and correlation immunity of symmetric Boolean functions. Discrete Math. (2007)","DOI":"10.1016\/j.disc.2006.08.008"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Tokareva, N.: Bent Functions: Results and Applications to Cryptography. Academic Press (2015)","DOI":"10.1016\/B978-0-12-802318-1.00002-9"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Wang, Q., Carlet, C., Stanica, P., Tan, C.H.: Cryptographic properties of the hidden weighted bit function. Discrete Appl. Math. 174 (2014)","DOI":"10.1016\/j.dam.2014.01.010"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:32:58Z","timestamp":1767321178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}