{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T01:46:34Z","timestamp":1777081594385,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:00:00Z","timestamp":1726272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:00:00Z","timestamp":1726272000000},"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":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-024-00537-x","type":"journal-article","created":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:01:56Z","timestamp":1726272116000},"page":"857-865","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Modular arithmetic optimization in Kyber KEM"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6599-2026","authenticated-orcid":false,"given":"A. S.","family":"Zelenetsky","sequence":"first","affiliation":[]},{"given":"P. G.","family":"Klyucharev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,14]]},"reference":[{"key":"537_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 26, 96\u201399 (1978)","journal-title":"Commun. ACM"},{"issue":"6","key":"537_CR2","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"537_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T Elgamal","year":"1985","unstructured":"Elgamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"537_CR4","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"537_CR5","doi-asserted-by":"crossref","unstructured":"Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (Ed.) Advances in Cryptology\u2014CRYPTO\u2019 86, pp. 311\u2013323. Springer (1987)","DOI":"10.1007\/3-540-47721-7_24"},{"key":"537_CR6","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"537_CR7","doi-asserted-by":"publisher","unstructured":"Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Schwabe, P., Seiler, G., Stehle, D.: Crystals\u2013kyber: A cca-secure module-lattice-based kem. In: 2018 IEEE European Symposium on Security and Privacy (EuroS & P), pp. 353\u2013367 (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"537_CR8","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehle, D.: CRYSTALS\u2014Dilithium: Digital Signatures from Module Lattices. Cryptology ePrint Archive, Paper 2017\/633. (2017). https:\/\/eprint.iacr.org\/2017\/633"},{"key":"537_CR9","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. (2019). https:\/\/api.semanticscholar.org\/CorpusID:231637439"},{"key":"537_CR10","unstructured":"Bernstein, D.J., Hopwood, D., H\u00fclsing, A., Lange, T., Niederhagen, R., Papachristodoulou, L., Schneider, M., Schwabe, P., Wilcox-O\u2019Hearn, Z.: SPHINCS: practical stateless hash-based signatures. Cryptology ePrint Archive, Paper 2014\/795. (2014). https:\/\/eprint.iacr.org\/2014\/795"},{"key":"537_CR11","doi-asserted-by":"crossref","unstructured":"Zhou, S., Xue, H., Zhang, D., Wang, K., Lu, X., Li, B., He, J.: Preprocess-then-NTT technique and its applications to Kyber and Newhope. In: Guo, F., Huang, X., Yung, M. (eds.) Information Security and Cryptology, pp. 117\u2013137. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-14234-6_7"},{"issue":"2","key":"537_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.46586\/tches.v2021.i2.159-188","volume":"2021","author":"C-MM Chung","year":"2021","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. Cryptograph. Hardw. Embedded Syst. 2021(2), 159\u2013188 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i2.159-188","journal-title":"IACR Trans. Cryptograph. Hardw. Embedded Syst."},{"key":"537_CR13","doi-asserted-by":"crossref","unstructured":"Longa, P., Naehrig, M.: Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography. Cryptology ePrint Archive, Paper 2016\/504. (2016). https:\/\/eprint.iacr.org\/2016\/504","DOI":"10.1007\/978-3-319-48965-0_8"},{"key":"537_CR14","doi-asserted-by":"crossref","unstructured":"Bisheh-Niasar, M., Azarderakhsh, R., Mozaffari-Kermani, M.: High-Speed NTT-based Polynomial Multiplication Accelerator for CRYSTALS-Kyber Post-Quantum Cryptography. Cryptology ePrint Archive, Paper 2021\/563. (2021). https:\/\/eprint.iacr.org\/2021\/563","DOI":"10.1109\/ARITH51176.2021.00028"},{"issue":"3","key":"537_CR15","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"537_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s00145-011-9114-1","volume":"26","author":"E Fujisaki","year":"2013","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. J. Cryptol. 26(1), 80\u2013101 (2013). https:\/\/doi.org\/10.1007\/s00145-011-9114-1","journal-title":"J. Cryptol."},{"key":"537_CR17","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 99","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) Advances in Cryptology\u2014CRYPTO\u2019 99, pp. 537\u2013554. Springer, Berlin, Heidelberg (1999)"},{"key":"537_CR18","unstructured":"Liang, Z., Zhao, Y.: Number Theoretic Transform and Its Applications in Lattice-based Cryptosystems: A Survey (2022)"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00537-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-024-00537-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00537-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:14:58Z","timestamp":1729005298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-024-00537-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,14]]},"references-count":18,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,11]]}},"alternative-id":["537"],"URL":"https:\/\/doi.org\/10.1007\/s11416-024-00537-x","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,14]]},"assertion":[{"value":"29 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 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":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}