{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:19:42Z","timestamp":1757618382964,"version":"3.44.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"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 Cryptol"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00145-025-09546-5","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T13:37:01Z","timestamp":1749821821000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting the Symmetry of $$\\mathbb {Z}^n$$: Randomization and the Automorphism Problem"],"prefix":"10.1007","volume":"38","author":[{"given":"Kaijie","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengyi","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoxiao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"9546_CR1","doi-asserted-by":"publisher","unstructured":"D. Aggarwal, H. Bennett, A. Golovnev, N. Stephens-Davidowitz, Fine-grained hardness of CVP(P)\u2014everything that we can prove (and nothing else), in: D. Marx (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10\u201313, 2021. pp. 1816\u20131835. SIAM, https:\/\/doi.org\/10.1137\/1.9781611976465.109 (2021)","DOI":"10.1137\/1.9781611976465.109"},{"key":"9546_CR2","doi-asserted-by":"publisher","unstructured":"D. Aggarwal, D. Dadush, O. Regev, N. Stephens-Davidowitz, Solving the shortest vector problem in 2$$ ^{\\text{n}}$$ time using discrete gaussian sampling: extended abstract, in R.A. Servedio, R. Rubinfeld (eds) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. pp. 733\u2013742. ACM, https:\/\/doi.org\/10.1145\/2746539.2746606 (2015)","DOI":"10.1145\/2746539.2746606"},{"key":"9546_CR3","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, J. Li, P.Q. Nguyen, N. Stephens-Davidowitz, Slide reduction, revisited\u2014filling the gaps in SVP approximation. In: CRYPTO. http:\/\/arxiv.org\/abs\/1908.03724 (2020)","DOI":"10.1007\/978-3-030-56880-1_10"},{"key":"9546_CR4","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, Z. Li, N. Stephens-Davidowitz, A $$2^{n\/2}$$-time algorithm for $$\\sqrt{n}$$-SVP and $$\\sqrt{n}$$-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP, in Eurocrypt. http:\/\/arxiv.org\/abs\/2007.09556 (2021)","DOI":"10.1007\/978-3-030-77870-5_17"},{"key":"9546_CR5","doi-asserted-by":"publisher","unstructured":"D. Aggarwal, N. Stephens-Davidowitz, Just take the average! an embarrassingly simple $$2{^{n}}$$-time algorithm for SVP (and CVP), in R. Seidel (ed) 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7\u201310, 2018, New Orleans, LA, USA. OASIcs, vol.\u00a061, pp. 12:1\u201312:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2018.12 (2018)","DOI":"10.4230\/OASIcs.SOSA.2018.12"},{"key":"9546_CR6","unstructured":"D. Aggarwal, B. Ursu, S. Vaudenay, Faster sieving algorithm for approximate svp with constant approximation factors. Cryptology ePrint Archive (2019)"},{"key":"9546_CR7","doi-asserted-by":"publisher","unstructured":"L. Babai, Graph isomorphism in quasipolynomial time [extended abstract], in: D. Wichs, Y. Mansour (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pp. 684\u2013697. ACM (2016), https:\/\/doi.org\/10.1145\/2897518.2897542","DOI":"10.1145\/2897518.2897542"},{"key":"9546_CR8","unstructured":"Bennett, H.: The complexity of the shortest vector problem. Electron. Colloquium Comput. Complex. TR22-170. https:\/\/eccc.weizmann.ac.il\/report\/2022\/170 (2022)"},{"key":"9546_CR9","unstructured":"H. Bennett, A. Ganju, P. Peetathawatchai, N. Stephens-Davidowitz, Just how hard are rotations of $${Z}^{{n}}$$? algorithms and cryptography with the simplest lattice. IACR Cryptol. ePrint Arch. p.\u00a01548. https:\/\/eprint.iacr.org\/2021\/1548 (2021)"},{"key":"9546_CR10","doi-asserted-by":"publisher","unstructured":"H. Bennett, A. Golovnev, N. Stephens-Davidowitz, On the quantitative hardness of CVP, in: C. Umans (ed.) 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pp. 13\u201324. IEEE Computer Society. https:\/\/doi.org\/10.1109\/FOCS.2017.11 (2017).","DOI":"10.1109\/FOCS.2017.11"},{"key":"9546_CR11","doi-asserted-by":"crossref","unstructured":"H. Bennett, K.M.H. Win, Relating code equivalence to other isomorphism problems. Cryptology ePrint Archive (2024)","DOI":"10.1007\/s10623-024-01542-3"},{"key":"9546_CR12","doi-asserted-by":"crossref","unstructured":"T.L. Blanks, S.D. Miller, Generating cryptographically-strong random lattice bases and recognizing rotations of $${Z}^n$$, in Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20\u201322, 2021, Proceedings 12. pp. 319\u2013338. Springer (2021)","DOI":"10.1007\/978-3-030-81293-5_17"},{"key":"9546_CR13","doi-asserted-by":"publisher","unstructured":"Z. Brakerski, A. Langlois, C. Peikert, O. Regev, D. Stehl\u00e9, Classical hardness of learning with errors, in: D. Boneh, T. Roughgarden, J. Feigenbaum (eds.) Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1\u20134, 2013. pp. 575\u2013584. ACM. https:\/\/doi.org\/10.1145\/2488608.2488680 (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"9546_CR14","doi-asserted-by":"publisher","unstructured":"J. Cai, A. Nerurkar, An improved worst-case to average-case connection for lattice problems, in 38th Annual Symposium on Foundations of Computer Science, FOCS \u201997, Miami Beach, Florida, USA, October 19-22, 1997. pp. 468\u2013477. IEEE Computer Society. https:\/\/doi.org\/10.1109\/SFCS.1997.646135 (1997)","DOI":"10.1109\/SFCS.1997.646135"},{"key":"9546_CR15","doi-asserted-by":"publisher","unstructured":"D. Cash, D. Hofheinz, E. Kiltz, C. Peikert, Bonsai trees, or how to delegate a lattice basis, in H. Gilbert, (ed.) Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco \/ French Riviera, May 30 - June 3, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06110, pp. 523\u2013552. Springer. https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27 (2010)","DOI":"10.1007\/978-3-642-13190-5_27"},{"issue":"1","key":"9546_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.2140\/obs.2013.1.213","volume":"1","author":"P Castel","year":"2013","unstructured":"Castel, P.: Solving quadratic equations in dimension 5 or more without factoring. The Open Book Series 1(1), 213\u2013233 (2013)","journal-title":"Open Book Ser."},{"issue":"3","key":"9546_CR17","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s00220-006-1554-3","volume":"264","author":"B Collins","year":"2006","unstructured":"Collins, B., \u015aniady, P.: Integration with respect to the Haar measure on unitary, orthogonal and symplectic group. Commun. Math. Phys.264(3), 773\u2013795 (2006)","journal-title":"Commun. Math. Phys."},{"key":"9546_CR18","doi-asserted-by":"publisher","unstructured":"J.H. Conway, N.J.A. Sloane, Sphere packings, lattices and groups, Grundlehren der mathematischen Wissenschaften, vol.\u00a0290. Springer (1988), https:\/\/doi.org\/10.1007\/978-1-4757-2016-7","DOI":"10.1007\/978-1-4757-2016-7"},{"issue":"1","key":"9546_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1017\/S0269964800000255","volume":"1","author":"P Diaconis","year":"1987","unstructured":"Diaconis, P., Shahshahani, M.: The subgroup algorithm for generating uniform random variables. Probab. Eng. Inf. Sci. 1(1), 15\u201332 (1987)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"9546_CR20","doi-asserted-by":"crossref","unstructured":"L. Ducas, S. Gibbons, Hull attacks on the lattice isomorphism problem. IACR Cryptol. ePrint Arch. p.\u00a0194. https:\/\/eprint.iacr.org\/2023\/194 (2023)","DOI":"10.1007\/978-3-031-31368-4_7"},{"key":"9546_CR21","doi-asserted-by":"publisher","unstructured":"L. Ducas, E.W. Postlethwaite, L.N. Pulles, W.P.J. van Woerden, Hawk: Module LIP makes lattice signatures fast, compact and simple, in: S. Agrawal, D. Lin, (eds.) Advances in Cryptology - ASIACRYPT 2022\u201428th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5\u20139, 2022, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 13794, pp. 65\u201394. Springer. https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3 (2022)","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"9546_CR22","doi-asserted-by":"publisher","unstructured":"L. Ducas, W.P.J. van Woerden, On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. in: O. Dunkelman, S. Dziembowski, (eds.) Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part III. Lecture Notes in Computer Science, vol. 13277, pp. 643\u2013673. Springer (2022), https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"9546_CR23","unstructured":"Ducas, L.: Provable lattice reduction of $${Z}^n$$ with blocksize $$n\/2$$. Cryptology ePrint Archive, Paper 2023\/447 (2023), https:\/\/eprint.iacr.org\/2023\/447"},{"issue":"1","key":"9546_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.2140\/obs.2020.4.179","volume":"4","author":"M Dutour Sikiri\u0107","year":"2020","unstructured":"M. Dutour\u00a0Sikiri\u0107, A. Haensch, J. Voight, W.P. van Woerden, A canonical form for positive definite matrices. Open Book Ser.4(1), 179\u2013195 (2020)","journal-title":"Open Book Ser."},{"key":"9546_CR25","doi-asserted-by":"publisher","unstructured":"K. Eisentr\u00e4ger, S. Hallgren, A.Y. Kitaev, F. Song, A quantum algorithm for computing the unit group of an arbitrary degree number field, in D.B. Shmoys (ed.) Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. pp. 293\u2013302. ACM. https:\/\/doi.org\/10.1145\/2591796.2591860 (2014)","DOI":"10.1145\/2591796.2591860"},{"key":"9546_CR26","doi-asserted-by":"publisher","unstructured":"K. Gei\u00dfler, N.P. Smart, Computing the M = U U$$ ^{\\text{ t }}$$ integer matrix decomposition, in: K.G. Paterson (ed.) Cryptography and Coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003, Proceedings. Lecture Notes in Computer Science, vol.\u00a02898, pp. 223\u2013233. Springer (2003), https:\/\/doi.org\/10.1007\/978-3-540-40974-8_18","DOI":"10.1007\/978-3-540-40974-8_18"},{"key":"9546_CR27","doi-asserted-by":"publisher","unstructured":"C. Gentry, C. Peikert, V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in C. Dwork (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008. pp. 197\u2013206. ACM. https:\/\/doi.org\/10.1145\/1374376.1374407 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"9546_CR28","doi-asserted-by":"publisher","unstructured":"C. Gentry, M. Szydlo, Cryptanalysis of the revised NTRU signature scheme, in L.R. Knudsen (ed) Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002, Proceedings. Lecture Notes in Computer Science, vol.\u00a02332, pp. 299\u2013320. Springer. https:\/\/doi.org\/10.1007\/3-540-46035-7_20 (2002)","DOI":"10.1007\/3-540-46035-7_20"},{"key":"9546_CR29","doi-asserted-by":"publisher","unstructured":"O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptosystems from lattice reduction problems, in B.S.K. Jr, (ed.) Advances in Cryptology\u2014CRYPTO \u201997, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17\u201321, 1997, Proceedings. Lecture Notes in Computer Science, vol.\u00a01294, pp. 112\u2013131. Springer. https:\/\/doi.org\/10.1007\/BFb0052231 (1997)","DOI":"10.1007\/BFb0052231"},{"key":"9546_CR30","unstructured":"I. Haviv, O. Regev, Hardness of the covering radius problem on lattices. Chic. J. Theor. Comput. Sci. 2012. http:\/\/cjtcs.cs.uchicago.edu\/articles\/2012\/4\/contents.html (2012)"},{"key":"9546_CR31","doi-asserted-by":"publisher","unstructured":"I. Haviv, O. Regev, On the lattice isomorphism problem, in C. Chekuri, (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5\u20137, 2014. pp. 391\u2013404. SIAM. https:\/\/doi.org\/10.1137\/1.9781611973402.29 (2014)","DOI":"10.1137\/1.9781611973402.29"},{"key":"9546_CR32","doi-asserted-by":"crossref","unstructured":"W. Hoeffding, Probability inequalities for sums of bounded random variables. The collected works of Wassily Hoeffding pp. 409\u2013426 (1994)","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"9546_CR33","doi-asserted-by":"publisher","unstructured":"J. Hoffstein, N. Howgrave-Graham, J. Pipher, J.H. Silverman, W. Whyte, NTRUSIGN: digital signatures using the NTRU lattice. in M. Joye (ed) Topics in Cryptology - CT-RSA 2003, The Cryptographers\u2019 Track at the RSA Conference 2003, San Francisco, CA, USA, April 13\u201317, 2003, Proceedings. Lecture Notes in Computer Science, vol.\u00a02612, pp. 122\u2013140. Springer. https:\/\/doi.org\/10.1007\/3-540-36563-X_9 (2003)","DOI":"10.1007\/3-540-36563-X_9"},{"key":"9546_CR34","unstructured":"C. Hunkenschr\u00f6der, Deciding whether a lattice has an orthonormal basis is in co-np. CoRR abs\/1910.03838. http:\/\/arxiv.org\/abs\/1910.03838 (2019)"},{"key":"9546_CR35","doi-asserted-by":"publisher","unstructured":"H.W.L. Jr, A. Silverberg, Revisiting the gentry-szydlo algorithm, in J.A. Garay, R. Gennaro (eds.) Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I. Lecture Notes in Computer Science, vol.\u00a08616, pp. 280\u2013296. Springer. https:\/\/doi.org\/10.1007\/978-3-662-44371-2_16 (2014)","DOI":"10.1007\/978-3-662-44371-2_16"},{"key":"9546_CR36","doi-asserted-by":"publisher","unstructured":"Jr, H.W.L., Silverberg, A.: Lattices with symmetry. J. Cryptol. 30(3), 760\u2013804 (2017), https:\/\/doi.org\/10.1007\/s00145-016-9235-7","DOI":"10.1007\/s00145-016-9235-7"},{"key":"9546_CR37","doi-asserted-by":"publisher","unstructured":"S. Khot, Hardness of approximating the shortest vector problem in lattices, in 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 October 2004, Rome, Italy, Proceedings. pp. 126\u2013135. IEEE Computer Society. https:\/\/doi.org\/10.1109\/FOCS.2004.31 (2004)","DOI":"10.1109\/FOCS.2004.31"},{"key":"9546_CR38","doi-asserted-by":"publisher","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning, J. Tor\u00e1n, The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science, Birkh\u00e4user\/Springer (1993), https:\/\/doi.org\/10.1007\/978-1-4612-0333-9","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"9546_CR39","unstructured":"G. Kuperberg, The hidden subgroup problem for infinite groups. https:\/\/simons.berkeley.edu\/sites\/default\/files\/docs\/21261\/berkeley.pdf (202)"},{"key":"9546_CR40","unstructured":"G. Kuperberg, The hidden subgroup problem for $$\\mathbb{Z}^k$$ for infinite-index subgroups. https:\/\/simons.berkeley.edu\/sites\/default\/files\/docs\/21261\/berkeley.pdf (2022)"},{"issue":"ARTICLE","key":"9546_CR41","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, L. Lov\u00e1sz, Factoring polynomials with rational coefficients. Mathematische annalen 261(ARTICLE), 515\u2013534 (1982)","journal-title":"Mathematische annalen"},{"issue":"4","key":"9546_CR42","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/17M115390X","volume":"48","author":"HW Lenstra Jr","year":"2019","unstructured":"H.W. Lenstra\u00a0Jr, A. Silverberg, Testing isomorphism of lattices over cm-orders. SIAM J. Comput. 48(4), 1300\u20131334 (2019)","journal-title":"SIAM J. Comput."},{"key":"9546_CR43","unstructured":"M. Liu, X. Wang, G. Xu, X. Zheng, Shortest lattice vectors in the presence of gaps. Cryptology ePrint Archive (2011)"},{"key":"9546_CR44","doi-asserted-by":"publisher","unstructured":"E.M. Luks, Permutation groups and polynomial-time computation, in L. Finkelstein, W.M. Kantor (eds.) Groups and Computation, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 7\u201310, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a011, pp. 139\u2013175. DIMACS\/AMS. https:\/\/doi.org\/10.1090\/dimacs\/011\/11 (1991)","DOI":"10.1090\/dimacs\/011\/11"},{"key":"9546_CR45","unstructured":"Martinet, J.: Perfect lattices in Euclidean spaces, vol.\u00a0327. Springer Science & Business Media (2013)"},{"key":"9546_CR46","unstructured":"F. Mezzadri, How to generate random matrices from the classical compact groups. arXiv preprint math-ph\/0609050 (2006)"},{"key":"9546_CR47","doi-asserted-by":"crossref","unstructured":"G. Mureau, A. Pellet-Mary, A., G. Pliatsok, A. Wallet, Cryptanalysis of rank-2 module-lip in totally real number fields, in Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 226\u2013255. Springer (2024)","DOI":"10.1007\/978-3-031-58754-2_9"},{"key":"9546_CR48","doi-asserted-by":"publisher","unstructured":"P.Q. Nguyen, O. Regev, Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures, in S. Vaudenay, (ed.) Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, Proceedings. Lecture Notes in Computer Science, vol.\u00a04004, pp. 271\u2013288. Springer. https:\/\/doi.org\/10.1007\/11761679_17 (2006)","DOI":"10.1007\/11761679_17"},{"key":"9546_CR49","unstructured":"D.E. Noam, Intro to SPLAG. https:\/\/people.math.harvard.edu\/~elkies\/M55a.02\/lattice.html (2002)"},{"issue":"4","key":"9546_CR50","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert, C.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016), https:\/\/doi.org\/10.1561\/0400000074","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"3\u20134","key":"9546_CR51","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/jsco.1996.0130","volume":"24","author":"W Plesken","year":"1997","unstructured":"W. Plesken, B. Souvignier, Computing isometries of lattices. J. Symb. Comput. 24(3-4), 327\u2013334 (1997)","journal-title":"J. Symb. Comput."},{"key":"9546_CR52","doi-asserted-by":"publisher","unstructured":"O. Regev, Quantum computation and lattice problems, in 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16\u201319 November 2002, Vancouver, BC, Canada, Proceedings. pp. 520\u2013529. IEEE Computer Society. https:\/\/doi.org\/10.1109\/SFCS.2002.1181976 (2002)","DOI":"10.1109\/SFCS.2002.1181976"},{"key":"9546_CR53","doi-asserted-by":"publisher","unstructured":"O. Regev, N. Stephens-Davidowitz, A reverse minkowski theorem, in H. Hatami, P. McKenzie, V. King (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19\u201323, 2017. pp. 941\u2013953. ACM. https:\/\/doi.org\/10.1145\/3055399.3055434 (2017)","DOI":"10.1145\/3055399.3055434"},{"key":"9546_CR54","unstructured":"J.P. Serre, A course in arithmetic, vol.\u00a07. Springer Science & Business Media (2012)"},{"key":"9546_CR55","doi-asserted-by":"publisher","unstructured":"P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994. pp. 124\u2013134. IEEE Computer Society. https:\/\/doi.org\/10.1109\/SFCS.1994.365700 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"267","key":"9546_CR56","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1090\/S0025-5718-09-02224-8","volume":"78","author":"MD Sikiric","year":"2009","unstructured":"Sikiric, M.D., Sch\u00fcrmann, A., Vallentin, F.: Complexity and algorithms for computing voronoi cells of lattices. Math. Comput. 78(267), 1713\u20131731 (2009), https:\/\/doi.org\/10.1090\/S0025-5718-09-02224-8","journal-title":"Math. Comput."},{"key":"9546_CR57","doi-asserted-by":"publisher","unstructured":"N. Stephens-Davidowitz, Search-to-decision reductions for lattice problems with approximation factors (slightly) greater than one, in K. Jansen, C. Mathieu, J.D.P. Rolim, C. Umans, (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2016, September 7-9, 2016, Paris, France. LIPIcs, vol.\u00a060, pp. 19:1\u201319:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2016.19 (2016).","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.19"},{"issue":"3","key":"9546_CR58","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0717034","volume":"17","author":"GW Stewart","year":"1980","unstructured":"G.W. Stewart, The efficient generation of random orthogonal matrices with an application to condition estimators. SIAM J. Numer. Anal. 17(3), 403\u2013409 (1980)","journal-title":"SIAM J. Numer. Anal."},{"key":"9546_CR59","doi-asserted-by":"publisher","unstructured":"M. Szydlo, Hypercubic lattice reduction and analysis of GGH and NTRU signatures, in E. Biham (ed.) Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4\u20138, 2003, Proceedings. Lecture Notes in Computer Science, vol.\u00a02656, pp. 433\u2013448. Springer. https:\/\/doi.org\/10.1007\/3-540-39200-9_27 (2003)","DOI":"10.1007\/3-540-39200-9_27"},{"key":"9546_CR60","doi-asserted-by":"crossref","unstructured":"W. Wei, M. Liu, X. Wang, Finding shortest lattice vectors in the presence of gaps, in CT-RSA vol.\u00a09048, pp. 239\u2013257. Springer (2015)","DOI":"10.1007\/978-3-319-16715-2_13"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-025-09546-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-025-09546-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-025-09546-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T19:28:26Z","timestamp":1757186906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-025-09546-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["9546"],"URL":"https:\/\/doi.org\/10.1007\/s00145-025-09546-5","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"29 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"27"}}