{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T09:44:28Z","timestamp":1766223868985,"version":"3.48.0"},"reference-count":18,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Post-quantum cryptography deals with the development and analysis of cryptographic schemes that are assumed to be secure even against attackers with access to a powerful quantum computer. Along the main candidates for quantum-safe solutions are cryptographic schemes, whose security is based on classic lattice problems such as the\n                    <jats:italic>bounded-distance decoding (BDD) problem<\/jats:italic>\n                    or the\n                    <jats:italic>learning with error problem<\/jats:italic>\n                    . In this work, we contribute to the analysis of an attack category against these problems called\n                    <jats:italic>dual attack<\/jats:italic>\n                    . In recent years, a lot of notable progress was achieved in this topic. Our first contribution is to provide theoretical counterarguments against a so-called independence assumption, which was used in earlier works on this attack, and which was shown in a previous work to be contradicting practical experiments. Then, we provide estimates on the success probability and the cost of the dual attack against the decisional version of the BDD problem. These estimates are derived both rigorously and heuristically. Finally, we also provide experimental evidence that confirms these results.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2024-0028","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:07:38Z","timestamp":1751533658000},"source":"Crossref","is-referenced-by-count":0,"title":["On the independence heuristic in the dual attack"],"prefix":"10.1515","volume":"19","author":[{"given":"Kaveh","family":"Bashiri","sequence":"first","affiliation":[{"name":"Bundesamt f\u00fcr Sicherheit in der Informationstechnik (BSI) , Bonn , Germany"}]},{"given":"Andreas","family":"Wiemers","sequence":"additional","affiliation":[{"name":"Bundesamt f\u00fcr Sicherheit in der Informationstechnik (BSI) , Bonn , Germany"}]}],"member":"374","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"key":"2025122009205543633_j_jmc-2024-0028_ref_001","doi-asserted-by":"crossref","unstructured":"Arora S, Ge R. New algorithms for learning in presence of errors. In: International colloquium on automata, languages, and programming. Berlin, Heidelberg: Springer; 2011. p. 403\u201315.","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_002","doi-asserted-by":"crossref","unstructured":"Kirchner P, Fouque PA. An improved BKW algorithm for LWE with applications to cryptography and lattices. In: Advances in Cryptology-CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part I 35. Berlin, Heidelberg: Springer; 2015. p. 43\u201362.","DOI":"10.1007\/978-3-662-47989-6_3"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_003","unstructured":"Gama N, Nguyen PQ. Predicting lattice reduction. In: Advances in Cryptology-EUROCRYPT 2008: 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13\u201317, 2008. Proceedings 27. Berlin, Heidelberg: Springer; 2008. p. 31\u201351."},{"key":"2025122009205543633_j_jmc-2024-0028_ref_004","doi-asserted-by":"crossref","unstructured":"Aharonov D, Regev O. Lattice problems in NP \u2229 coNP. JACM. 2005;52(5):749\u201365.","DOI":"10.1145\/1089023.1089025"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_005","doi-asserted-by":"crossref","unstructured":"Laarhoven T, Walter M. Dual lattice attacks for closest vector problems (with preprocessing). In: Cryptographers Track at the RSA Conference. Cham: Springer; 2021. p. 478\u2013502.","DOI":"10.1007\/978-3-030-75539-3_20"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_006","doi-asserted-by":"crossref","unstructured":"Guo Q, Johansson T. Faster dual lattice attacks for solving LWE with applications to CRYSTALS. In: Advances in Cryptology-ASIACRYPT 2021: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6\u201310, 2021, Proceedings, Part IV 27. Cham: Springer; 2021. p. 33\u201362.","DOI":"10.1007\/978-3-030-92068-5_2"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_007","doi-asserted-by":"crossref","unstructured":"Ducas L, Pulles LN. Does the dual-sieve attack on learning with errors even work? In: Annual International Cryptology Conference. Cham: Springer; 2023. p. 37\u201369.","DOI":"10.1007\/978-3-031-38548-3_2"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_008","unstructured":"Ducas L, Pulles LN. Accurate score prediction for dual-sieve attacks. Cryptology ePrint Archive, Paper 2023\/1850. https:\/\/eprint.iacr.org\/2023\/1850."},{"key":"2025122009205543633_j_jmc-2024-0028_ref_009","doi-asserted-by":"crossref","unstructured":"Pouly A, Shen Y. Provable dual attacks on learning with errors. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer; 2024. p. 256\u201385.","DOI":"10.1007\/978-3-031-58754-2_10"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_010","doi-asserted-by":"crossref","unstructured":"Regev O. New lattice-based cryptographic constructions. JACM. 2004;51(6):899\u2013942.","DOI":"10.1145\/1039488.1039490"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_011","doi-asserted-by":"crossref","unstructured":"Peikert C. A decade of lattice cryptography. Foundations Trends\u00ae Theoret Comp Sci. 2016;10(4):283\u2013424.","DOI":"10.1561\/0400000074"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_012","unstructured":"Billingsley P. Probability and Measure. New York: John Wiley & Sons Inc.; 2012."},{"key":"2025122009205543633_j_jmc-2024-0028_ref_013","doi-asserted-by":"crossref","unstructured":"Laurent B, Massart P. Adaptive estimation of a quadratic functional by model selection. Ann Statist. 2000;28(5):1302\u201338.","DOI":"10.1214\/aos\/1015957395"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_014","unstructured":"Stephens-Davidowitz N. On the Gaussian measure over lattices. USA: New York University; 2017."},{"key":"2025122009205543633_j_jmc-2024-0028_ref_015","doi-asserted-by":"crossref","unstructured":"Banaszczyk W. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen. 1993;296:625\u201335.","DOI":"10.1007\/BF01445125"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_016","unstructured":"Chen Y, Hu Z, Liu Q, Luo H, Tu Y. LWE with quantum amplitudes: algorithm, hardness, and oblivious sampling; 2023. Cryptology ePrint Archive, Paper 2023\/1498. https:\/\/eprint.iacr.org\/2023\/1498."},{"key":"2025122009205543633_j_jmc-2024-0028_ref_017","doi-asserted-by":"crossref","unstructured":"Yuan DM, Wei LR, Lei L. Conditional central limit theorems for a sequence of conditional independent random variables. J Korean Math Soc. 2014;51(1):1\u201315.","DOI":"10.4134\/JKMS.2014.51.1.001"},{"key":"2025122009205543633_j_jmc-2024-0028_ref_018","doi-asserted-by":"crossref","unstructured":"Batir N. Inequalities for the gamma function. Archiv der Math. 2008;91(6):554\u201363.","DOI":"10.1007\/s00013-008-2856-9"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0028\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0028\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T09:39:48Z","timestamp":1766223588000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0028\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,1]]},"references-count":18,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,4,14]]},"published-print":{"date-parts":[[2025,4,14]]}},"alternative-id":["10.1515\/jmc-2024-0028"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2024-0028","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2025,1,1]]},"article-number":"20240028"}}