{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T05:09:55Z","timestamp":1772600995301,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T00:00:00Z","timestamp":1632960000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T00:00:00Z","timestamp":1632960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"13th Five-Year National Cryptographic Fund","award":["MMJJ20180217"],"award-info":[{"award-number":["MMJJ20180217"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s11128-021-03256-0","type":"journal-article","created":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T06:03:29Z","timestamp":1632981809000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Quantum key-recovery attack on Feistel constructions: Bernstein\u2013Vazirani meet Grover algorithm"],"prefix":"10.1007","volume":"20","author":[{"given":"Bao-Min","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Zheng","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"3256_CR1","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"3256_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"23","key":"3256_CR3","doi-asserted-by":"publisher","first-page":"4709","DOI":"10.1103\/PhysRevLett.79.4709","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum computers can search arbitrarily large databases by a single query. Phys Rev Lett 79(23), 4709 (1997)","journal-title":"Phys Rev Lett"},{"key":"3256_CR4","doi-asserted-by":"crossref","unstructured":"Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: IEEE international symposium on information theory, IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513654"},{"issue":"5","key":"3256_CR5","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"Daniel R Simon","year":"1997","unstructured":"Simon, Daniel R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3256_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s001459900025","volume":"10","author":"S Even","year":"1997","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. J. Cryptol. 10(3), 151\u2013161 (1997)","journal-title":"J. Cryptol."},{"key":"3256_CR7","unstructured":"Kuwakado, H., Morii, M.: In: Security on the quantum-type even-mansour cipher. Honolulu , pp. 312\u2013316 (2012)"},{"key":"3256_CR8","doi-asserted-by":"crossref","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., et al.: Breaking symmetric cryptosystems using quantum period finding. In: Advances in Cryptology: CRYPTO 2016. Springer-Verlag, Berlin, pp. 207\u2013237 (2016)","DOI":"10.1007\/978-3-662-53008-5_8"},{"issue":"2","key":"3256_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.4213\/mvk185","volume":"7","author":"M Kaplan","year":"2016","unstructured":"Kaplan, M.: Quantum attacks against iterated block ciphers. Mat. Vopr. Kriptogr. 7(2), 71\u201390 (2016)","journal-title":"Mat. Vopr. Kriptogr."},{"key":"3256_CR10","doi-asserted-by":"crossref","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., et al.: Quantum differential and linear cryptanalysis. Comput. Sci., pp. 71\u201394 (2017)","DOI":"10.46586\/tosc.v2016.i1.71-94"},{"issue":"102501","key":"3256_CR11","first-page":"1","volume":"61","author":"X Dong","year":"2018","unstructured":"Dong, X., Wang, X.: Quantum key-recovery attack on Feistel structures. Sci. China (Inf. Sci.) 61(102501), 1\u20137 (2018)","journal-title":"Sci. China (Inf. Sci.)"},{"key":"3256_CR12","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A., Yu, S.: Quantum Demiric-Seluk Meet-in-the-Middle Attacks: Applications to 6-Round Generic Feistel Constructions. Security and Cryptography for Networks, pp. 386\u2013403 (2018)","DOI":"10.1007\/978-3-319-98113-0_21"},{"issue":"5","key":"3256_CR13","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U., et al.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"3256_CR14","doi-asserted-by":"crossref","unstructured":"Li, H.W., Yang, L.: Quantum differential cryptanalysis to the block ciphers. In: International conference on applications and techniques in information security, pp. 44\u201351 (2015)","DOI":"10.1007\/978-3-662-48683-2_5"},{"issue":"1","key":"3256_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1008399109102","volume":"22","author":"Dubuc Sylvie","year":"2001","unstructured":"Sylvie, Dubuc: Characterization of linear structures. Des. Codes Cryptogr. 22(1), 33\u201345 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"3256_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129516000013","volume":"28","author":"HW Li","year":"2018","unstructured":"Li, H.W., Yang, L.: A quantum algorithm to approximate the linear structures of Boolean functions. Math. Struct. Comput. Sci. 28, 1\u201313 (2018)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"3256_CR17","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1007\/s10623-018-0510-5","volume":"87","author":"H Xie","year":"2019","unstructured":"Xie, H., Yang, L.: Using Bernstein-Vazirani algorithm to attack block ciphers. Des. Codes Cryptogr. 87(5), 1161\u20131182 (2019)","journal-title":"Des. Codes Cryptogr."},{"key":"3256_CR18","unstructured":"Xie, H., Yang, L.: A quantum related-key attack based on Bernstein-Vazirani algorithm (2018). arXiv:1808.03266 [quantph]"},{"key":"3256_CR19","doi-asserted-by":"crossref","unstructured":"Nyberg, K.: Constructions of bent functions and difference sets. In: EUROCRYPT, pp. 151\u2013160 (1990)","DOI":"10.1007\/3-540-46877-3_13"},{"key":"3256_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, P., Mosca, M., et al.: Quantum amplitude amplification and estimation. AMS Contemp. Math. 305, 53\u201374 (2002)","journal-title":"AMS Contemp. Math."},{"key":"3256_CR21","doi-asserted-by":"crossref","unstructured":"Dinur, I., Dunkelman, O., Keller, N., et al.: New attacks on Feistel structures with improved memory complexities. In: Advances in Cryptology: CRYPTO 2015, Part I. Springer, Berlin, pp. 433\u2013454 (2015)","DOI":"10.1007\/978-3-662-47989-6_21"},{"key":"3256_CR22","doi-asserted-by":"crossref","unstructured":"Leander, G., May, A.: Grover meets simon\u2014quantumly attacking the FX-construction. In: Advances in Cryptology: ASIACRYPT 2017, Part II. Springer, Berlin, pp. 161\u2013178 (2017)","DOI":"10.1007\/978-3-319-70697-9_6"},{"issue":"2","key":"3256_CR23","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Lub","year":"1998","unstructured":"Lub, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03256-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03256-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03256-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T08:29:59Z","timestamp":1635582599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03256-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,30]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["3256"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03256-0","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,30]]},"assertion":[{"value":"6 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"330"}}