{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T22:41:29Z","timestamp":1775601689128,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"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":"publisher","award":["61632013"],"award-info":[{"award-number":["61632013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972370"],"award-info":[{"award-number":["61972370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["WK3480000007"],"award-info":[{"award-number":["WK3480000007"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012476","name":"Fundamental Research Funds for Central Universities of the Central South University","doi-asserted-by":"publisher","award":["62072207"],"award-info":[{"award-number":["62072207"]}],"id":[{"id":"10.13039\/501100012476","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-022-03774-5","type":"journal-article","created":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T13:07:22Z","timestamp":1671282442000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Quantum attacks against BBB secure PRFs or MACs built from public random permutations"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7630-6802","authenticated-orcid":false,"given":"Jiehui","family":"Nan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honggang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"key":"3774_CR1","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., K\u00f6lbl, S., Lucks, S., Massolino, P.M.C., Mendel, F., Nawaz, K., Schneider, T., Schwabe, P., Standaert, F.X., Todo, Y., Viguier, B.: Gimli : A cross-platform permutation. In: Fischer, W., Homma, N. (eds.) CHES\u00a02017. LNCS, vol. 10529, pp. 299\u2013320. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_15","DOI":"10.1007\/978-3-319-66787-4_15"},{"key":"3774_CR2","doi-asserted-by":"publisher","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: Keccak. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT\u00a02013. LNCS, vol.\u00a07881, pp. 313\u2013314. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_19","DOI":"10.1007\/978-3-642-38348-9_19"},{"key":"3774_CR3","doi-asserted-by":"publisher","unstructured":"Black, J., Rogaway, P.: CBC MACs for arbitrary-length messages: The three-key constructions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 197\u2013215. Springer, Heidelberg (2000)https:\/\/doi.org\/10.1007\/3-540-44598-6_12","DOI":"10.1007\/3-540-44598-6_12"},{"key":"3774_CR4","doi-asserted-by":"publisher","unstructured":"Black, J., Rogaway, P.: A block-cipher mode of operation for parallelizable message authentication. In: Knudsen, L.R. (ed.) EUROCRYPT\u00a02002. LNCS, vol.\u00a02332, pp. 384\u2013397. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_25","DOI":"10.1007\/3-540-46035-7_25"},{"issue":"10","key":"3774_CR5","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1109\/TC.2012.196","volume":"62","author":"A Bogdanov","year":"2013","unstructured":"Bogdanov, A., Knezevic, M., Leander, G., Toz, D., Varici, K., Verbauwhede, I.: SPONGENT: the design space of lightweight cryptographic hashing. IEEE Trans. Comput. 62(10), 2041\u20132053 (2013). https:\/\/doi.org\/10.1109\/TC.2012.196","journal-title":"IEEE Trans. Comput."},{"key":"3774_CR6","doi-asserted-by":"crossref","unstructured":"Bonnetain, X.: Tight bounds for simon\u2019s algorithm. In: Longa, P., R\u00e0fols, C. (eds.) Progress in Cryptology - LATINCRYPT 2021 - 7th International Conference on Cryptology and Information Security in Latin America, Bogot\u00e1, Colombia, October 6-8, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12912, pp. 3\u201323. Springer (2021), https:\/\/doi.org\/10.1007\/978-3-030-88238-9_1","DOI":"10.1007\/978-3-030-88238-9_1"},{"key":"3774_CR7","doi-asserted-by":"crossref","unstructured":"Bonnetain, X., Leurent, G., Naya-Plasencia, M., Schrottenloher, A.: Quantum linearization attacks. IACR Cryptol. ePrint Arch. p.\u00a01239 (2021), https:\/\/eprint.iacr.org\/2021\/1239","DOI":"10.1007\/978-3-030-92062-3_15"},{"issue":"2","key":"3774_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.13154\/tosc.v2020.i2.1-39","volume":"2020","author":"A Chakraborti","year":"2020","unstructured":"Chakraborti, A., Nandi, M., Talnikar, S., Yasuda, K.: On the composition of single-keyed tweakable Even-Mansour for achieving BBB security. IACR Trans. Symm. Cryptol. 2020(2), 1\u201339 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i2.1-39","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"3774_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Y.L., Lambooij, E., Mennink, B.: How to build pseudorandom functions from public random permutations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0I. LNCS, vol. 11692, pp. 266\u2013293. Springer, Heidelberg (Aug 2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_10","DOI":"10.1007\/978-3-030-26948-7_10"},{"issue":"3","key":"3774_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11128-021-03027-x","volume":"20","author":"J Cui","year":"2021","unstructured":"Cui, J., Guo, J., Ding, S.: Applications of simon\u2019s algorithm in quantum attacks on feistel variants. Quantum Inf. Process. 20(3), 117 (2021). https:\/\/doi.org\/10.1007\/s11128-021-03027-x","journal-title":"Quantum Inf. Process."},{"key":"3774_CR11","doi-asserted-by":"publisher","unstructured":"Dai, W., Hoang, V.T., Tessaro, S.: Information-theoretic indistinguishability via the chi-squared method. In: Katz, J., Shacham, H. (eds.) CRYPTO\u00a02017, Part\u00a0III. LNCS, vol. 10403, pp. 497\u2013523. Springer, Heidelberg (Aug 2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_17","DOI":"10.1007\/978-3-319-63697-9_17"},{"issue":"2","key":"3774_CR12","doi-asserted-by":"publisher","first-page":"22501:1","DOI":"10.1007\/s11432-017-9436-7","volume":"62","author":"X Dong","year":"2019","unstructured":"Dong, X., Li, Z., Wang, X.: Quantum cryptanalysis on some generalized feistel schemes. Sci. China Inf. Sci. 62(2), 22501:1-22501:12 (2019). https:\/\/doi.org\/10.1007\/s11432-017-9436-7","journal-title":"Sci. China Inf. Sci."},{"key":"3774_CR13","doi-asserted-by":"publisher","unstructured":"Dong, X., Sun, S., Shi, D., Gao, F., Wang, X., Hu, L.: Quantum collision attacks on AES-like hashing with low quantum random access memories. In: Moriai, S., Wang, H. (eds.) ASIACRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12492, pp. 727\u2013757. Springer, Heidelberg (Dec 2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_25","DOI":"10.1007\/978-3-030-64834-3_25"},{"key":"3774_CR14","doi-asserted-by":"publisher","unstructured":"Dutta, A., Nandi, M.: BBB secure nonce based MAC using public permutations. In: Nitaj, A., Youssef, A.M. (eds.) AFRICACRYPT 20. LNCS, vol. 12174, pp. 172\u2013191. Springer, Heidelberg (Jul 2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_9","DOI":"10.1007\/978-3-030-51938-4_9"},{"issue":"2","key":"3774_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.46586\/tosc.v2021.i2.31-70","volume":"2021","author":"A Dutta","year":"2021","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Permutation based EDM: an inverse free BBB secure PRF. IACR Trans. Symmetric Cryptol. 2021(2), 31\u201370 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i2.31-70","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"3774_CR16","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Tight security analysis of the public permutation-based PMAC_Plus. Cryptology ePrint Archive, Report 2022\/905 (2022), https:\/\/eprint.iacr.org\/2022\/905"},{"key":"3774_CR17","doi-asserted-by":"publisher","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds.) ASIACRYPT\u201991. LNCS, vol.\u00a0739, pp. 210\u2013224. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57332-1_17","DOI":"10.1007\/3-540-57332-1_17"},{"key":"3774_CR18","doi-asserted-by":"publisher","unstructured":"Grassi, L., Naya-Plasencia, M., Schrottenloher, A.: Quantum algorithms for the $$k$$-xor problem. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT\u00a02018, Part\u00a0I. LNCS, vol. 11272, pp. 527\u2013559. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_18","DOI":"10.1007\/978-3-030-03326-2_18"},{"key":"3774_CR19","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: 28th ACM STOC. pp. 212\u2013219. ACM (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"3774_CR20","doi-asserted-by":"publisher","unstructured":"Guo, T., Wang, P., Hu, L., Ye, D.: Attacks on beyond-birthday-bound macs in the quantum setting. In: Cheon, J.H., Tillich, J. (eds.) Post-quantum Cryptography - 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20-22, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12841, pp. 421\u2013441. Springer (2021), https:\/\/doi.org\/10.1007\/978-3-030-81293-5_22","DOI":"10.1007\/978-3-030-81293-5_22"},{"key":"3774_CR21","doi-asserted-by":"publisher","unstructured":"Iwata, T., Kurosawa, K.: OMAC: One-key CBC MAC. In: Johansson, T. (ed.) FSE\u00a02003. LNCS, vol.\u00a02887, pp. 129\u2013153. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39887-5_11","DOI":"10.1007\/978-3-540-39887-5_11"},{"key":"3774_CR22","doi-asserted-by":"publisher","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using quantum period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0II. LNCS, vol.\u00a09815, pp. 207\u2013237. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8","DOI":"10.1007\/978-3-662-53008-5_8"},{"issue":"1","key":"3774_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s001450010015","volume":"14","author":"J Kilian","year":"2001","unstructured":"Kilian, J., Rogaway, P.: How to protect DES against exhaustive key search (an analysis of DESX). J. Cryptol. 14(1), 17\u201335 (2001). https:\/\/doi.org\/10.1007\/s001450010015","journal-title":"J. Cryptol."},{"key":"3774_CR24","doi-asserted-by":"publisher","unstructured":"Kim, S., Lee, B., Lee, J.: Tight security bounds for double-block hash-then-sum MACs. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105, pp. 435\u2013465. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_16","DOI":"10.1007\/978-3-030-45721-1_16"},{"key":"3774_CR25","doi-asserted-by":"publisher","unstructured":"Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round feistel cipher and the random permutation. In: IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings. pp. 2682\u20132685. IEEE (2010). https:\/\/doi.org\/10.1109\/ISIT.2010.5513654,","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"3774_CR26","unstructured":"Kuwakado, H., Morii, M.: Security on the quantum-type even-mansour cipher. In: Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012. pp. 312\u2013316. IEEE (2012), https:\/\/ieeexplore.ieee.org\/document\/6400943\/"},{"key":"3774_CR27","doi-asserted-by":"publisher","unstructured":"Leander, G., May, A.: Grover meets simon - quantumly attacking the FX-construction. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT\u00a02017, Part\u00a0II. LNCS, vol. 10625, pp. 161\u2013178. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_6","DOI":"10.1007\/978-3-319-70697-9_6"},{"key":"3774_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-25516-8_24","volume-title":"13th IMA International Conference on Cryptography and Coding","author":"K Minematsu","year":"2011","unstructured":"Minematsu, K., Iwata, T.: Building blockcipher from tweakable blockcipher: Extending FSE 2009 proposal. In: Chen, L. (ed.) 13th IMA International Conference on Cryptography and Coding. LNCS, vol. 7089, pp. 391\u2013412. Springer, Heidelberg (Dec (2011)"},{"key":"3774_CR29","doi-asserted-by":"publisher","unstructured":"Nandi, M.: Mind the composition: birthday bound attacks on EWCDMD and SoKAC21. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I. LNCS, vol. 12105, pp. 203\u2013220. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_8","DOI":"10.1007\/978-3-030-45721-1_8"},{"key":"3774_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106172","volume":"173","author":"K Shinagawa","year":"2022","unstructured":"Shinagawa, K., Iwata, T.: Quantum attacks on sum of even-mansour pseudorandom functions. Inf. Process. Lett. 173, 106172 (2022). https:\/\/doi.org\/10.1016\/j.ipl.2021.106172","journal-title":"Inf. Process. Lett."},{"key":"3774_CR31","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS. pp. 124\u2013134. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"3774_CR32","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997). https:\/\/doi.org\/10.1137\/S0097539796298637","journal-title":"SIAM J. Comput."},{"key":"3774_CR33","doi-asserted-by":"publisher","unstructured":"Yasuda, K.: The sum of CBC macs is a secure PRF. In: Pieprzyk, J. (ed.) Topics in cryptology - CT-RSA 2010, The Cryptographers\u2019 Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a05985, pp. 366\u2013381. Springer (2010), https:\/\/doi.org\/10.1007\/978-3-642-11925-5_25","DOI":"10.1007\/978-3-642-11925-5_25"},{"key":"3774_CR34","doi-asserted-by":"publisher","unstructured":"Yasuda, K.: A new variant of PMAC: Beyond the birthday bound. In: Rogaway, P. (ed.) CRYPTO\u00a02011. LNCS, vol.\u00a06841, pp. 596\u2013609. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_34","DOI":"10.1007\/978-3-642-22792-9_34"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03774-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03774-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03774-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T21:43:53Z","timestamp":1676497433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03774-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":34,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["3774"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03774-5","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,17]]},"assertion":[{"value":"22 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Informed consent was obtained from all authors included in the study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"26"}}