{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:38:44Z","timestamp":1781887124841,"version":"3.54.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T00:00:00Z","timestamp":1721779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T00:00:00Z","timestamp":1721779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/08293-7, 2019\/12783-6, and 2021\/09849-5"],"award-info":[{"award-number":["2013\/08293-7, 2019\/12783-6, and 2021\/09849-5"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/08293-7, 2019\/12783-6, and 2021\/09849-5"],"award-info":[{"award-number":["2013\/08293-7, 2019\/12783-6, and 2021\/09849-5"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018699","name":"HORIZON EUROPE Digital, Industry and Space","doi-asserted-by":"publisher","award":["101096435"],"award-info":[{"award-number":["101096435"]}],"id":[{"id":"10.13039\/100018699","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["314645\/2020-9 and 404087\/2021-3"],"award-info":[{"award-number":["314645\/2020-9 and 404087\/2021-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011958","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["1026-00350B"],"award-info":[{"award-number":["1026-00350B"]}],"id":[{"id":"10.13039\/501100011958","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s13389-024-00359-z","type":"journal-article","created":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T12:03:53Z","timestamp":1721822633000},"page":"577-593","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["MOSFHET: Optimized Software for FHE over the Torus"],"prefix":"10.1007","volume":"14","author":[{"given":"Antonio","family":"Guimar\u00e3es","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edson","family":"Borin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Diego F.","family":"Aranha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,24]]},"reference":[{"key":"359_CR1","volume-title":"On data banks and privacy homomorphisms","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Academia Press, Foundations of Secure Computation (1978)"},{"key":"359_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD Thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"359_CR3","doi-asserted-by":"publisher","unstructured":"Regev, O.: On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. J. ACM 56(6) (2009) https:\/\/doi.org\/10.1145\/1568318.1568324 . Place: New York, NY, USA Publisher: Association for Computing Machinery","DOI":"10.1145\/1568318.1568324"},{"key":"359_CR4","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed Ciphertexts in LWE-Based Homomorphic Encryption. In: Kurosawa, K., Hanaoka, G. (eds.) Public-Key Cryptography - PKC 2013, pp. 1\u201313. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_1","DOI":"10.1007\/978-3-642-36362-7_1"},{"key":"359_CR5","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient Fully Homomorphic Encryption from (Standard) LWE. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 97\u2013106 (2011).https:\/\/doi.org\/10.1109\/FOCS.2011.12 . ISSN: 0272-5428","DOI":"10.1109\/FOCS.2011.12"},{"key":"359_CR6","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 - ASIACRYPT 2017, 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":"359_CR7","doi-asserted-by":"publisher","unstructured":"Boura, C., Gama, N., Georgieva, M., Jetchev, D.: Simulating Homomorphic Evaluation of Deep Learning Predictions. In: Dolev, S., Hendler, D., Lodha, S., Yung, M. (eds.) Cyber Security Cryptography and Machine Learning, pp. 212\u2013230. Springer, Cham (2019).https:\/\/doi.org\/10.1007\/978-3-030-20951-3_20","DOI":"10.1007\/978-3-030-20951-3_20"},{"key":"359_CR8","unstructured":"Lou, Q., Jiang, L.: SHE: A Fast and Accurate Deep Neural Network for Encrypted Data. In: Wallach, H., Larochelle, H., Beygelzimer, A., Alch\u00e9-Buc, F.d., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32, pp. 10035\u201310043. Curran Associates, Inc., (2019). http:\/\/papers.nips.cc\/paper\/9194-she-a-fast-and-accurate-deep-neural-network-for-encrypted-data.pdf"},{"issue":"1","key":"359_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020). https:\/\/doi.org\/10.1007\/s00145-019-09319-x. (Accessed2022-11-14)","journal-title":"J. Cryptol."},{"key":"359_CR10","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 - AFRICACRYPT 2018, 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":"359_CR11","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 Cryptography and Machine Learning. Lecture Notes in Computer Science, 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":"359_CR12","unstructured":"Guimar\u00e3es, A.: MOSFHET: Optimized Software for FHE over the Torus. original-date: 2022-04-26T12:41:21Z (2023). https:\/\/github.com\/antoniocgj\/MOSFHET Accessed 2023-05-16"},{"key":"359_CR13","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Ligier, D., Orfila, J.-B., Tap, S.: Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2021. Lecture Notes in Computer Science, 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":"359_CR14","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology - ASIACRYPT 2017, pp. 377\u2013408. Springer, Cham (2017).https:\/\/doi.org\/10.1007\/978-3-319-70694-8_14","DOI":"10.1007\/978-3-319-70694-8_14"},{"key":"359_CR15","doi-asserted-by":"publisher","unstructured":"Carpov, S., Izabach\u00e8ne, M., Mollimard, V.: New Techniques for Multi-value Input Homomorphic Evaluation and Applications. In: Matsui, M. (ed.) Topics in Cryptology - CT-RSA 2019, pp. 106\u2013126. Springer, Cham (2019).https:\/\/doi.org\/10.1007\/978-3-030-12612-4_6","DOI":"10.1007\/978-3-030-12612-4_6"},{"key":"359_CR16","doi-asserted-by":"publisher","unstructured":"Guimar\u00e3es, A., Borin, E., Aranha, D.F.: Revisiting the functional bootstrap in TFHE. IACR Transactions on Cryptographic Hardware and Embedded Systems 2021(2), 229\u2013253 (2021)https:\/\/doi.org\/10.46586\/tches.v2021.i2.229-253","DOI":"10.46586\/tches.v2021.i2.229-253"},{"key":"359_CR17","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts. Report Number: 015 (2020). https:\/\/eprint.iacr.org\/2020\/015 Accessed 2023-06-29"},{"key":"359_CR18","doi-asserted-by":"publisher","unstructured":"Zhou, T., Yang, X., Liu, L., Zhang, W., Li, N.: Faster Bootstrapping With Multiple Addends. IEEE Access 6, 49868\u201349876 (2018) https:\/\/doi.org\/10.1109\/ACCESS.2018.2867655 . Conference Name: IEEE Access","DOI":"10.1109\/ACCESS.2018.2867655"},{"key":"359_CR19","doi-asserted-by":"publisher","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast Homomorphic Evaluation of Deep Discretized Neural Networks. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology - CRYPTO 2018, pp. 483\u2013512. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_17","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"359_CR20","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 - CRYPTO 2013. Lecture Notes in Computer Science, pp. 75\u201392. Springer, Berlin, Heidelberg (2013).https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"359_CR21","unstructured":"Kluczniak, K., Schild, L.: FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption. Report Number: 1135 (2021). https:\/\/eprint.iacr.org\/2021\/1135 Accessed 2023-05-16"},{"key":"359_CR22","unstructured":"Yang, Z., Xie, X., Shen, H., Chen, S., Zhou, J.: TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security. Report Number: 1347 (2021). https:\/\/eprint.iacr.org\/2021\/1347 Accessed 2023-05-16"},{"key":"359_CR23","unstructured":"Lee, Y., Micciancio, D., Kim, A., Choi, R., Deryabin, M., Eom, J., Yoo, D.: Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. Report Number: 198 (2022). https:\/\/eprint.iacr.org\/2022\/198 Accessed 2023-04-10"},{"key":"359_CR24","unstructured":"Bergerat, L., Boudi, A., Bourgerie, Q., Chillotti, I., Ligier, D., Orfila, J.-B., Tap, S.: Parameter Optimization & Larger Precision for (T)FHE. Published: Cryptology ePrint Archive, Paper 2022\/704 (2022). https:\/\/eprint.iacr.org\/2022\/704"},{"key":"359_CR25","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On Ideal Lattices and Learning with Errors over Rings. In: Gilbert, H. (ed.) Advances in Cryptology - EUROCRYPT 2010. Lecture Notes in Computer Science, pp. 1\u201323. Springer, Berlin, Heidelberg (2010).https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"359_CR26","unstructured":"Badawi, A.A., Bates, J., Bergamaschi, F., Cousins, D.B., Erabelli, S., Genise, N., Halevi, S., Hunt, H., Kim, A., Lee, Y., Liu, Z., Micciancio, D., Quah, I., Polyakov, Y., R.V, S., Rohloff, K., Saylor, J., Suponitsky, D., Triplett, M., Vaikuntanathan, V., Zucca, V.: OpenFHE: Open-Source Fully Homomorphic Encryption Library. Report Number: 915 (2022). https:\/\/eprint.iacr.org\/2022\/915 Accessed 2023-05-16"},{"key":"359_CR27","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 - EUROCRYPT 2015, pp. 617\u2013640. Springer, Berlin, Heidelberg (2015).https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"359_CR28","unstructured":"Fan, J., Vercauteren, F.: Somewhat Practical Fully Homomorphic Encryption. Report Number: 144 (2012). https:\/\/eprint.iacr.org\/2012\/144 Accessed 2023-05-21"},{"key":"359_CR29","unstructured":"Clet, P.-E., Zuber, M., Boudguiga, A., Sirdey, R., Gouy-Pailler, C.: Putting up the swiss army knife of homomorphic calculations by means of TFHE functional bootstrapping. Report Number: 149 (2022). https:\/\/eprint.iacr.org\/2022\/149 Accessed 2023-05-21"},{"key":"359_CR30","doi-asserted-by":"publisher","unstructured":"Dworkin, M.J.: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. Technical Report NIST FIPS 202, National Institute of Standards and Technology (July 2015).https:\/\/doi.org\/10.6028\/NIST.FIPS.202 . https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.202.pdf Accessed 2023-05-21","DOI":"10.6028\/NIST.FIPS.202"},{"issue":"4","key":"359_CR31","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3460772","volume":"47","author":"D Blackman","year":"2021","unstructured":"Blackman, D., Vigna, S.: Scrambled Linear Pseudorandom Number Generators. ACM Transactions on Mathematical Software 47(4), 36\u201313632 (2021)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"359_CR32","unstructured":"Bos, J.W., Friedberger, S., Martinoli, M., Oswald, E., Stam, M.: Fly, you fool! Faster Frodo for the ARM Cortex-M4. Report Number: 1116 (2018). https:\/\/eprint.iacr.org\/2018\/1116 Accessed 2023-05-21"},{"key":"359_CR33","doi-asserted-by":"publisher","unstructured":"G\u00e9rard, F., Rossi, M.: An Efficient and Provable Masked Implementation of qTESLA. In: Bela\u00efd, S., G\u00fcneysu, T. (eds.) Smart Card Research and Advanced Applications. Lecture Notes in Computer Science, pp. 74\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-42068-0_5","DOI":"10.1007\/978-3-030-42068-0_5"},{"key":"359_CR34","unstructured":"Saarinen, M.-J.O.: Exploring NIST LWC\/PQC Synergy with R5Sneik: How SNEIK 1.1 Algorithms were Designed to Support Round5. Report Number: 685 (2019). https:\/\/eprint.iacr.org\/2019\/685 Accessed 2023-05-21"},{"key":"359_CR35","doi-asserted-by":"publisher","unstructured":"Drucker, N., Gueron, S., Krasnov, V.: Making AES Great Again: The Forthcoming Vectorized AES Instruction. In: Latifi, S. (ed.) 16th International Conference on Information Technology-New Generations (ITNG 2019). Advances in Intelligent Systems and Computing, pp. 37\u201341. Springer, Cham (2019).https:\/\/doi.org\/10.1007\/978-3-030-14070-0_6","DOI":"10.1007\/978-3-030-14070-0_6"},{"key":"359_CR36","unstructured":"Matsuoka, K.: TFHEpp: pure C++ implementation of TFHE cryptosystem (2020). https:\/\/github.com\/virtualsecureplatform\/TFHEpp"},{"key":"359_CR37","doi-asserted-by":"crossref","unstructured":"Chu, E., George, A.: Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms. CRC Press, (1999). Google-Books-ID: 30S3kRiX4xgC","DOI":"10.1201\/9781420049961"},{"key":"359_CR38","unstructured":"Gama, N., et al.: Spqlios FFT Library (2016). https:\/\/github.com\/tfhe\/tfhe\/tree\/master\/src\/libtfhe\/fft_processors\/spqlios"},{"key":"359_CR39","unstructured":"Klemsa, J.: Fast and Error-Free Negacyclic Integer Convolution using Extended Fourier Transform. Report Number: 480 (2021). https:\/\/eprint.iacr.org\/2021\/480 Accessed 2023-05-22"},{"key":"359_CR40","unstructured":"Zama: TFHE-rs: Pure Rust implementation of the TFHE scheme for boolean and integers FHE arithmetics. Zama (2023). https:\/\/github.com\/zama-ai\/tfhe-rs Accessed 2023-05-16"},{"key":"359_CR41","unstructured":"Zama: Benchmarks - TFHE-rs. https:\/\/docs.zama.ai\/tfhe-rs\/getting-started\/benchmarks Accessed 2023-05-16"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-024-00359-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13389-024-00359-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-024-00359-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T13:06:11Z","timestamp":1726319171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13389-024-00359-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,24]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["359"],"URL":"https:\/\/doi.org\/10.1007\/s13389-024-00359-z","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,24]]},"assertion":[{"value":"10 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2024","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":"Ethical Approval"}},{"value":"The authors declare no Conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}