{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:10:56Z","timestamp":1784182256845,"version":"3.55.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T00:00:00Z","timestamp":1784160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T00:00:00Z","timestamp":1784160000000},"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 Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-026-00646-9","type":"journal-article","created":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:45:40Z","timestamp":1784180740000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the construction of Barnes\u2013Wall lattices and their application in cryptography"],"prefix":"10.1007","volume":"22","author":[{"given":"Artyom","family":"Kuninets","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anton","family":"Leevik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ekaterina","family":"Malygina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evgeniy","family":"Melnichuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Denis","family":"Nabokov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,16]]},"reference":[{"key":"646_CR1","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1007\/s10623-018-0573-3","volume":"87","author":"L Ducas","year":"2019","unstructured":"Ducas, L., Pierrot, C.: Polynomial time bounded distance decoding near Minkowski\u2019s bound in discrete logarithm lattices. Des. Codes Cryptogr. 87, 1737\u20131748 (2019)","journal-title":"Des. Codes Cryptogr."},{"key":"646_CR2","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-031-07082-2_23","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2022","author":"L Ducas","year":"2022","unstructured":"Ducas, L., Woerden, W.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology\u2014EUROCRYPT 2022, pp. 643\u2013673. Springer, Cham (2022)"},{"key":"646_CR3","doi-asserted-by":"publisher","unstructured":"Biage, C., Zambonin, G., Idalino, G., Panario, T.B., Custodio, D., R,: A concrete lip-based KEM with simple lattices. IEEE Access 12, 16408\u201316420 (2024). https:\/\/doi.org\/10.1109\/ACCESS.2024.3358670","DOI":"10.1109\/ACCESS.2024.3358670"},{"key":"646_CR4","unstructured":"Branco, P., Malavolta, G., Maradni, Z.: Fully-homomorphic encryption from lattice isomorphism. Cryptology. ePrint Archive Paper 2025\/993 (2025). https:\/\/eprint.iacr.org\/2025\/993"},{"key":"646_CR5","unstructured":"Woerden, W.P.J.: Lattice cryptography, from cryptanalysis to new foundations. PhD thesis, Leiden University (2023). https:\/\/scholarlypublications.universiteitleiden.nl\/access\/item%3A3564772\/download"},{"key":"646_CR6","unstructured":"Battagliola, M., Mora, R., Santini, P.: Using the schur product to solve the code equivalence problem. Cryptology. ePrint Archive, Paper 2025\/1017 (2025). https:\/\/eprint.iacr.org\/2025\/1017"},{"key":"646_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"646_CR8","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 135\u2013149. SIAM (2007)","DOI":"10.1137\/1.9781611972870.13"},{"key":"646_CR9","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 684\u2013697 (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"646_CR10","doi-asserted-by":"publisher","unstructured":"Conway, J., Sloane, N.: Sphere Packings, Lattices and Groups, vol. 290 (1988). https:\/\/doi.org\/10.1007\/978-1-4757-2016-7","DOI":"10.1007\/978-1-4757-2016-7"},{"key":"646_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-031-31368-4_7","volume-title":"Public-Key Cryptography\u2014PKC 2023","author":"L Ducas","year":"2023","unstructured":"Ducas, L., Gibbons, S.: Hull attacks on the lattice isomorphism problem. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography\u2014PKC 2023, pp. 177\u2013204. Springer, Cham (2023)"},{"issue":"5","key":"646_CR12","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/18.21246","volume":"34","author":"GD Forney","year":"1988","unstructured":"Forney, G.D.: Coset codes. II. Binary lattices and related codes. IEEE Trans. Inf. Theory 34(5), 1152\u20131187 (1988). https:\/\/doi.org\/10.1109\/18.21246","journal-title":"IEEE Trans. Inf. Theory"},{"key":"646_CR13","unstructured":"Espitau, T., Wallet, A., Yu, Y.: On Gaussian sampling, smoothing parameter and application to signatures. Cryptology. ePrint Archive, Paper 2023\/1654 (2023). https:\/\/eprint.iacr.org\/2023\/1654"},{"key":"646_CR14","doi-asserted-by":"publisher","unstructured":"Albrecht, M., Ben\u010dina, B., Lai, R.W.F.: Hollow LWE: a new spin: unbounded updatable encryption from LWE and PCE. pp. 363\u2013392 (2025). https:\/\/doi.org\/10.1007\/978-3-031-91101-9_13","DOI":"10.1007\/978-3-031-91101-9_13"},{"key":"646_CR15","unstructured":"Corlay, V.: Decoding algorithms for lattices. PhD thesis, Institut Polytechnique de Paris (2020)"},{"key":"646_CR16","unstructured":"Bollauf, M.F., Lie, M., Ling, C.: On Gaussian sampling for $$q$$-ary lattices and linear codes with Lee weight. Cryptology. ePrint Archive, Paper 2025\/087 (2025). https:\/\/eprint.iacr.org\/2025\/087"},{"issue":"3","key":"646_CR17","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory (Corresp.) 24(3), 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","journal-title":"IEEE Trans. Inf. Theory (Corresp.)"},{"key":"646_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3934\/amc.2022029","volume":"18","author":"V Weger","year":"2022","unstructured":"Weger, V., Khathuria, K., Horlemann, A.-L., Battaglioni, M., Santini, P., Persichetti, E.: On the hardness of the lee syndrome decoding problem. Adv. Math. Commun. 18, 1 (2022). https:\/\/doi.org\/10.3934\/amc.2022029","journal-title":"Adv. Math. Commun."},{"key":"646_CR19","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures, vol. 37, pp. 372\u2013381 (2004)","DOI":"10.1109\/FOCS.2004.72"},{"key":"646_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","volume-title":"Theory Cryptogr.","author":"C Peikert","year":"2006","unstructured":"Peikert, C., Rosen, A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Halevi, S., Rabin, T. (eds.) Theory Cryptogr., pp. 145\u2013166. Springer, Berlin, Heidelberg (2006)"},{"key":"646_CR21","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing. STOC \u201913, pp. 575\u2013584. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"646_CR22","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective, vol. 671 (2002). https:\/\/doi.org\/10.1007\/978-1-4615-0897-7","DOI":"10.1007\/978-1-4615-0897-7"},{"issue":"1","key":"646_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986). https:\/\/doi.org\/10.1007\/BF02579403","journal-title":"Combinatorica"},{"key":"646_CR24","doi-asserted-by":"publisher","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2013). https:\/\/doi.org\/10.1137\/1.9781611973402.29","DOI":"10.1137\/1.9781611973402.29"},{"key":"646_CR25","unstructured":"Klein, P.: Finding the closest lattice vector when it\u2019s unusually close. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937\u2013941 (2000)"},{"key":"646_CR26","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions, vol. 14, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"646_CR27","doi-asserted-by":"crossref","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.) Advances in Cryptology\u2014EUROCRYPT 2023, pp. 252\u2013281. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30589-4_9"},{"key":"646_CR28","doi-asserted-by":"publisher","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 391\u2013404 (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.29","DOI":"10.1137\/1.9781611973402.29"},{"key":"646_CR29","doi-asserted-by":"publisher","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),(2022). https:\/\/doi.org\/10.3934\/amc.2022064","DOI":"10.3934\/amc.2022064"},{"issue":"5","key":"646_CR30","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5), 1602\u20131604 (1997). https:\/\/doi.org\/10.1109\/18.623157","journal-title":"IEEE Trans. Inf. Theory"},{"key":"646_CR31","doi-asserted-by":"publisher","unstructured":"Kaski, P., Ostergard, P.: Classification algorithms for codes and designs (2005). https:\/\/doi.org\/10.1007\/3-540-28991-7","DOI":"10.1007\/3-540-28991-7"},{"key":"646_CR32","doi-asserted-by":"publisher","unstructured":"Grochow, J.A.: Matrix isomorphism of matrix lie algebras. In: 2012 IEEE 27th Conference on Computational Complexity, pp. 203\u2013213 (2012). https:\/\/doi.org\/10.1109\/CCC.2012.34","DOI":"10.1109\/CCC.2012.34"},{"key":"646_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01542-3","author":"H Bennett","year":"2024","unstructured":"Bennett, H., Win, K.M.H.: Relating code equivalence to other isomorphism problems. Des. Codes Cryptogr. (2024). https:\/\/doi.org\/10.1007\/s10623-024-01542-3","journal-title":"Des. Codes Cryptogr."},{"key":"646_CR34","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-09-02224-8","author":"M Sikiric","year":"2008","unstructured":"Sikiric, M., Schuermann, A., Vallentin, F.: Complexity and algorithms for computing Voronoi cells of lattices. Math. Comput. (2008). https:\/\/doi.org\/10.1090\/S0025-5718-09-02224-8","journal-title":"Math. Comput."},{"key":"646_CR35","doi-asserted-by":"publisher","unstructured":"Bardet, M., Otmani, A., Saeed-Taha, M.: Permutation code equivalence is not harder than graph isomorphism when hulls are trivial. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2464\u20132468 (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849855","DOI":"10.1109\/ISIT.2019.8849855"},{"key":"646_CR36","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Shagrithaya, N., Veliche, A.: Reductions between code equivalence problems. Cryptology. ePrint Archive, Paper 2025\/208 (2025). https:\/\/eprint.iacr.org\/2025\/208","DOI":"10.1109\/ISIT63088.2025.11195558"},{"issue":"1","key":"646_CR37","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., Woerden, W.P.: A canonical form for positive definite matrices. Open Book Ser. 4(1), 179\u2013195 (2020)","journal-title":"Open Book Ser."},{"key":"646_CR38","unstructured":"Huang, T.P., Postlethwaite, E.W., Prest, T., Pulles, L.N., Woerden, W.: https:\/\/hawk-sign.info"},{"key":"646_CR39","unstructured":"Sendrier, N., Simos, D.: How easy is code equivalence over Fq? (2013)"},{"key":"646_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: The support splitting algorithm. IEEE Trans. Inf. Theory (2000). https:\/\/doi.org\/10.1109\/18.850662","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"646_CR41","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1137\/S0895480195294027","volume":"10","author":"N Sendrier","year":"1997","unstructured":"Sendrier, N.: On the dimension of the hull. SIAM J. Discret. Math. 10(2), 282\u2013293 (1997)","journal-title":"SIAM J. Discret. Math."},{"key":"646_CR42","doi-asserted-by":"crossref","unstructured":"Budroni, A., Chi-Dom\u00ednguez, J.-J., D\u2019Alconzo, G., Di Scala, A.J., Kulkarni, M.: Don\u2019t use it twice! solving relaxed linear equivalence problems. In: Chung, K.-M., Sasaki, Y. (eds.) Advances in Cryptology\u2014ASIACRYPT 2024, pp. 35\u201365. Springer, Singapore (2025)","DOI":"10.1007\/978-981-96-0944-4_2"},{"issue":"3","key":"646_CR43","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"J Leon","year":"1982","unstructured":"Leon, J.: Computing automorphism groups of error-correcting codes. IEEE Trans. Inf. Theory 28(3), 496\u2013511 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056498","journal-title":"IEEE Trans. Inf. Theory"},{"key":"646_CR44","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-81652-0_15","volume-title":"Selected Areas in Cryptography","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Not enough less: an improved algorithm for solving code equivalence problems over Fq. In: Dunkelman, O., Jacobson, M.J., Jr., O\u2019Flynn, C. (eds.) Selected Areas in Cryptography, pp. 387\u2013403. Springer, Cham (2021)"},{"key":"646_CR45","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F., Micheli, G., Persichetti, E., Santini, P.: Less is more: code-based signatures without syndromes. In: Nitaj, A., Youssef, A. (eds.) Progress in Cryptology\u2014AFRICACRYPT 2020, pp. 45\u201365. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"646_CR46","doi-asserted-by":"publisher","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems, vol. 66, pp. 68\u201385 (2006). https:\/\/doi.org\/10.1007\/3-540-54458-5_51","DOI":"10.1007\/3-540-54458-5_51"},{"key":"646_CR47","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nguyen, P.Q.: Bkz 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) Advances in Cryptology\u2014ASIACRYPT 2011, pp. 1\u201320. Springer, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"646_CR48","doi-asserted-by":"publisher","unstructured":"Schnorr, C.: Lattice reduction by random sampling and birthday methods, vol. 2607 (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_14","DOI":"10.1007\/3-540-36494-3_14"},{"key":"646_CR49","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key Exchange\u2014a new hope. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 327\u2013343 (2016). https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim"},{"key":"646_CR50","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 10\u201324. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"646_CR51","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10623-015-0067-5","volume":"77","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T., Mosca, M., Van De Pol, J.: Finding shortest lattice vectors faster using quantum search. Des. Codes Crypt. 77, 375\u2013400 (2015)","journal-title":"Des. Codes Crypt."},{"key":"646_CR52","unstructured":"Ackermann, L., Roux-Langlois, A., Wallet, A.: Public-key encryption from the lattice isomorphism problem. In: WCC 2024\u2014The Thirteenth International Workshop on Coding and Cryptography, Perugia, Italy, pp. 1\u201311 (2024). https:\/\/inria.hal.science\/hal-04924507"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-026-00646-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-026-00646-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-026-00646-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:45:46Z","timestamp":1784180746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-026-00646-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,16]]},"references-count":52,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["646"],"URL":"https:\/\/doi.org\/10.1007\/s11416-026-00646-9","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,16]]},"assertion":[{"value":"11 February 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"62"}}