{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T20:07:53Z","timestamp":1793909273371,"version":"4.8.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T00:00:00Z","timestamp":1695686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272350, U21A20466, 62172307, 62132008"],"award-info":[{"award-number":["62272350, U21A20466, 62172307, 62132008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"New 20 Project of Higher Education of Jinan","award":["202228017"],"award-info":[{"award-number":["202228017"]}]},{"name":"Special Project on Science and Technology Program of Hubei Provience","award":["2020AEA013, 2021BAA025"],"award-info":[{"award-number":["2020AEA013, 2021BAA025"]}]},{"name":"Natural Science Foundation of Jiangsu Province, China","award":["BK20220075"],"award-info":[{"award-number":["BK20220075"]}]},{"name":"Research Initiation Project of Zhejiang Lab","award":["2022PD0AC02"],"award-info":[{"award-number":["2022PD0AC02"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2023,9,30]]},"abstract":"<jats:p>With the development of quantum computing, the existing cryptography schemes based on classical cryptographic primitives will no longer be secure. Hence, cryptographers are designing post-quantum cryptographic (PQC) schemes, and ideal lattice-based cryptography has emerged as a prime candidate. Today, as ideal lattice-based cryptography becomes more mature, its performance becomes an important optimization goal. In ideal lattice-based cryptography, polynomial arithmetic and polynomial sampling are the most time-consuming operations and therefore need to be accelerated. In this article, taking advantage of the parallelism of new 512-bit advanced vector instructions (AVX512), we present parallel implementations of polynomial arithmetic and polynomial sampling, thus comprehensively improving their performance. We conduct experiments with the Dilithium scheme(one scheme of NIST PQC Standardization Process Round-4). Our implementation gets a nice performance boost compared to its pure C language and 256-bit advanced vector instructions (AVX2) implementation.<\/jats:p>","DOI":"10.1145\/3609223","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T12:29:47Z","timestamp":1689337787000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Faster Implementation of Ideal Lattice-Based Cryptography Using AVX512"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3047-0480","authenticated-orcid":false,"given":"Douwei","family":"Lei","sequence":"first","affiliation":[{"name":"School of Cyber Science and Engineering, Wuhan University, China and Institute of Information Technology, Shenzhen Institute of Information Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2446-7436","authenticated-orcid":false,"given":"Debiao","family":"He","sequence":"additional","affiliation":[{"name":"Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center, Qilu University of Technology (Shandong Academy of Sciences), China and School of Cyber Science and Engineering, Wuhan University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9958-3255","authenticated-orcid":false,"given":"Cong","family":"Peng","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Wuhan University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1819-9332","authenticated-orcid":false,"given":"Min","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Wuhan University, China and Shanghai Key Laboratory of Privacy-Preserving Computation, MatrixElements Technologies, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8578-2635","authenticated-orcid":false,"given":"Zhe","family":"Liu","sequence":"additional","affiliation":[{"name":"Zhejiang Lab, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0070-1707","authenticated-orcid":false,"given":"Xinyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Thrust, Information Hub, Hong Kong University of Science and Technology(Guangzhou), China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,9,26]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"99","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"Ajtai Mikl\u00f3s","year":"1996","unstructured":"Mikl\u00f3s Ajtai. 1996. Generating hard instances of lattice problems. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. 99\u2013108."},{"key":"e_1_3_1_3_2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.46586\/tches.v2020.i3.336-357","article-title":"Cortex-M4 optimizations for  \\(\\lbrace\\) R, M \\(\\rbrace\\)  LWE schemes","author":"Alkim Erdem","year":"2020","unstructured":"Erdem Alkim, Yusuf Alper Bilgin, Murat Cenk, and Fran\u00e7ois G\u00e9rard. 2020. Cortex-M4 optimizations for \\(\\lbrace\\) R, M \\(\\rbrace\\) LWE schemes. IACR Transactions on Cryptographic Hardware and Embedded Systems 2020, 3 (2020), 336\u2013357.","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"e_1_3_1_4_2","first-page":"327","volume-title":"Proceedings of the 25Th  \\(\\lbrace\\) USENIX \\(\\rbrace\\)  Security Symposium ( \\(\\lbrace\\) USENIX \\(\\rbrace\\)  security 16)","author":"Alkim Erdem","year":"2016","unstructured":"Erdem Alkim, L\u00e9o Ducas, Thomas P\u00f6ppelmann, and Peter Schwabe. 2016. Post-quantum key exchange\u2013a new hope. In Proceedings of the 25Th \\(\\lbrace\\) USENIX \\(\\rbrace\\) Security Symposium ( \\(\\lbrace\\) USENIX \\(\\rbrace\\) security 16). 327\u2013343."},{"key":"e_1_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Erdem Alkim H\u00fclya Evkan Norman Lahr Ruben Niederhagen and Richard Petri. 2020. ISA extensions for finite field arithmetic-accelerating kyber and newhope on RISC-V. IACR Transactions on Cryptographic Hardware and Embedded Systems 2020 3 (2020) 219\u2013242.","DOI":"10.46586\/tches.v2020.i3.219-242"},{"key":"e_1_3_1_6_2","article-title":"NIST post-quantum cryptography-a hardware evaluation study.","volume":"2019","author":"Basu Kanad","year":"2019","unstructured":"Kanad Basu, Deepraj Soni, Mohammed Nabeel, and Ramesh Karri. 2019. NIST post-quantum cryptography-a hardware evaluation study. IACR Cryptology ePrint Archive 2019, 47 (2019), 1\u201316.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_1_7_2","first-page":"1","article-title":"Multidigit multiplication for mathematicians","author":"Bernstein Daniel J.","year":"2001","unstructured":"Daniel J. Bernstein. 2001. Multidigit multiplication for mathematicians. Advances in Applied Mathematics (2001), 1\u201319. http:\/\/cr.yp.to\/papers\/m3.pdf","journal-title":"Advances in Applied Mathematics"},{"key":"e_1_3_1_8_2","volume-title":"Proceedings of the ECRYPT Hash Workshop","volume":"2007","author":"Bertoni Guido","year":"2007","unstructured":"Guido Bertoni, Joan Daemen, Micha\u00ebl Peeters, and Gilles Van Assche. 2007. Sponge functions. In Proceedings of the ECRYPT Hash Workshop, Vol. 2007. Citeseer."},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_1_10_2","first-page":"25","volume-title":"Proceedings of the Anais do XVIII Simp\u00f3sio Brasileiro de Seguran\u00e7a da Informa\u00e7\u00e3o e de Sistemas Computacionais","author":"Cabral Roberto","year":"2018","unstructured":"Roberto Cabral and Julio L\u00f3pez. 2018. Implementation of the SHA-3 family using AVX512 instructions. In Proceedings of the Anais do XVIII Simp\u00f3sio Brasileiro de Seguran\u00e7a da Informa\u00e7\u00e3o e de Sistemas Computacionais. SBC, 25\u201332."},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.IR.8105"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_3_1_13_2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.46586\/tches.v2018.i1.238-268","article-title":"Crystals-dilithium: A lattice-based digital signature scheme","author":"Ducas L\u00e9o","year":"2018","unstructured":"L\u00e9o Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehl\u00e9. 2018. Crystals-dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems 2018, 1 (2018), 238\u2013268.","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"e_1_3_1_14_2","doi-asserted-by":"crossref","unstructured":"Morris J. Dworkin. 2015. SHA-3 standard: Permutation-based hash and extendable-output functions. (2015) 1\u201337. https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.202.pdf","DOI":"10.6028\/NIST.FIPS.202"},{"key":"e_1_3_1_15_2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.46586\/tches.v2020.i4.239-280","article-title":"RISQ-V: Tightly coupled RISC-V accelerators for post-quantum cryptography","author":"Fritzmann Tim","year":"2020","unstructured":"Tim Fritzmann, Georg Sigl, and Johanna Sep\u00falveda. 2020. RISQ-V: Tightly coupled RISC-V accelerators for post-quantum cryptography. IACR Transactions on Cryptographic Hardware and Embedded Systems 2020, 4 (2020), 239\u2013280.","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"e_1_3_1_16_2","first-page":"563","volume-title":"Proceedings of the November 7-10, 1966, Fall Joint Computer Conference","author":"Gentleman W. Morven","year":"1966","unstructured":"W. Morven Gentleman and Gordon Sande. 1966. Fast fourier transforms: for fun and profit. In Proceedings of the November 7-10, 1966, Fall Joint Computer Conference. 563\u2013578."},{"key":"e_1_3_1_17_2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-319-47560-8_12","volume-title":"Proceedings of the Nordic Conference on Secure IT Systems","author":"Gueron Shay","year":"2016","unstructured":"Shay Gueron and Fabian Schlieker. 2016. Speeding up R-LWE post-quantum key exchange. In Proceedings of the Nordic Conference on Secure IT Systems. Springer, 187\u2013198."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3005344"},{"key":"e_1_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Angshuman Karmakar Jose Maria Bermudo Mera Sujoy Sinha Roy and Ingrid Verbauwhede. 2018. Saber on ARM CCA-secure module lattice-based key encapsulation on ARM. IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 3 (2018) 243\u2013266.","DOI":"10.46586\/tches.v2018.i3.243-266"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_1_21_2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-319-48965-0_8","volume-title":"Proceedings of the International Conference on Cryptology and Network Security","author":"Longa Patrick","year":"2016","unstructured":"Patrick Longa and Michael Naehrig. 2016. Speeding up the number theoretic transform for faster ideal lattice-based cryptography. In Proceedings of the International Conference on Cryptology and Network Security. Springer, 124\u2013139."},{"key":"e_1_3_1_22_2","first-page":"1","volume-title":"Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Lyubashevsky Vadim","year":"2010","unstructured":"Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On ideal lattices and learning with errors over rings. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 1\u201323."},{"key":"e_1_3_1_23_2","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/800205.806332","volume-title":"Proceedings of the 3rd ACM Symposium on Symbolic and Algebraic Computation","author":"Moenck Robert T.","year":"1976","unstructured":"Robert T. Moenck. 1976. Practical fast polynomial multiplication. In Proceedings of the 3rd ACM Symposium on Symbolic and Algebraic Computation. 136\u2013148."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3138807"},{"key":"e_1_3_1_26_2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Proceedings of the Theory of Cryptography Conference","author":"Peikert Chris","year":"2006","unstructured":"Chris Peikert and Alon Rosen. 2006. Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In Proceedings of the Theory of Cryptography Conference. Springer, 145\u2013166."},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1971-0301966-0"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3465481.3465756"},{"key":"e_1_3_1_30_2","first-page":"321","volume-title":"Proceedings of the 2019 IEEE 37th International Conference on Computer Design (ICCD)","author":"Roy Sujoy Sinha","year":"2019","unstructured":"Sujoy Sinha Roy. 2019. SaberX4: High-throughput software implementation of saber key encapsulation mechanism. In Proceedings of the 2019 IEEE 37th International Conference on Computer Design (ICCD). IEEE, 321\u2013324."},{"key":"e_1_3_1_31_2","first-page":"375","volume-title":"Proceedings of the International Conference on Cryptology in Africa","author":"Schneider Michael","year":"2013","unstructured":"Michael Schneider. 2013. Sieving for shortest vectors in ideal lattices. In Proceedings of the International Conference on Cryptology in Africa. Springer, 375\u2013391."},{"key":"e_1_3_1_32_2","article-title":"Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography","author":"Seiler Gregor","year":"2018","unstructured":"Gregor Seiler. 2018. Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography. Cryptology ePrint Archive 2018, 39 (2018), 1\u201314.","journal-title":"Cryptology ePrint Archive"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_1_34_2","first-page":"1","volume-title":"Proceedings of the 2018 IEEE International Symposium on Circuits and Systems (ISCAS)","author":"Wong Ming Ming","year":"2018","unstructured":"Ming Ming Wong, Jawad Haj-Yahya, Suman Sau, and Anupam Chattopadhyay. 2018. A new high throughput and area efficient SHA-3 implementation. In Proceedings of the 2018 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 1\u20135."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447812"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609223","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3609223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:58Z","timestamp":1750182538000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3609223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,26]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9,30]]}},"alternative-id":["10.1145\/3609223"],"URL":"https:\/\/doi.org\/10.1145\/3609223","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,26]]},"assertion":[{"value":"2022-04-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}