{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:41Z","timestamp":1778128001937,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":54,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987290","type":"print"},{"value":"9789819987306","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-8730-6_6","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T07:02:04Z","timestamp":1702796524000},"page":"167-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Exploiting the\u00a0Symmetry of\u00a0$$\\mathbb {Z}^n$$: Randomization and\u00a0the\u00a0Automorphism Problem"],"prefix":"10.1007","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":[[2023,12,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Bennett, H., Golovnev, A., Stephens-Davidowitz, N.: Fine-grained hardness of CVP(P) - everything that we can prove (and nothing else). In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10\u201313 January 2021, pp. 1816\u20131835. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.109","DOI":"10.1137\/1.9781611976465.109"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in 2$${}^{\\text{n}}$$ time using discrete gaussian sampling: extended abstract. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC 2015), Portland, 14\u201317 June 2015, pp. 733\u2013742. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746606","DOI":"10.1145\/2746539.2746606"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Li, J., Nguyen, P.Q., Stephens-Davidowitz, N.: Slide reduction, revisited\u2014filling the gaps in SVP approximation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 274\u2013295. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_10","DOI":"10.1007\/978-3-030-56880-1_10"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Li, Z., Stephens-Davidowitz, N.: 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: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 467\u2013497. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_17","DOI":"10.1007\/978-3-030-77870-5_17"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Stephens-Davidowitz, N.: Just take the average! an embarrassingly simple $$2{^{n}}$$-time algorithm for SVP (and CVP). In: Seidel, R. (ed.) 1st Symposium on Simplicity in Algorithms, SOSA 2018, 7\u201310 January 2018, New Orleans. OASIcs, vol. 61, pp. 12:1\u201312:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2018.12","DOI":"10.4230\/OASIcs.SOSA.2018.12"},{"key":"6_CR6","unstructured":"Aggarwal, D., Ursu, B., Vaudenay, S.: Faster sieving algorithm for approximate SVP with constant approximation factors. Cryptology ePrint Archive (2019)"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2016) Cambridge, 18\u201321 June 2016, pp. 684\u2013697. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897542","DOI":"10.1145\/2897518.2897542"},{"key":"6_CR8","unstructured":"Bennett, H.: The complexity of the shortest vector problem. Electron. Colloquium Comput. Complex. TR22-170 (2022). https:\/\/eccc.weizmann.ac.il\/report\/2022\/170"},{"key":"6_CR9","unstructured":"Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of $${Z}^{{n}}$$? algorithms and cryptography with the simplest lattice. IACR Cryptol. ePrint Arch., p. 1548 (2021). https:\/\/eprint.iacr.org\/2021\/1548"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Bennett, H., Golovnev, A., Stephens-Davidowitz, N.: On the quantitative hardness of CVP. In: Umans, C. (ed.) 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2017), Berkeley, 15\u201317 October 2017, pp. 13\u201324. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.11","DOI":"10.1109\/FOCS.2017.11"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Blanks, T.L., Miller, S.D.: Generating cryptographically-strong random lattice bases and recognizing rotations of $$\\mathbb{Z}^n$$. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 319\u2013338. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_17","DOI":"10.1007\/978-3-030-81293-5_17"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Symposium on Theory of Computing Conference (STOC 2013), Palo Alto, 1\u20134 June 2013, pp. 575\u2013584. ACM (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Cai, J., Nerurkar, A.: An improved worst-case to average-case connection for lattice problems. In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), Miami Beach, 19\u201322 October 1997, pp. 468\u2013477. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646135","DOI":"10.1109\/SFCS.1997.646135"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27","DOI":"10.1007\/978-3-642-13190-5_27"},{"issue":"3","key":"6_CR15","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."},{"issue":"1","key":"6_CR16","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":"6_CR17","doi-asserted-by":"crossref","unstructured":"Ducas, L., Gibbons, S.: Hull attacks on the lattice isomorphism problem. IACR Cryptol. ePrint Arch., p. 194 (2023). https:\/\/eprint.iacr.org\/2023\/194","DOI":"10.1007\/978-3-031-31368-4_7"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Ducas, L., Postlethwaite, E.W., Pulles, L.N., van Woerden, W.P.J.: Hawk: module LIP makes lattice signatures fast, compact and simple. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13794, pp. 65\u201394. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Ducas, L., van Woerden, W.P.J.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"6_CR20","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":"6_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.2140\/obs.2020.4.179","volume":"4","author":"M Dutour Sikiri\u0107","year":"2020","unstructured":"Dutour Sikiri\u0107, M., Haensch, A., Voight, J., van Woerden, W.P.: A canonical form for positive definite matrices. Open Book Ser. 4(1), 179\u2013195 (2020)","journal-title":"Open Book Ser."},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A.Y., Song, F.: A quantum algorithm for computing the unit group of an arbitrary degree number field. In: Shmoys, D.B. (ed.) Symposium on Theory of Computing, STOC 2014, New York, 31 May\u201303 June 2014, pp. 293\u2013302. ACM (2014). https:\/\/doi.org\/10.1145\/2591796.2591860","DOI":"10.1145\/2591796.2591860"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Gei\u00dfler, K., Smart, N.P.: Computing the M = U U$${}^{\\text{ t }}$$ integer matrix decomposition. In: Paterson, K.G. (ed.) Cryptography and Coding. LNCS, vol. 2898, pp. 223\u2013233. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40974-8_18","DOI":"10.1007\/978-3-540-40974-8_18"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 17\u201320 May 2008, pp. 197\u2013206. ACM (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Gentry, C., Szydlo, M.: Cryptanalysis of the revised NTRU signature scheme. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 299\u2013320. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_20","DOI":"10.1007\/3-540-46035-7_20"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Jr., B.S.K. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112\u2013131. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052231","DOI":"10.1007\/BFb0052231"},{"key":"6_CR27","unstructured":"Haviv, I., Regev, O.: Hardness of the covering radius problem on lattices. Chic. J. Theor. Comput. Sci. (2012). https:\/\/cjtcs.cs.uchicago.edu\/articles\/2012\/4\/contents.html"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, 5\u20137 January 2014, pp. 391\u2013404. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.29","DOI":"10.1137\/1.9781611973402.29"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. In: The Collected Works of Wassily Hoeffding, pp. 409\u2013426 (1994)","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSign: digital signatures using the NTRU lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122\u2013140. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_9","DOI":"10.1007\/3-540-36563-X_9"},{"key":"6_CR31","unstructured":"Hunkenschr\u00f6der, C.: Deciding whether a lattice has an orthonormal basis is in co-np. arXiv preprint arXiv:1910.03838 (2019)"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Lenstra, H.W., Jr., Silverberg, A.: Revisiting the gentry-szydlo algorithm. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 280\u2013296. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_16","DOI":"10.1007\/978-3-662-44371-2_16"},{"issue":"3","key":"6_CR33","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/s00145-016-9235-7","volume":"30","author":"HW Lenstra Jr","year":"2017","unstructured":"Lenstra, H.W., Jr., Silverberg, A.: Lattices with symmetry. J. Cryptol. 30(3), 760\u2013804 (2017). https:\/\/doi.org\/10.1007\/s00145-016-9235-7","journal-title":"J. Cryptol."},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. In: Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), October 17\u201319 2004, Rome, pp. 126\u2013135. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.31","DOI":"10.1109\/FOCS.2004.31"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The graph isomorphism problem: its structural complexity. Prog. Theor. Comput. Sci., Birkh\u00e4user\/Springer (1993). https:\/\/doi.org\/10.1007\/978-1-4612-0333-9","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"6_CR36","unstructured":"Kuperberg, G.: The hidden subgroup problem for infinite groups (2020). https:\/\/simons.berkeley.edu\/sites\/default\/files\/docs\/21261\/berkeley.pdf"},{"key":"6_CR37","unstructured":"Kuperberg, G.: The hidden subgroup problem for $$\\mathbb{Z} ^k$$ for infinite-index subgroups (2022). https:\/\/simons.berkeley.edu\/sites\/default\/files\/docs\/21261\/berkeley.pdf"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Annalen 261, 515\u2013534 (1982)","journal-title":"Math. Annalen"},{"key":"6_CR39","unstructured":"Liu, M., Wang, X., Xu, G., Zheng, X.: Shortest lattice vectors in the presence of gaps. Cryptology ePrint Archive (2011)"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Permutation groups and polynomial-time computation. In: Finkelstein, L., Kantor, W.M. (eds.) Groups and Computation, Proceedings of a DIMACS Workshop, New Brunswick, 7\u201310 October 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 11, pp. 139\u2013175. DIMACS\/AMS (1991). https:\/\/doi.org\/10.1090\/dimacs\/011\/11","DOI":"10.1090\/dimacs\/011\/11"},{"key":"6_CR41","doi-asserted-by":"publisher","unstructured":"Martinet, J.: Perfect Lattices in Euclidean Spaces, vol. 327. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-05167-2","DOI":"10.1007\/978-3-662-05167-2"},{"key":"6_CR42","unstructured":"Mezzadri, F.: How to generate random matrices from the classical compact groups. arXiv preprint arXiv:math-ph\/0609050 (2006)"},{"key":"6_CR43","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Regev, O.: Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 271\u2013288. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_17","DOI":"10.1007\/11761679_17"},{"key":"6_CR44","unstructured":"Elkies, N.D.: Intro to SPLAG (2002). https:\/\/people.math.harvard.edu\/~elkies\/M55a.02\/lattice.html"},{"issue":"4","key":"6_CR45","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":"6_CR46","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/jsco.1996.0130","volume":"24","author":"W Plesken","year":"1997","unstructured":"Plesken, W., Souvignier, B.: Computing isometries of lattices. J. Symb. Comput. 24(3\u20134), 327\u2013334 (1997)","journal-title":"J. Symb. Comput."},{"key":"6_CR47","doi-asserted-by":"publisher","unstructured":"Regev, O.: Quantum computation and lattice problems. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16\u201319 November 2002, Vancouver, pp. 520\u2013529. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181976","DOI":"10.1109\/SFCS.2002.1181976"},{"key":"6_CR48","doi-asserted-by":"crossref","unstructured":"Regev, O., Stephens-Davidowitz, N.: A reverse minkowski theorem. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2017), Montreal, 19\u201323 June 2017, pp. 941\u2013953. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055434","DOI":"10.1145\/3055399.3055434"},{"key":"6_CR49","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 20\u201322 November 1994, pp. 124\u2013134. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"6_CR50","doi-asserted-by":"publisher","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","DOI":"10.1090\/S0025-5718-09-02224-8"},{"key":"6_CR51","doi-asserted-by":"publisher","unstructured":"Stephens-Davidowitz, N.: Search-to-decision reductions for lattice problems with approximation factors (slightly) greater than one. In: Jansen, K., Mathieu, C., Rolim, J.D.P., Umans, C. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2016, 7\u20139 September 2016, Paris. LIPIcs, vol. 60, pp. 19:1\u201319:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2016.19","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.19"},{"issue":"3","key":"6_CR52","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0717034","volume":"17","author":"GW Stewart","year":"1980","unstructured":"Stewart, G.W.: 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":"6_CR53","doi-asserted-by":"publisher","unstructured":"Szydlo, M.: Hypercubic lattice reduction and analysis of GGH and NTRU signatures. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 433\u2013448. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_27","DOI":"10.1007\/3-540-39200-9_27"},{"key":"6_CR54","doi-asserted-by":"publisher","unstructured":"Wei, W., Liu, M., Wang, X.: Finding shortest lattice vectors in the presence of gaps. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 239\u2013257. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_13","DOI":"10.1007\/978-3-319-16715-2_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8730-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:51Z","timestamp":1765933371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8730-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987290","9789819987306"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8730-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}