{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:04:00Z","timestamp":1772823840099,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T00:00:00Z","timestamp":1765584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T00:00:00Z","timestamp":1765584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100017354","name":"Military Crypto Research Center","doi-asserted-by":"publisher","award":["UD210027XD"],"award-info":[{"award-number":["UD210027XD"]}],"id":[{"id":"10.13039\/100017354","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017354","name":"Military Crypto Research Center","doi-asserted-by":"publisher","award":["UD210027XD"],"award-info":[{"award-number":["UD210027XD"]}],"id":[{"id":"10.13039\/100017354","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017354","name":"Military Crypto Research Center","doi-asserted-by":"publisher","award":["UD210027XD"],"award-info":[{"award-number":["UD210027XD"]}],"id":[{"id":"10.13039\/100017354","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017354","name":"Military Crypto Research Center","doi-asserted-by":"publisher","award":["UD210027XD"],"award-info":[{"award-number":["UD210027XD"]}],"id":[{"id":"10.13039\/100017354","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017354","name":"Military Crypto Research Center","doi-asserted-by":"publisher","award":["UD210027XD"],"award-info":[{"award-number":["UD210027XD"]}],"id":[{"id":"10.13039\/100017354","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Institute for Information and Communication Technology Planning and Evaluation","award":["2021-0-00518"],"award-info":[{"award-number":["2021-0-00518"]}]},{"name":"Institute for Information and Communication Technology Planning and Evaluation","award":["2021-0-00518"],"award-info":[{"award-number":["2021-0-00518"]}]},{"name":"Institute for Information and Communication Technology Planning and Evaluation","award":["2021-0-00518"],"award-info":[{"award-number":["2021-0-00518"]}]},{"name":"Institute for Information and Communication Technology Planning and Evaluation","award":["2021-0-00518"],"award-info":[{"award-number":["2021-0-00518"]}]},{"name":"Institute for Information and Communication Technology Planning and Evaluation","award":["2021-0-00518"],"award-info":[{"award-number":["2021-0-00518"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10623-025-01739-0","type":"journal-article","created":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T13:35:01Z","timestamp":1765632901000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["NTRU+Sign: compact NTRU-based signatures using bimodal distributions"],"prefix":"10.1007","volume":"94","author":[{"given":"Joo","family":"Woo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonghyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ga Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seungwoo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minkyu","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hochang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jong Hwan","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,13]]},"reference":[{"issue":"3","key":"1739_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht M.R., Player R., Scott S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015).","journal-title":"J. Math. Cryptol."},{"key":"1739_CR2","unstructured":"Alkim E., Ducas L., P\u00f6ppelmann T., Schwabe P.: Post-quantum key exchange\u2014a new hope. In: Holz T., Savage S. (eds.) 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10\u201312, 2016, pp. 327\u2013343. USENIX Association, Berkeley (2016)."},{"key":"1739_CR3","doi-asserted-by":"publisher","unstructured":"Bai S., Galbraith S.D.: An improved compression technique for signatures based on learning with errors. In: Benaloh J. (ed.) Topics in Cryptology - CT-RSA 2014 - The Cryptographer\u2019s Track at the RSA Conference 2014, San Francisco, CA, USA, February 25\u201328, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8366, pp. 28\u201347. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_2.","DOI":"10.1007\/978-3-319-04852-9_2"},{"key":"1739_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2018","unstructured":"Bai S., Lepoint T., Roux-Langlois A., Sakzad A., Stehl\u00e9 D., Steinfeld R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. J. Cryptol. 31, 610\u2013640 (2018).","journal-title":"J. Cryptol."},{"key":"1739_CR5","doi-asserted-by":"publisher","unstructured":"Bambury H., Beguinet H., Ricosset T., Sageloli \u00c9.: Polytopes in the fiat-shamir with aborts paradigm. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14920, pp. 339\u2013372. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_11.","DOI":"10.1007\/978-3-031-68376-3_11"},{"key":"1739_CR6","doi-asserted-by":"publisher","unstructured":"Barbosa M., Barthe G., Doczkal C., Don J., Fehr S., Gr\u00e9goire B., Huang Y., H\u00fclsing A., Lee Y., Wu X.: Fixing and mechanizing the security proof of Fiat-Shamir with aborts and dilithium. In: Handschuh H., Lysyanskaya A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20\u201324, 2023, Proceedings, Part V. Lecture Notes in Computer Science, vol. 14085, pp. 358\u2013389. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_12.","DOI":"10.1007\/978-3-031-38554-4_12"},{"key":"1739_CR7","doi-asserted-by":"publisher","unstructured":"Barthe G., Bela\u00efd S., Espitau T., Fouque P., Rossi M., Tibouchi M.: GALACTICS: gaussian sampling for lattice-based constant- time implementation of cryptographic signatures, revisited. In: Cavallaro L., Kinder J., Wang X., Katz J. (eds.) Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11\u201315, 2019, pp. 2147\u20132164. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3319535.3363223.","DOI":"10.1145\/3319535.3363223"},{"key":"1739_CR8","doi-asserted-by":"publisher","unstructured":"Bellare M., Neven G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Juels A., Wright R.N., Vimercati S.D.C. (eds.) Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, October 30 - November 3, 2006, pp. 390\u2013399. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1180405.1180453.","DOI":"10.1145\/1180405.1180453"},{"key":"1739_CR9","doi-asserted-by":"publisher","unstructured":"Bootle J., Delaplace C., Espitau T., Fouque P., Tibouchi M.: LWE without modular reduction and improved side-channel attacks against BLISS. In: Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2\u20136, 2018, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11272, pp. 494\u2013524. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_17.","DOI":"10.1007\/978-3-030-03326-2_17"},{"key":"1739_CR10","doi-asserted-by":"publisher","unstructured":"Bruinderink L.G., H\u00fclsing A., Lange T., Yarom Y.: Flush, gauss, and reload - A cache attack on the BLISS lattice-based signature scheme. In: Gierlichs B., Poschmann A.Y. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2016 - 18th International Conference, Santa Barbara, CA, USA, August 17-19, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9813, pp. 323\u2013345. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_16.","DOI":"10.1007\/978-3-662-53140-2_16"},{"key":"1739_CR11","doi-asserted-by":"publisher","unstructured":"Bruinderink L.G., H\u00fclsing A., Lange T., Yarom Y.: Flush, Gauss, and reload\u2014a cache attack on the BLISS lattice-based signature scheme. In: Cryptographic Hardware and Embedded Systems - CHES 2016 - 18th International Conference, Santa Barbara, CA, USA, 17\u201319 August 2016, Proceedings. Lecture Notes in Computer Science, vol. 9813, pp. 323\u2013345. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_16.","DOI":"10.1007\/978-3-662-53140-2_16"},{"key":"1739_CR12","unstructured":"Chen C., Danba O., Hoffstein J., Hulsing A., Rijneveld J., Schanck J.M., Schwabe P., Whyte W., Zhang Z., Saito T., Yamakawa T., Xagawa K.: NTRU. A submission to the NIST post-quantum standardization effort (2020). https:\/\/ntru.org\/."},{"key":"1739_CR13","doi-asserted-by":"publisher","unstructured":"Chen Y., Nguyen P.Q.: BKZ 2.0: Better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4\u20138, 2011. Proceedings. Lecture Notes in Computer Science, vol. 7073, pp. 1\u201320. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1.","DOI":"10.1007\/978-3-642-25385-0_1"},{"issue":"3","key":"1739_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.46586\/TCHES.V2024.I-75","volume":"2024","author":"JH Cheon","year":"2024","unstructured":"Cheon J.H., Choe H., Devevey J., G\u00fcneysu T., Hong D., Krausz M., Land G., M\u00f6ller M., Stehl\u00e9 D., Yi M.: HAETAE:Shorter lattice-based fiat-shamir signatures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(3), 25\u201375 (2024). https:\/\/doi.org\/10.46586\/TCHES.V2024.I-75.","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"1739_CR15","doi-asserted-by":"publisher","unstructured":"Devevey J., Fallahpour P., Passel\u00e8gue A., Stehl\u00e9 D.: A detailed analysis of Fiat-Shamir with aborts. In: CRYPTO 2023. Lecture Notes in Computer Science, vol. 14085, pp. 327\u2013357. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_11.","DOI":"10.1007\/978-3-031-38554-4_11"},{"key":"1739_CR16","doi-asserted-by":"publisher","unstructured":"Devevey J., Fawzi O., Passel\u00e8gue A., Stehl\u00e9 D.: On rejection sampling in Lyubashevsky\u2019s signature scheme. In: ASIACRYPT 2022. Lecture Notes in Computer Science, vol. 13794, pp. 34\u201364. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_2.","DOI":"10.1007\/978-3-031-22972-5_2"},{"key":"1739_CR17","doi-asserted-by":"publisher","unstructured":"Devevey J., Passel\u00e8gue A., Stehl\u00e9 D.: G+G: a Fiat-Shamir lattice signature based on convolved gaussians. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology - ASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4\u20138, 2023, Proceedings, Part VII. Lecture Notes in Computer Science, vol. 14444, pp. 37\u201364. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_2.","DOI":"10.1007\/978-981-99-8739-9_2"},{"key":"1739_CR18","doi-asserted-by":"publisher","unstructured":"Ducas L., Durmus A., Lepoint T., Lyubashevsky V.: Lattice signatures and bimodal gaussians. In: CRYPTO 2013. Lecture Notes in Computer Science, vol. 8042, pp. 40\u201356. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_3.","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"1739_CR19","doi-asserted-by":"crossref","unstructured":"Ducas L., Espitau T., Postlethwaite E.W.: Finding short integer solutions when the modulus is small. In: Annual International Cryptology Conference, pp. 150\u2013176. Springer (2023).","DOI":"10.1007\/978-3-031-38548-3_6"},{"key":"1739_CR20","unstructured":"Ducas L.: Accelerating bliss: the geometry of ternary polynomials. IACR Cryptol. ePrint Arch. Paper 2014\/874 (2014)."},{"issue":"1","key":"1739_CR21","doi-asserted-by":"publisher","first-page":"238","DOI":"10.13154\/TCHES.V2018.I1.238-268","volume":"2018","author":"L Ducas","year":"2018","unstructured":"Ducas L., Kiltz E., Lepoint T., Lyubashevsky V., Schwabe P., Seiler G., Stehl\u00e9 D.: Crystals-dilithium: A lattice-based digital signature scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(1), 238\u2013268 (2018). https:\/\/doi.org\/10.13154\/TCHES.V2018.I1.238-268.","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"1739_CR22","doi-asserted-by":"publisher","unstructured":"Duman J., H\u00f6velmanns K., Kiltz E., Lyubashevsky V., Seiler G., Unruh D.: A thorough treatment of highly-efficient NTRU instantiations. In: Boldyreva A., Kolesnikov V. (eds.) Public-Key Cryptography - PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7\u201310, 2023, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13940, pp. 65\u201394. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_3.","DOI":"10.1007\/978-3-031-31368-4_3"},{"key":"1739_CR23","doi-asserted-by":"publisher","unstructured":"Espitau T., Fouque P.-A., G\u00e9rard B., Tibouchi M.: Side-channel attacks on bliss lattice-based signatures: Exploiting branch tracing against strongswan and electromagnetic emanations in microcontrollers. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201917, pp. 1857\u20131874. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3134028.","DOI":"10.1145\/3133956.3134028"},{"key":"1739_CR24","doi-asserted-by":"publisher","unstructured":"Espitau T., Tibouchi M., Wallet A., Yu Y.: Shorter hash-and-sign lattice-based signatures. In: Dodis Y., Shrimpton T. (eds.) CRYPTO 2022. Lecture Notes in Computer Science, vol. 13508, pp. 245\u2013275. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_9.","DOI":"10.1007\/978-3-031-15979-4_9"},{"key":"1739_CR25","unstructured":"Fouque P.A., Hoffstein J., Kirchner P., Lyubashevsky V., Pornin T., Prest T., Ricosset T., Seiler G., Whyte W., Zhang Z.: Falcon: Fast-Fourier lattice-based compact signatures over NTRU (2017). https:\/\/falcon-sign.info\/falcon.pdf."},{"key":"1739_CR26","unstructured":"G\u00e4rtner J.: Compact lattice signatures via iterative rejection sampling. Cryptology ePrint Archive, Paper 2024\/2052 (2024). https:\/\/eprint.iacr.org\/2024\/2052."},{"key":"1739_CR27","doi-asserted-by":"publisher","unstructured":"G\u00e4rtner J.: Compact lattice signatures via iterative rejection sampling. In: Kalai Y.T., Kamara S.F. (eds.) Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2025, Proceedings, Part I. Lecture Notes in Computer Science, vol. 16000, pp. 514\u2013547. Springer, Berlin (2025). https:\/\/doi.org\/10.1007\/978-3-032-01855-7_17.","DOI":"10.1007\/978-3-032-01855-7_17"},{"key":"1739_CR28","unstructured":"Giesen F.: Interleaved entropy coders. CoRR (2014). arXiv: 1402.3392."},{"key":"1739_CR29","doi-asserted-by":"publisher","unstructured":"G\u00fcneysu T., Lyubashevsky V., P\u00f6ppelmann T.: Practical lattice-based cryptography: A signature scheme for embedded systems. In: Prouff E., Schaumont P. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2012 - 14th International Workshop, Leuven, Belgium, September 9\u201312, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7428, pp. 530\u2013547. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_31.","DOI":"10.1007\/978-3-642-33027-8_31"},{"key":"1739_CR30","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Howgrave-Graham N., Pipher J., Silverman J.H., Whyte W.: Ntrusign: Digital signatures using the NTRU lattice. In: Cryptographers\u2019 Track at the RSA Conference, pp. 122\u2013140 (2003). Springer.","DOI":"10.1007\/3-540-36563-X_9"},{"key":"1739_CR31","doi-asserted-by":"crossref","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU: a ring-based public key cryptosystem. In: Proceedings of the Third International Symposium on Algorithmic Number Theory, pp. 267\u2013288 (1998).","DOI":"10.1007\/BFb0054868"},{"key":"1739_CR32","doi-asserted-by":"crossref","unstructured":"Jeudy C., Roux-Langlois A., Sanders O.: Phoenix: hash-and-sign with aborts from lattice gadgets. In: International Conference on Post-Quantum Cryptography, pp. 265\u2013299. Springer (2024).","DOI":"10.1007\/978-3-031-62743-9_9"},{"key":"1739_CR33","doi-asserted-by":"publisher","unstructured":"Kiltz E., Lyubashevsky V., Schaffner C.: A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model. In: EUROCRYPT 2018. Lecture Notes in Computer Science, vol. 10822, pp. 552\u2013586. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_18.","DOI":"10.1007\/978-3-319-78372-7_18"},{"key":"1739_CR34","doi-asserted-by":"publisher","unstructured":"Lyubashevsky V., Peikert C., Regev O.: A toolkit for ring-LWE cryptography. In: Johansson T., Nguyen P.Q. (eds.) Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26\u201330, 2013. Proceedings. Lecture Notes in Computer Science, vol. 7881, pp. 35\u201354. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_3.","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"1739_CR35","doi-asserted-by":"publisher","unstructured":"Lyubashevsky V.: Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures. In: ASIACRYPT 2009. Lecture Notes in Computer Science, vol. 5912, pp. 598\u2013616. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35.","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"1739_CR36","unstructured":"Lyubashevsky V.: Lattice Signatures Without Trapdoors. Cryptology ePrint Archive, Paper 2011\/537 (2011). https:\/\/eprint.iacr.org\/2011\/537."},{"key":"1739_CR37","doi-asserted-by":"publisher","unstructured":"Lyubashevsky V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. Lecture Notes in Computer Science, vol. 7237, pp. 738\u2013755. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43.","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"1739_CR38","doi-asserted-by":"publisher","unstructured":"Pessl P., Bruinderink L.G., Yarom Y.: To BLISS-B or not to be: Attacking strongswan\u2019s implementation of post-quantum signatures. In: Thuraisingham B., Evans D., Malkin T., Xu D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 1843\u20131855. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3134023.","DOI":"10.1145\/3133956.3134023"},{"key":"1739_CR39","doi-asserted-by":"publisher","unstructured":"Pino R., Katsumata S., Prest T., Rossi M.: Raccoon: a masking-friendly signature proven in the probing model. In: Reyzin L., Stebila D. (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14920, pp. 409\u2013444. Springer, Berlin (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_13.","DOI":"10.1007\/978-3-031-68376-3_13"},{"key":"1739_CR40","unstructured":"Pornin T.: New efficient, constant-time implementations of falcon. Cryptology ePrint Archive, Paper 2019\/893 (2019). https:\/\/eprint.iacr.org\/2019\/893."},{"key":"1739_CR41","unstructured":"Prest T., Ricosset T., Rossi M.: Simple, fast and constant-time Gaussian sampling over the integers for falcon. NIST PQC Workshop (2019)."},{"key":"1739_CR42","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-70694-8_13","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2017","author":"T Prest","year":"2017","unstructured":"Prest T.: Sharper bounds in lattice-based cryptography using the r\u00e9nyi divergence. In: Takagi T., Peyrin T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2017, pp. 347\u2013374. Springer, Cham (2017)."},{"key":"1739_CR43","doi-asserted-by":"crossref","unstructured":"Woo J., Kim J., Hong G.H., Lee S., Kim M., Lee H., Park J.H.: NTRU+Sign: Compact NTRU-based signatures using bimodal distributions. Cryptology ePrint Archive, Paper 2025\/106 (2025). https:\/\/eprint.iacr.org\/2025\/106.","DOI":"10.1007\/s10623-025-01739-0"},{"key":"1739_CR44","doi-asserted-by":"publisher","unstructured":"Zhang J., Feng D., Yan D.: NEV: faster and smaller NTRU encryption using vector decoding. In: Guo J., Steinfeld R. (eds.) Advances in Cryptology - ASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4\u20138, 2023, Proceedings, Part VII. Lecture Notes in Computer Science, vol. 14444, pp. 157\u2013189. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_6.","DOI":"10.1007\/978-981-99-8739-9_6"},{"issue":"1","key":"1739_CR45","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TC.2019.2940949","volume":"69","author":"RK Zhao","year":"2020","unstructured":"Zhao R.K., Steinfeld R., Sakzad A.: Facct: fast, compact, and constant-time discrete Gaussian sampler over integers. IEEE Trans. Comput. 69(1), 126\u2013137 (2020). https:\/\/doi.org\/10.1109\/TC.2019.2940949.","journal-title":"IEEE Trans. Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01739-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01739-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01739-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T17:13:00Z","timestamp":1769447580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01739-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,13]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1739"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01739-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,13]]},"assertion":[{"value":"16 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 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":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"2"}}