{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T21:05:12Z","timestamp":1758056712707,"version":"3.44.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T00:00:00Z","timestamp":1750377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T00:00:00Z","timestamp":1750377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272147","12471492"],"award-info":[{"award-number":["62272147","12471492"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Hubei Province of China","award":["2024AFB573"],"award-info":[{"award-number":["2024AFB573"]}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2023YFA1011200"],"award-info":[{"award-number":["2023YFA1011200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Innovation Group Project of the Natural Science Foundation of Hubei Province of China","award":["2023AFA021"],"award-info":[{"award-number":["2023AFA021"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10623-025-01667-z","type":"journal-article","created":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T10:50:09Z","timestamp":1750416609000},"page":"4043-4081","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A novel algorithm for the k-XOR problem"],"prefix":"10.1007","volume":"93","author":[{"given":"Yong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zejun","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyong","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shasha","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,20]]},"reference":[{"key":"1667_CR1","doi-asserted-by":"publisher","unstructured":"Becker, A., Coron, J.S., Joux, A.: Improved generic algorithms for hard knapsacks, in Advances in Cryptology\u2013EUROCRYPT (Lecture Notes in Computer Science), vol. 6632, K.G. Paterson, Ed. Tallinn, Estonia: Springer, pp. 364\u2013385 (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_21.","DOI":"10.1007\/978-3-642-20465-4_21"},{"key":"1667_CR2","first-page":"160","volume":"7","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein D.J.: Better price-performance ratios for generalized birthday attacks. Workshop Record SHARCS 7, 160 (2007).","journal-title":"Workshop Record SHARCS"},{"key":"1667_CR3","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Lange, T., Niederhagen, R., Peters, C., Schwabe, P.: \u201cFsbday,\" in Progress in Cryptology\u2013INDOCRYPT (Lecture Notes in Computer Science), vol. 5922, B. Roy and N. Sendrier, Ed. New Delhi, India: Springer, pp. 18\u201338, (2009) https:\/\/doi.org\/10.1007\/978-3-642-10628-6_2.","DOI":"10.1007\/978-3-642-10628-6_2"},{"key":"1667_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5195\/ledger.2017.48","volume":"2","author":"A Biryukov","year":"2017","unstructured":"Biryukov A., Khovratovich D.: Equihash: asymmetric proof-of-work based on the generalized birthday problem. Ledger 2, 1\u201330 (2017).","journal-title":"Ledger"},{"issue":"1","key":"1667_CR5","doi-asserted-by":"publisher","first-page":"380","DOI":"10.13154\/tosc.v2017.i1.380-397","volume":"2017","author":"L Both","year":"2017","unstructured":"Both L., May A.: The approximate $$k$$-list problem. IACR Trans. Symmetric Cryptol. 2017(1), 380\u2013397 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.380-397.","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"8","key":"1667_CR6","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1007\/s10623-018-00594-6","volume":"87","author":"I Dinur","year":"2019","unstructured":"Dinur I.: An algorithmic framework for the generalized birthday problem. Des. Codes Cryptogr. 87(8), 1897\u20131926 (2019). https:\/\/doi.org\/10.1007\/s10623-018-00594-6.","journal-title":"Des. Codes Cryptogr."},{"key":"1667_CR7","doi-asserted-by":"publisher","unstructured":"Dinur, I., Dunkelman, O., Keller, N., Shamir, A.: \u201cEfficient dissection of composite problems, with applications to cryptanalysis, knapsacks, and combinatorial search problems,\" in Advances in Cryptology\u2013CRYPTO (Lecture Notes in Computer Science), vol. 7417, R. Safavi-Naini and R. Canetti, Ed. Santa Barbara, CA, USA: Springer, 719\u2013740, (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_42.","DOI":"10.1007\/978-3-642-32009-5_42"},{"key":"1667_CR8","doi-asserted-by":"publisher","unstructured":"Grassi, L., Naya-Plasencia, M., Schrottenloher, A.: \u201cQuantum algorithms for the $$k$$-xor problem,\" in Advances in Cryptology\u2013ASIACRYPT (Lecture Notes in Computer Science), vol. 11272, T. Peyrin and S. Galbraith, Ed. Brisbane, QLD, Australia: Springer, 527\u2013559, (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_18.","DOI":"10.1007\/978-3-030-03326-2_18"},{"key":"1667_CR9","doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks, in Advances in Cryptology\u2013EUROCRYPT (Lecture Notes in Computer Science), vol. 6110, H. Gilbert, Ed. Monaco\/French Riviera: Springer, pp. 235\u2013256, (2010) https:\/\/doi.org\/10.1007\/978-3-642-13190-5_12.","DOI":"10.1007\/978-3-642-13190-5_12"},{"issue":"2","key":"1667_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00145-011-9097-y","volume":"25","author":"L Minder","year":"2012","unstructured":"Minder L., Sinclair A.: The extended $$k$$-tree algorithm. J. Cryptol. 25(2), 349\u2013382 (2012). https:\/\/doi.org\/10.1007\/s00145-011-9097-y.","journal-title":"J. Cryptol."},{"key":"1667_CR11","unstructured":"Nandi, M.: Revisiting security claims of XLS and COPA. IACR Cryptol. ePrint Arch. (2015). https:\/\/eprint.iacr.org\/2015\/444."},{"key":"1667_CR12","doi-asserted-by":"publisher","unstructured":"Naya-Plasencia, M., Schrottenloher, A.: Optimal merging in quantum $$k$$-xor and $$k$$-xor-sum algorithms, in Advances in Cryptology\u2013EUROCRYPT (Lecture Notes in Computer Science), vol. 12106, A. Canteaut and Y. Ishai, Ed. Zagreb, Croatia: Springer, pp. 311\u2013340 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_11.","DOI":"10.1007\/978-3-030-45724-2_11"},{"key":"1667_CR13","doi-asserted-by":"publisher","unstructured":"Nikoli\u0107, I., Sasaki, Y.: Refinements of the $$k$$-tree algorithm for the generalized birthday problem, in Advances in Cryptology\u2013ASIACRYPT (Lecture Notes in Computer Science), vol. 9453, T. Iwata and J. Cheon, Ed. Auckland, New Zealand: Springer, pp. 683\u2013703, (2015) https:\/\/doi.org\/10.1007\/978-3-662-48800-3_28.","DOI":"10.1007\/978-3-662-48800-3_28"},{"issue":"3","key":"1667_CR14","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R Schroeppel","year":"1981","unstructured":"Schroeppel R., Shamir A.: A $$T = \\cal{O} (2^{n\/2})$$, $$S = \\cal{O} (2^{n\/4})$$ algorithm for certain NP-complete problems. SIAM J. Comput. 10(3), 456\u2013464 (1981). https:\/\/doi.org\/10.1137\/0210033.","journal-title":"SIAM J. Comput."},{"key":"1667_CR15","doi-asserted-by":"publisher","unstructured":"Schrottenloher, A.: Improved quantum algorithms for the $$k$$-xor problem, in Selected Areas in Cryptography\u2013SAC (Lecture Notes in Computer Science), vol. 13203, R. AlTawy and A. H\u00fclsing, Ed. Virtual Event: Springer, pp. 311\u2013331 (2021). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_15.","DOI":"10.1007\/978-3-030-99277-4_15"},{"issue":"1","key":"1667_CR16","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). https:\/\/doi.org\/10.1007\/PL00003816.","journal-title":"J. Cryptol."},{"key":"1667_CR17","doi-asserted-by":"publisher","unstructured":"Wagner, D.: A generalized birthday problem, in Advances in Cryptology\u2013CRYPTO (Lecture Notes in Computer Science), vol. 2442, M. Yung, Ed. Santa Barbara, California: Springer, pp. 288\u2013303 (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19","DOI":"10.1007\/3-540-45708-9_19"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01667-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01667-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01667-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:30:55Z","timestamp":1757957455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01667-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,20]]},"references-count":17,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1667"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01667-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,6,20]]},"assertion":[{"value":"3 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}