{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:26:36Z","timestamp":1776443196928,"version":"3.51.2"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865985","type":"print"},{"value":"9783031865992","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-86599-2_3","type":"book-chapter","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:53:36Z","timestamp":1742842416000},"page":"71-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Algorithm for\u00a0Code Equivalence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3066-0133","authenticated-orcid":false,"given":"Julian","family":"Nowakowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Barenghi, A., Biasse, J.-F., Ngo, T., Persichetti, E., Santini, P.: Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7(2), 112\u2013128 (2022)","DOI":"10.1080\/23799927.2022.2048206"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3934\/amc.2022064","volume":"17","author":"A Barenghi","year":"2023","unstructured":"Barenghi, A., Biasse, J.-F., Persichetti, E., Santini, P.: On the computational hardness of the code equivalence problem in cryptography. Adv. Math. Commun. 17(1), 23\u201355 (2023)","journal-title":"Adv. Math. Commun."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Beullens, W.: Not enough LESS: an improved algorithm for solving code equivalence problems over $$\\mathbb{F} _q$$. In: Dunkelman, O., Jacobson Jr, M.J., O\u2019Flynn, C. (eds.) SAC 2020: 27th Annual International Workshop on Selected Areas in Cryptography, vol. 12804 of Lecture Notes in Computer Science, pp. 387\u2013403. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-81652-0_15"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-030-51938-4_3","volume-title":"AFRICACRYPT 20: 12th International Conference on Cryptology in Africa","author":"J-F Biasse","year":"2020","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: 12th International Conference on Cryptology in Africa. Lecture Notes in Computer Science, vol. 12174, pp. 45\u201365. Springer, Cham (2020)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chou, T., et al.: Take your MEDS: digital signatures from matrix code equivalence. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 23: 14th International Conference on Cryptology in Africa. Lecture Notes in Computer Science, vol. 14064, pp. 28\u201352. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-37679-5_2"},{"key":"3_CR6","unstructured":"Chou, T., Persichetti, E., Santini, P.: On linear equivalence, canonical forms, and digital signatures. IACR Cryptol. ePrint Arch., pp. 1533 (2023)"},{"key":"3_CR7","series-title":"Part III, volume 14083 of Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-031-38548-3_2","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"L Ducas","year":"2023","unstructured":"Ducas, L., Pulles, L.N.: Does the dual-sieve attack on learning with errors even work? In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023. Part III, volume 14083 of Lecture Notes in Computer Science, pp. 37\u201369. Springer, Cham (2023)"},{"key":"3_CR8","doi-asserted-by":"crossref","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.) Advances in Cryptology - ASIACRYPT 2022. Part IV, vol. 13794 of Lecture Notes in Computer Science, pp. 65\u201394. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22972-5_3"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"JS Leon","year":"1982","unstructured":"Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inf. Theory 28(3), 496\u2013510 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Meyer-Hilfiger, C., Tillich, J.-P.: Rigorous foundations for dual attacks in coding theory. In: Rothblum, G.N., Wee, H. (eds.) TCC\u00a02023: 21st Theory of Cryptography Conference, Part\u00a0IV, vol. 14372 of Lecture Notes in Computer Science, pp. 3\u201332. Springer, Cham, November\u00a0\/\u00a0December (2023)","DOI":"10.1007\/978-3-031-48624-1_1"},{"key":"3_CR11","series-title":"Part VII, volume 14444 of Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-981-99-8739-9_12","volume-title":"Advances in Cryptology - ASIACRYPT 2023","author":"E Persichetti","year":"2023","unstructured":"Persichetti, E., Santini, P.: A new formulation of the linear equivalence problem and shorter LESS signatures. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology - ASIACRYPT 2023. Part VII, volume 14444 of Lecture Notes in Computer Science, pp. 351\u2013378. Springer, Singapore (2023)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Richmond, L.B., Shallit, J.O.: Counting abelian squares. Electron. J. Comb. 16(1) (2009)","DOI":"10.37236\/161"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Sendrier, N., Simos, D.E.: The hardness of code equivalence over $$\\textbf{F}_q$$ and its application to code-based cryptography. In: Gaborit, P. (ed.) Post-Quantum Cryptography, vol. 7932 of LNCS, pp. 203\u2013216. Springer (2013)","DOI":"10.1007\/978-3-642-38616-9_14"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."}],"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-86599-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:53:53Z","timestamp":1742842433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86599-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865985","9783031865992"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86599-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"15 March 2025","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2025.iis.sinica.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}