{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:14:25Z","timestamp":1783437265258,"version":"3.54.6"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819546732","type":"print"},{"value":"9789819546749","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"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-981-95-4674-9_3","type":"book-chapter","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T11:12:22Z","timestamp":1763982742000},"page":"45-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate CRT-Based Gadget Decomposition for\u00a0Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3410-3134","authenticated-orcid":false,"given":"Olivier","family":"Bernard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4433-2333","authenticated-orcid":false,"given":"Marc","family":"Joye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,25]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology \u2013 CRYPTO 2014. LNCS, vol. 8616, pp. 297\u2013314. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Belorgey, M.G., Carpov, S., Gama, N., Guasch, S., Jetchev, D.: Revisiting key decomposition techniques for FHE: Simpler, faster and more generic. In: Chung, K.M., Sasaki, Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2024, Part I. LNCS, vol. 15484, pp. 176\u2013207. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_6","DOI":"10.1007\/978-981-96-0875-1_6"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Bonnoron, G., Ducas, L., Fillinger, M.: Large FHE gates from Tensored homomorphic accumulator. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) Progress in Cryptology \u2013 AFRICACRYPT 2018. LNCS, vol. 10831, pp. 217\u2013251. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_13","DOI":"10.1007\/978-3-319-89339-6_13"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Bonte, C., Iliashenko, I., Park, J., Pereira, H.V.L., Smart, N.P.: FINAL: faster FHE instantiated with NTRU and LWE. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022, Part II. LNCS, vol. 13792, pp. 188\u2013215. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_7","DOI":"10.1007\/978-3-031-22966-4_7"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 13:1\u201313:36 (2014). https:\/\/doi.org\/10.1145\/2633600, earlier version in ITCS 2012","DOI":"10.1145\/2633600"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Chen, Y., Genise, N., Mukherjee, P.: Approximate trapdoors for lattices and\u00a0smaller hash-and-sign signatures. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2019. LNCS, vol. 11923, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_1","DOI":"10.1007\/978-3-030-34618-8_1"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Cheon, J., et al.: Introduction to homomorphic encryption and schemes. In: Lauter, K., Dai, W., Laine, K. (eds.) Protecting Privacy through Homomorphic Encryption, pp. 3\u201328. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77287-1_1","DOI":"10.1007\/978-3-030-77287-1_1"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 Seconds. In: Cheon, J.H., Takagi, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2016. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1","DOI":"10.1007\/978-3-662-53887-6_1"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2019","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Joye, M., Paillier, P.: Programmable bootstrapping enables efficient homomorphic inference of deep neural networks. In: Dolev, S., Margalit, O., Pinkas, B., Schwarzmann, A. (eds.) Cyber Security, Cryptology, and Machine Learning (CSCML 2021). LNCS, vol. 12716, pp. 1\u201319. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78086-9_1","DOI":"10.1007\/978-3-030-78086-9_1"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Ligier, D., Orfila, J.-B., Tap, S.: Improved programmable bootstrapping with\u00a0larger precision and\u00a0efficient arithmetic circuits for\u00a0TFHE. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2021. LNCS, vol. 13092, pp. 670\u2013699. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_23","DOI":"10.1007\/978-3-030-92078-4_23"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Gama, N., Izabach\u00e8ne, M., Nguyen, P.Q., Xie, X.: Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 528\u2013558. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-519","DOI":"10.1007\/978-3-662-49896-519"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"von\u00a0zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, 3rd edn. (2013). https:\/\/doi.org\/10.1017\/CBO9781139856065","DOI":"10.1017\/CBO9781139856065"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM Press (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry, C.: Computing arbitrary functions of encrypted data. Commun. ACM 53(3), 97\u2013105 (2010). https:\/\/doi.org\/10.1145\/1666420.1666444","journal-title":"Commun. ACM"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology \u2013 CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Halevi, S.: Homomorphic encryption. In: Lindell, Y. (ed.) Tutorials on the Foundations of Cryptography, pp. 219\u2013276. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_5","DOI":"10.1007\/978-3-319-57048-8_5"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Halevi, S., Halevi, T., Shoup, V., Stephens-Davidowitz, N.: Implementing BP-obfuscation using graph-induced encoding. In: Evans, D., et\u00a0al. (eds.) 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 783\u2013798. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3133976","DOI":"10.1145\/3133956.3133976"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Joye, M.: SoK: fully homomorphic encryption over the [discretized] torus. IACR Trans. Cryptogr. Hardware Embed. Syst. 2022(4), 661\u2013692 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.661-692","DOI":"10.46586\/tches.v2022.i4.661-692"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Joye, M., Paillier, P.: Blind rotation in fully homomorphic encryption with extended keys. In: Dolev, S., et\u00a0al. (eds.) Cyber Security, Cryptology, and Machine Learning (CSCML2022). LNCS, vol. 13301, pp. 1\u201318. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-07689-3_1","DOI":"10.1007\/978-3-031-07689-3_1"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Joye, M., Walter, M.: Liberating TFHE: programmable bootstrapping with general quotient polynomials. In: Brenner, M., et\u00a0al. (eds.) 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC 2022), pp. 1\u201311. ACM Press (2022). https:\/\/doi.org\/10.1145\/3560827.3563376","DOI":"10.1145\/3560827.3563376"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Kim, M., Lee, D., Seo, J., Song, Y.: Accelerating HE operations from key decomposition technique. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 70\u201392. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_3","DOI":"10.1007\/978-3-031-38551-3_3"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Polyakov, Y.: Bootstrapping in FHEW-like cryptosystems. In: Brenner, M., et\u00a0al. (eds.) 9th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC 2021), pp. 17\u201328. ACM Press (2021). https:\/\/doi.org\/10.1145\/3474366.3486924","DOI":"10.1145\/3474366.3486924"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Pei, D., Salomaa, A., Ding, C.: Chinese Remainder Theorem: Applications in Computing, Coding. Cryptography. World Scientific Publishing Company (1996). https:\/\/doi.org\/10.1142\/3254","DOI":"10.1142\/3254"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"3_CR30","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: DeMillo, R.A., et\u00a0al. (eds.) Foundations of Secure Computation, pp. 165\u2013179. Academic Press (1978). https:\/\/people.csail.mit.edu\/rivest\/pubs.html#RAD78"},{"key":"3_CR31","unstructured":"Xilinx: UltraScale architecture DSP slice. User Guide, v1.11 (2021). https:\/\/docs.xilinx.com\/v\/u\/en-US\/ug579-ultrascale-dsp"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4674-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T14:22:05Z","timestamp":1783434125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4674-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,25]]},"ISBN":["9789819546732","9789819546749"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4674-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,25]]},"assertion":[{"value":"25 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWSEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"25 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwsec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iwsec.org\/2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}