{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:26:10Z","timestamp":1752549970198,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031627422"},{"type":"electronic","value":"9783031627439"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62743-9_6","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T23:02:58Z","timestamp":1718060578000},"page":"170-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Properties of\u00a0Lattice Isomorphism as\u00a0a\u00a0Cryptographic Group Action"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Ben\u010dina","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Budroni","sequence":"additional","affiliation":[]},{"given":"Jes\u00fas-Javier","family":"Chi-Dom\u00ednguez","sequence":"additional","affiliation":[]},{"given":"Mukul","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12492, pp. 411\u2013439. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14","DOI":"10.1007\/978-3-030-64834-3_14"},{"key":"6_CR2","volume-title":"Calculus, Multi-variable Calculus and Linear Algebra","author":"TM Apostol","year":"1969","unstructured":"Apostol, T.M.: Calculus, Multi-variable Calculus and Linear Algebra, vol. II. Blaisdell, Waltham (1969)"},{"key":"6_CR3","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie - Paris VI (2004). https:\/\/theses.hal.science\/tel-00449609"},{"key":"6_CR4","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B.: Complexity of Gr\u00f6bner basis computation for Semi-regular Overdetermined sequences over $$\\mathbb{F}_2$$ with solutions in $$\\mathbb{F}_2$$. Research Report RR-5049, INRIA (2003). https:\/\/inria.hal.science\/inria-00071534"},{"key":"6_CR5","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: Proceedings of the International Conference on Polynomial System Solving Paris, November 2004 in Honor of Daniel Lazard, pp. 71\u201375. ICPSS (2004)"},{"key":"6_CR6","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B., Yang, B.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: 8th International Symposium on Effective Methods in Algebraic Geometry, pp. 1\u201317. MEGA (2005)"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B., Spaenlehauer, P.J.: On the complexity of solving quadratic Boolean systems. J. Complex. 29(1), 53\u201375 (2011). https:\/\/doi.org\/10.1016\/j.jco.2012.07.001","DOI":"10.1016\/j.jco.2012.07.001"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of $$\\mathbb{Z}^{n}$$? algorithms and cryptography with the simplest lattice. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 252\u2013281. Springer, Heidelberg (2023).https:\/\/doi.org\/10.1007\/978-3-031-30589-4_9","DOI":"10.1007\/978-3-031-30589-4_9"},{"key":"6_CR9","unstructured":"Ben\u010dina, B., Budroni, A., Chi-Dom\u00ednguez, J.J., Kulkarni, M.: lip-properties. https:\/\/github.com\/JJChiDguez\/lip-properties.git"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Berthomieu, J., Eder, C., Safey El Din, M.: msolve: a library for solving polynomial systems. In: Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation (ISSAC 2021), pp. 51\u201358. Association for Computing Machinery, Saint Petersburg (2021). https:\/\/doi.org\/10.1145\/3452143.3465545. Version 0.6.3","DOI":"10.1145\/3452143.3465545"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT\u00a02019, Part\u00a0I. LNCS, vol. 11921, pp. 227\u2013247. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Biasse, J.F., Micheli, G., Persichetti, E., Santini, P.: LESS is more: code-based signatures without syndromes. In: Nitaj, A., Youssef, A.M. (eds.) AFRICACRYPT 20. LNCS, vol. 12174, pp. 45\u201365. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"6_CR13","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.) Post-Quantum Cryptography - 12th International Workshop, PQCrypto 2021, pp. 319\u2013338. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_17","DOI":"10.1007\/978-3-030-81293-5_17"},{"key":"6_CR14","unstructured":"Bl\u00e4ser, M., et al.: On digital signatures based on isomorphism problems: orom security, ring signatures, and applications. Cryptology ePrint Archive, Paper 2022\/1184 (2022). https:\/\/eprint.iacr.org\/2022\/1184"},{"key":"6_CR15","unstructured":"Borin, G., Persichetti, E., Santini, P.: Zero-knowledge proofs from the action subgraph. Cryptology ePrint Archive, Paper 2023\/718 (2023). https:\/\/eprint.iacr.org\/2023\/718"},{"key":"6_CR16","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.) 45th ACM STOC, pp. 575\u2013584. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Brassard, G., Yung, M.: One-way group actions. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO\u201990. LNCS, vol.\u00a0537, pp. 94\u2013107. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_7","DOI":"10.1007\/3-540-38424-3_7"},{"key":"6_CR18","unstructured":"Budroni, A., Chi-Dom\u00ednguez, J.J., Kulkarni, M.: Lattice isomorphism as a group action and hard problems on quadratic forms. Cryptology ePrint Archive, Paper 2023\/1093 - version 20230724:055703 (2023). https:\/\/eprint.iacr.org\/archive\/2023\/1093\/1690178223.pdf"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT\u00a02018, Part\u00a0III. LNCS, vol. 11274, pp. 395\u2013427. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"6_CR20","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006). https:\/\/eprint.iacr.org\/2006\/291"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. In: Undergraduate Texts in Mathematics, 4th edn. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16721-3","DOI":"10.1007\/978-3-319-16721-3"},{"key":"6_CR22","unstructured":"D\u2019Alconzo, G., Scala, A.J.D.: Representations of group actions and their applications in cryptography. Cryptology ePrint Archive, Paper 2023\/1247 (2023). https:\/\/eprint.iacr.org\/2023\/1247"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"De Feo, L., et al.: SCALLOP: scaling the CSI-FiSh. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 345\u2013375. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_13","DOI":"10.1007\/978-3-031-31368-4_13"},{"key":"6_CR24","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\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 65\u201394. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_3","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"6_CR25","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 and Dziembowski [26], pp. 643\u2013646. https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"6_CR26","unstructured":"Dunkelman, O., Dziembowski, S. (eds.): EUROCRYPT 2022, Part III, LNCS, vol. 13277. Springer, Heidelberg (2022)"},{"key":"6_CR27","unstructured":"Felderhoff, J.: Hard Homogenous Spaces and Commutative Supersingular Isogeny based Diffie-Hellman (2019). https:\/\/api.semanticscholar.org\/CorpusID:252082464"},{"issue":"2","key":"6_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.7146\/math.scand.a-12092","volume":"56","author":"R Fr\u00f6berg","year":"1985","unstructured":"Fr\u00f6berg, R.: An inequality for hilbert series of graded algebras. Math. Scand. 56(2), 117\u2013144 (1985)","journal-title":"Math. Scand."},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Gentry, C., Szydlo, M.: Cryptanalysis of the revised NTRU signature scheme. In: Knudsen, L.R. (ed.) EUROCRYPT\u00a02002. LNCS, vol.\u00a02332, 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_CR31","doi-asserted-by":"publisher","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Chekuri, C. (ed.) 25th SODA, pp. 391\u2013404. ACM-SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.29","DOI":"10.1137\/1.9781611973402.29"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) TCC\u00a02019, Part\u00a0I. LNCS, vol. 11891, pp. 251\u2013281. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11","DOI":"10.1007\/978-3-030-36030-6_11"},{"key":"6_CR33","unstructured":"Joux, A.: MPC in the head for isomorphisms and group actions. Cryptology ePrint Archive, Paper 2023\/664 (2023). https:\/\/eprint.iacr.org\/2023\/664"},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Lazard, D.: Gr\u00f6bner bases, Gaussian elimination and resolution of systems of algebraic equations. In: van Hulzen, J.A. (ed.) Computer Algebra. LNCS, vol.\u00a0162, pp. 146\u2013156. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-12868-9_99","DOI":"10.1007\/3-540-12868-9_99"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Mach\u00ec, A.: Groups. Springer Milano (2012). https:\/\/doi.org\/10.1007\/978-88-470-2421-2","DOI":"10.1007\/978-88-470-2421-2"},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Goldwasser, S.: Cryptographic functions. In: Micciancio, D., Goldwasser, S. (eds.) Complexity of Lattice Problems. LNCS, vol. 671, pp. 143\u2013194. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-0897-7_8","DOI":"10.1007\/978-1-4615-0897-7_8"},{"issue":"1","key":"6_CR37","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/s0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007). https:\/\/doi.org\/10.1137\/s0097539705447360","journal-title":"SIAM J. Comput."},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th FOCS, pp. 458\u2013467. IEEE Computer Society Press (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646134","DOI":"10.1109\/SFCS.1997.646134"},{"key":"6_CR39","unstructured":"NIST: Post-quantum cryptography: Digital signature schemes. https:\/\/csrc.nist.gov\/projects\/pqc-dig-sig"},{"key":"6_CR40","unstructured":"NIST: Post-quantum cryptography standardization. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"6_CR41","doi-asserted-by":"publisher","unstructured":"Rasslan, M.M.N., Youssef, A.M.: Cryptanalysis of a Public Key Encryption Scheme Using Ergodic Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(2), 853\u2013854 (2011).https:\/\/doi.org\/10.1587\/transfun.E94.A.853","DOI":"10.1587\/transfun.E94.A.853"},{"key":"6_CR42","doi-asserted-by":"publisher","unstructured":"Serre, J.P.: A Course in Arithmetic, Graduate Texts in Mathematics, vol.\u00a07. Springer, New York (1973). https:\/\/doi.org\/10.1007\/978-1-4684-9884-4","DOI":"10.1007\/978-1-4684-9884-4"},{"key":"6_CR43","unstructured":"Spaenlehauer, J.P.: R\u00e9solution de Syst\u00e8mes Multi-homog\u00e8nes et D\u00e9terminantiels. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie (2012)"},{"key":"6_CR44","doi-asserted-by":"publisher","unstructured":"Tang, G., Duong, D.H., Joux, A., Plantard, T., Qiao, Y., Susilo, W.: Practical post-quantum signature schemes from isomorphism problems of trilinear forms. In: Dunkelman and Dziembowski [26], pp. 582\u2013612.https:\/\/doi.org\/10.1007\/978-3-031-07082-2_21","DOI":"10.1007\/978-3-031-07082-2_21"},{"key":"6_CR45","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 10.1) (2023). https:\/\/www.sagemath.org"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62743-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T23:03:52Z","timestamp":1718060632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62743-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031627422","9783031627439"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62743-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.maths.ox.ac.uk\/events\/conferences\/pqcrypto-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}