{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:03:44Z","timestamp":1752192224159,"version":"3.41.2"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819690978","type":"print"},{"value":"9789819690985","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-9098-5_14","type":"book-chapter","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:16:37Z","timestamp":1752138997000},"page":"277-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compact Lifting for\u00a0NTT-Unfriendly Modulus"],"prefix":"10.1007","author":[{"given":"Ying","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruida","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunpeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abdulrahman, A., Chen, J.P., Chen, Y.J., Hwang, V., Kannwischer, M.J., Yang, B.Y.: Multi-moduli NTTs for saber on Cortex-M3 and Cortex-M4. Cryptology ePrint Archive (2021)","DOI":"10.46586\/tches.v2022.i1.127-151"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Alkim, E., Bilgin, Y.A., Cenk, M., G\u00e9rard, F.: Cortex-M4 optimizations for $$\\{$$R, M$$\\}$$ LWE schemes. IACR Trans. Cryptogr. Hardw. Embed. Syst. 336\u2013357 (2020)","DOI":"10.46586\/tches.v2020.i3.336-357"},{"key":"14_CR3","unstructured":"Basso, A., et al.: Where star wars meets star trek: saber and dilithium on the same polynomial multiplier. Cryptology ePrint Archive (2021)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Belorgey, M.G., Carpov, S., Gama, N., Guasch, S., Jetchev, D.: Revisiting key decomposition techniques for FHE: simpler, faster and more generic. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-96-0875-1_6"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU prime: reducing attack surface at low cost. In: Selected Areas in Cryptography\u2013SAC 2017: 24th International Conference, Ottawa, ON, Canada, 16\u201318 August 2017, Revised Selected Papers 24, pp. 235\u2013260. Springer (2018)","DOI":"10.1007\/978-3-319-72565-9_12"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bos, J., et al.: CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Chung, C.M.M., Hwang, V., Kannwischer, M.J., Seiler, G., Shih, C.J., Yang, B.Y.: NTT multiplication for NTT-unfriendly rings: new speed records for saber and NTRU on Cortex-M4 and AVX2. IACR Trans. Cryptogr. Hardw. Embed. Syst. 159\u2013188 (2021)","DOI":"10.46586\/tches.v2021.i2.159-188"},{"issue":"90","key":"14_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ducas, L., et al.: Crystals-dilithium: a lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 238\u2013268 (2018)","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-89339-6_16","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"J-P D\u2019Anvers","year":"2018","unstructured":"D\u2019Anvers, J.-P., Karmakar, A., Sinha Roy, S., Vercauteren, F.: Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 282\u2013305. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_16"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"414","DOI":"10.46586\/tches.v2022.i1.414-460","volume":"2022","author":"T Fritzmann","year":"2021","unstructured":"Fritzmann, T., et al.: Masked accelerators and instruction set extensions for post-quantum cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1), 414\u2013460 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Gentleman, W.M., Sande, G.: Fast fourier transforms: for fun and profit. In: Proceedings of the 7\u201310 November 1966, Fall Joint Computer Conference, pp. 563\u2013578 (1966)","DOI":"10.1145\/1464291.1464352"},{"key":"14_CR13","unstructured":"Karatsuba, A.A., Ofman, Y.P.: Multiplication of many-digital numbers by automatic computers. In: Doklady Akademii Nauk, vol.\u00a0145, pp. 293\u2013294. Russian Academy of Sciences (1962)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Kim, M., Lee, D., Seo, J., Song, Y.: Accelerating HE operations from key decomposition technique. In: Annual International Cryptology Conference, pp. 70\u201392. Springer (2023)","DOI":"10.1007\/978-3-031-38551-3_3"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Kundu, S., D\u2019Anvers, J.P., Van\u00a0Beirendonck, M., Karmakar, A., Verbauwhede, I.: Higher-order masked saber. In: International Conference on Security and Cryptography for Networks, pp. 93\u2013116. Springer (2022)","DOI":"10.1007\/978-3-031-14791-3_5"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"14_CR17","unstructured":"Lu, X., et al.: Lac. submission to the NIST post-quantum cryptography standardization project [NIS] (2019). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-2-submissions"},{"key":"14_CR18","unstructured":"Lu, X., et al.: LAC: practical ring-LWE based public-key encryption with byte-level modulus. Cryptology ePrint Archive (2018)"},{"issue":"6","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM (JACM) 60(6), 1\u201335 (2013)","journal-title":"J. ACM (JACM)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Seiler, G.: NTTRU: truly fast NTRU using NTT. Cryptology ePrint Archive (2019)","DOI":"10.46586\/tches.v2019.i3.180-201"},{"issue":"114","key":"14_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"JM Pollard","year":"1971","unstructured":"Pollard, J.M.: The fast fourier transform in a finite field. Math. Comput. 25(114), 365\u2013374 (1971)","journal-title":"Math. Comput."},{"key":"14_CR22","unstructured":"Prest, T., et al.: Falcon. Post-Quantum Cryptography Project of NIST (2020)"},{"key":"14_CR23","unstructured":"Schwabe, P., Team, K.: CRYSTALS-Kyber: a secure, efficient, and scalable post-quantum KEM (2024). https:\/\/github.com\/pq-crystals\/kyber. Accessed 03 Sept 2024"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","DOI":"10.1137\/S0097539795293172"},{"key":"14_CR25","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers published in soviet math (translations of dokl. adad. nauk. sssr), 4 (1963)"},{"key":"14_CR26","unstructured":"Zhang, Z., et al.: NTRU-technical report, national institute of standards and technology. NIST National Institute of Standards and Technology (2020)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9098-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:16:47Z","timestamp":1752139007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9098-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819690978","9789819690985"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9098-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wollongong, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uow-ic2.github.io\/acisp2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}