{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:10:55Z","timestamp":1747714255418,"version":"3.40.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:00:00Z","timestamp":1743811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:00:00Z","timestamp":1743811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004473","name":"Sakarya University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004473","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Homomorphic encryption is a special type of encryption that allows you to perform homomorphic operations on encrypted data without decryption, ensuring data security. This is the most important system that needs to be developed for customer and\/or patient privacy on behalf of all sectors using a cloud system. In addition, with the increase in the use of IoT systems, one of the biggest problems in these areas is data protection and privacy. Although homomorphic encryption is solution to these problems, using homomorphic encryption schemes is quite costly and slow. Therefore, studies aimed at developing and improving homomorphic schemes are of great importance. But the creation of encryption schemes has remained theoretical due to the cost and computational size of these schemes. For this reason, many studies are being carried out in order to speed up encryption schemes and reduce costs. In this article, we plan to contribute to homomorphic encryption by applying the Chinese remainder theorem (CRT) to the torus fully homomorphic encryption (TFHE) scheme, which has recently achieved a major breakthrough. CRT is used to apply residue number system (RNS) which accelerates schemes to the TFHE scheme. By applying CRT to the scheme, we have achieved an acceleration of about 30% in the encryption and decryption times of the scheme.<\/jats:p>","DOI":"10.1007\/s40314-025-03190-2","type":"journal-article","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T23:36:05Z","timestamp":1743896165000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CRT representation of LWE Based TFHE"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6236-6337","authenticated-orcid":false,"given":"Mehmet","family":"\u00d6zen","sequence":"first","affiliation":[]},{"given":"Serra","family":"Sazo\u011flu","sequence":"additional","affiliation":[]},{"given":"\u00dcnal","family":"\u00c7avu\u015fo\u011flu","sequence":"additional","affiliation":[]},{"given":"Abdullah","family":"Sevin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,5]]},"reference":[{"key":"3190_CR1","doi-asserted-by":"crossref","unstructured":"Bajard J, Eynard J, Hasan MA, Zucca V (2017) A full RNS variant of FV like somewhat homomorphic encryption schemes. In: Selected Areas in Cryptography\u2014SAC 2016: 23rd International Conference, St. John\u2019s, NL, Canada, August 10\u201312, 2016, Revised Selected Papers, pp 423\u2013442","DOI":"10.1007\/978-3-319-69453-5_23"},{"key":"3190_CR2","first-page":"1","volume":"6\u20133","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2014) (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory (TOCT) 6\u20133:1\u201336","journal-title":"ACM Trans Comput Theory (TOCT)"},{"key":"3190_CR3","doi-asserted-by":"crossref","unstructured":"Chauhan KK , Sanger A, Verma A (2015) Homomorphic encryption for data security in cloud computing. In: 2015 International conference on information technology (ICIT), pp 206\u2013209","DOI":"10.1109\/ICIT.2015.39"},{"key":"3190_CR4","doi-asserted-by":"crossref","unstructured":"Cheon JH, Stehl\u00e9 D (2015) Fully homomophic encryption over the integers revisited. In: Advances in Cryptology\u2014EUROCRYPT 2015: 34th annual international conference on the theory and applications of cryptographic techniques, Sofia, Bulgaria, April 26\u201330, 2015, Proceedings, part I, pp 513\u2013536","DOI":"10.1007\/978-3-662-46800-5_20"},{"key":"3190_CR5","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M, Song Y (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Advances in Cryptology\u2014ASIACRYPT 2017: 23rd international conference on the theory and applications of cryptology and information security, Hong Kong, China, The CRT method, December 3\u20137, 2017, Proceedings, part I, vol 23, pp 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"3190_CR6","doi-asserted-by":"crossref","unstructured":"Cheon JH, Han K, Kim A, Kim M, Song Y (2019) A full RNS variant of approximate homomorphic encryption. In: Selected Areas in Cryptography-SAC 2018: 25th International Conference, Calgary, AB, Canada, August 15\u201317, 2018. Revised Selected Papers, vol 25, pp 347\u2013368","DOI":"10.1007\/978-3-030-10970-7_16"},{"key":"3190_CR7","doi-asserted-by":"crossref","unstructured":"Chillotti I, Gama N, Georgieva M, Izabachene M (2016) Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Advances in Cryptology\u2014ASIACRYPT 2016: 22nd international conference on the theory and application of cryptology and information security, Hanoi, Vietnam, December 4\u20138, 2016, Proceedings, part I, vol 22, pp 3\u201333","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"3190_CR8","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33\u20131","author":"I Chillotti","year":"2020","unstructured":"Chillotti I, Gama N, Georgieva M, Izabach\u00e8ne M (2020) TFHE: fast fully homomorphic encryption over the torus. J Cryptol 33\u20131:34\u201391","journal-title":"J Cryptol"},{"key":"3190_CR9","doi-asserted-by":"crossref","unstructured":"Ducas L, Micciancio D (2015) FHEW: bootstrapping homomorphic encryption in less than a second. In: Advances in Cryptology\u2013EUROCRYPT 2015: 34th annual international conference on the theory and applications of cryptographic techniques, Sofia, Bulgaria, April 26\u201330, 2015, Proceedings, part I, vol 34, pp 617\u2013640","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"3190_CR10","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive"},{"key":"3190_CR11","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"3190_CR12","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S, Smart NP (2012) Homomorphic evaluation of the AES circuit. In: Advances in Cryptology\u2014CRYPTO 2012: 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19\u201323, 2012. Proceedings, pp 850\u2013867","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"3190_CR13","doi-asserted-by":"crossref","unstructured":"Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based, In: Advances in Cryptology-CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, part I, pp 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"3190_CR14","doi-asserted-by":"crossref","unstructured":"Halevi S, Polyakov Y, Shoup V (2019) An improved RNS variant of the BFV homomorphic encryption scheme. In: Topics in Cryptology\u2014CT-RSA 2019: the Cryptographers\u2019 Track at the RSA Conference 2019, San Francisco, CA, USA, March 4\u20138, 2019, Proceedings, pp 83\u2013105","DOI":"10.1007\/978-3-030-12612-4_5"},{"key":"3190_CR15","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH (2006) NTRU: a ring-based public key cryptosystem. In: Algorithmic number theory: third international symposium, ANTS-III Portland, Oregon, USA, June 21\u201325, 1998 Proceedings, pp 267\u2013288","DOI":"10.1007\/BFb0054868"},{"key":"3190_CR16","doi-asserted-by":"crossref","unstructured":"Joye M (2021) Guide to fully homomorphic encryption over the [discretized] torus. Cryptology ePrint Archive","DOI":"10.46586\/tches.v2022.i4.661-692"},{"key":"3190_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60\u20136","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky V, Peikert C, Regev O (2013) On ideal lattices and learning with errors over rings. J ACM (JACM) 60\u20136:1\u201335","journal-title":"J ACM (JACM)"},{"key":"3190_CR18","unstructured":"\u00d6zdemir F, Ko\u00e7 \u00c7K (2022) Development of cryptography since Shannon. Cryptology ePrint Archive"},{"key":"3190_CR19","doi-asserted-by":"crossref","unstructured":"Regev O (2010) The learning with errors problem (invited survey). In: 2010 IEEE 25th annual conference on computational complexity, pp 191\u2013204","DOI":"10.1109\/CCC.2010.26"},{"key":"3190_CR20","doi-asserted-by":"crossref","unstructured":"Van Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. In: Advances in Cryptology\u2014EUROCRYPT 2010: 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings, vol 29, pp 24\u201343","DOI":"10.1007\/978-3-642-13190-5_2"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03190-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T20:02:14Z","timestamp":1747684934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03190-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,5]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["3190"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03190-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2025,4,5]]},"assertion":[{"value":"19 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"228"}}