{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T01:43:00Z","timestamp":1758591780990,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372445, 62032009, 12226006"],"award-info":[{"award-number":["62372445, 62032009, 12226006"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Project","award":["2018YFA0704705"],"award-info":[{"award-number":["2018YFA0704705"]}]},{"name":"Innovation Program for Quantum Science and Technology","award":["2021ZD0302902"],"award-info":[{"award-number":["2021ZD0302902"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669688","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"170-179","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Embedding Integer Lattices as Ideals into Polynomial Rings"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5937-5775","authenticated-orcid":false,"given":"Yihang","family":"Cheng","sequence":"first","affiliation":[{"name":"Academy of Mathematicas and Systems Science, Chinese Academy of Sciences, China and University of Chinese Academy of Sciences, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7085-377X","authenticated-orcid":false,"given":"Yansong","family":"Feng","sequence":"additional","affiliation":[{"name":"Academy of Mathematicas and Systems Science, Chinese Academy of Sciences, China and University of Chinese Academy of Sciences, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5591-0234","authenticated-orcid":false,"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[{"name":"Academy of Mathematicas and Systems Science, Chinese Academy of Sciences, China and University of Chinese Academy of Sciences, China"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276705"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M. Ajtai and C. Dwork. 1997. A Public-Key Cryptosystem with Worst-Case\/Average-Case Equivalence. Electronic Colloquium on Computational Complexity-Report Series 1996 (1997). http:\/\/www.eccc.uni-trier.de\/eccc\/","DOI":"10.1145\/258533.258604"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793042117501251"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22969-5_23"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_12"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2022.09.002"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_17"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_20"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_12"},{"key":"e_1_3_2_1_12_1","unstructured":"J. Ding and R. Lindner. 2007. Identifying Ideal Lattices. https:\/\/eprint.iacr.org\/2007\/322.pdf."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.1.50"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0054868"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71667-1_18"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"volume-title":"Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation. ACM, 283\u2013290","author":"Liu R.","key":"e_1_3_2_1_17_1","unstructured":"R. Liu and Y. Pan. 2019. Computing Hermite Normal Form Faster via Solving System of Linear Equations. In Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation. ACM, 283\u2013290."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"V. Lyubashevsky C. Peikert and O. Regev. 2010. On Ideal Lattices and Learning with Errors over Rings. In Advances in Cryptology \u2013 Eurocrypt 2010(Lecture Notes in Computer Science Vol.\u00a06110). 1\u201323. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1 CiteSeerX 10.1.1.352.8218.","DOI":"10.1007\/978-3-642-13190-5_1"},{"volume-title":"Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation. ACM, 231\u2013236","author":"Micciancio D.","key":"e_1_3_2_1_19_1","unstructured":"D. Micciancio and B. Warinschi. 2001. A Linear Space Algorithm for Computing the Hermite Normal Form. In Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation. ACM, 231\u2013236."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77870-5_20"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055489"},{"volume-title":"Approx-SVP in Ideal Lattices with Preprocessing. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 685\u2013716","author":"Pellet-Mary A.","key":"e_1_3_2_1_22_1","unstructured":"A. Pellet-Mary, G. Hanrot, and D. Stehl\u00e9. 2019. Approx-SVP in Ideal Lattices with Preprocessing. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 685\u2013716."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617996"},{"volume-title":"A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science","year":"1987","key":"e_1_3_2_1_25_1","unstructured":"Schnorr. 1987. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science (1987)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Y. Zhang R. Liu and D. Lin. 2017. Improved Key Generation Algorithm for Gentry\u2019s Fully Homomorphic Encryption Scheme. In Computer Science Cryptography and Security. arXiv:1709.06724.","DOI":"10.1007\/978-3-319-78556-1_6"}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Raleigh NC USA","acronym":"ISSAC '24"},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669688","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:52:57Z","timestamp":1758588777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":26,"alternative-id":["10.1145\/3666000.3669688","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669688","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}