{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:36Z","timestamp":1740137256173,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972400"],"award-info":[{"award-number":["61972400"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20181352"],"award-info":[{"award-number":["BK20181352"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["GCIS201712"],"award-info":[{"award-number":["GCIS201712"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11128-020-02778-3","type":"journal-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T08:04:38Z","timestamp":1596096278000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum algorithms for learning the algebraic normal form of quadratic Boolean functions"],"prefix":"10.1007","volume":"19","author":[{"given":"Xuexuan","family":"Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengrong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixiong","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"issue":"7779","key":"2778_CR1","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J.C., Barends, R., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"issue":"2","key":"2778_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"2778_CR3","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"2778_CR4","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)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"2778_CR5","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1993","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411\u20131473 (1993)","journal-title":"SIAM J. Comput."},{"key":"2778_CR6","first-page":"386","volume":"1993","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: Linear cryptanalysis method for DES Cipher. EUROCRYPT 1993, 386\u2013397 (1994)","journal-title":"EUROCRYPT"},{"key":"2778_CR7","first-page":"144","volume":"1995","author":"W Millan","year":"1995","unstructured":"Millan, W.: Low order approximation of cipher functions. CPA 1995, 144\u2013155 (1995)","journal-title":"CPA"},{"key":"2778_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.dam.2016.06.020","volume":"215","author":"Q Wang","year":"2016","unstructured":"Wang, Q., Tan, C.H.: On the second-order nonlinearity of the hidden weighted bit function. Discrete Appli. Math. 215, 197\u2013202 (2016)","journal-title":"Discrete Appli. Math."},{"key":"2778_CR9","doi-asserted-by":"crossref","unstructured":"Shi, D., Sun, S., Sasaki, Y., Li, C., Hu, L.: Correlation of quadratic Boolean functions: cryptanalysis of all versions of full $$\\sf MORUS$$. CRYPTO 2019, 180\u2013209 (2019)","DOI":"10.1007\/978-3-030-26951-7_7"},{"key":"2778_CR10","unstructured":"Dillon, J.F.: Elementary Hadamard difference sets. (Doctoral dissertation) (1974)"},{"issue":"1","key":"2778_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(73)90031-9","volume":"15","author":"RL McFarland","year":"1973","unstructured":"McFarland, R.L.: A family of difference sets in non-cyclic groups. J. Comb. Theory Ser. A. 15(1), 1\u201310 (1973)","journal-title":"J. Comb. Theory Ser. A."},{"key":"2778_CR12","doi-asserted-by":"crossref","unstructured":"Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: CRYPTO 1991, 86\u2013100 (1991)","DOI":"10.1007\/3-540-46766-1_6"},{"issue":"2","key":"2778_CR13","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1017\/S0960129512000151","volume":"23","author":"D Floess","year":"2013","unstructured":"Floess, D., Andersson, E., Hillery, M.: Quantum algorithms for testing and learning Boolean functions. Math. Struct. Comput. Sci. 23(2), 386\u2013398 (2013)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"6","key":"2778_CR14","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s11128-015-0954-8","volume":"14","author":"H Li","year":"2015","unstructured":"Li, H., Yang, L.: A quantum algorithm for approximating the influences of Boolean functions and its applications. Quantum Inf. Process. 14(6), 1787\u20131797 (2015)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"2778_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129516000013","volume":"28","author":"H Li","year":"2018","unstructured":"Li, H., Yang, L.: A quantum algorithm to approximate the linear structures of Boolean functions. Math. Struct. Comput. Sci. 28(1), 1\u201313 (2018)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"2778_CR16","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\u2013Vazirani algorithm to attack block ciphers. Des. Codes Crypt. 87(5), 1161\u20131182 (2019)","journal-title":"Des. Codes Crypt."},{"issue":"1&2","key":"2778_CR17","first-page":"65","volume":"20","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Hao, X., Wei, Y., Zhou, Y.: Quantum period finding based on the Bernstein\u2013Vazirani algorithm. Quantum Inf. Comput. 20(1&2), 65\u201384 (2020)","journal-title":"Quantum Inf. Comput."},{"key":"2778_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11128-018-2162-9","volume":"18","author":"H Li","year":"2019","unstructured":"Li, H.: A quantum algorithm for testing and learning resiliency of a Boolean function. Quantum Inf. Process. 18, 51 (2019)","journal-title":"Quantum Inf. Process."},{"key":"2778_CR19","unstructured":"Chakraborty, K., Chattopadhyay, A., Maitra, S.: Quantum algorithms to check resiliency, symmetry and linearity of a Boolean function. https:\/\/eprint.iacr.org\/2013\/232.pdf (2013). Accessed 26 Nov (2019)"},{"key":"2778_CR20","unstructured":"Chakraborty, K., Maitra, S.: Improved quantum test for linearity of a Boolean function. arXiv:1306.6195 (2013). Accessed 26 Nov (2019)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02778-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-020-02778-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02778-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T18:32:26Z","timestamp":1636482746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-020-02778-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":20,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["2778"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02778-3","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2020,7,30]]},"assertion":[{"value":"25 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"273"}}