{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:40:09Z","timestamp":1729006809045},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T00:00:00Z","timestamp":1716508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T00:00:00Z","timestamp":1716508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-024-00523-3","type":"journal-article","created":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T23:02:49Z","timestamp":1716591769000},"page":"725-728","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Searching linear structures of permutation groups with quantum computer"],"prefix":"10.1007","volume":"20","author":[{"given":"Mikhail","family":"Polyakov","sequence":"first","affiliation":[]},{"given":"Pyotr","family":"Kluycharev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,24]]},"reference":[{"issue":"5","key":"523_CR1","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P.: Polynomial time algorithms for prime factorization and discrete logarithm on quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"523_CR2","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"D Simon","year":"1994","unstructured":"Simon, D.: On the power of quantum computations. SIAM J. Comput. 26, 1474\u20131483 (1994)","journal-title":"SIAM J. Comput."},{"key":"523_CR3","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1070\/RM1997v052n06ABEH002155","volume":"51","author":"A Kitaev","year":"1997","unstructured":"Kitaev, A.: Quantum computations: algorithms and error correction. Russ. Math. Surv. 51, 1191\u20131249 (1997)","journal-title":"Russ. Math. Surv."},{"key":"523_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of 48th ACM STOC, pp. 684\u2013697 (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"523_CR5","doi-asserted-by":"crossref","unstructured":"Regev, O.: Quantum computation and lattice problems. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, pp. 520\u2013530 (2002)","DOI":"10.1109\/SFCS.2002.1181976"},{"key":"523_CR6","unstructured":"Roetteler, M., Beth, T.: Polynomial-time solution to hidden subgroup problem for a class of non-abelian groups. Quantum Phys. (1998)"},{"key":"523_CR7","unstructured":"Moore, C., Rockmore, D., Russel, A., Schulman, L.: The value of basis selection in Fourier sampling: hidden subgroup problem for a affine groups. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1113\u20131122 (2004)"},{"key":"523_CR8","doi-asserted-by":"crossref","unstructured":"Ivanos, G., Magniez, F., Santha, M.: Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. Int. K. Found. Comput. Sci. 14(5), 723\u2013740 (2003)","DOI":"10.1142\/S0129054103001996"},{"key":"523_CR9","unstructured":"Chaum, D., Evertse, J.H.: Cryptanalysis of DES with a reduce number of rounds sequences of linear factors in block ciphers. In: Crypto\u201985. Springer (1985)"},{"key":"523_CR10","unstructured":"Evertse, J.H.: Linear structures in block ciphers. In: EUROCRYPT\u201987. Springer (1987)"},{"key":"523_CR11","unstructured":"Meier, W., Staffelbach, O.: Nonlinearity criteria for cryptographic functions. In: EUROCRYPT\u201989. Springer (1989)"},{"key":"523_CR12","unstructured":"Varfolomeev, A., Zhukov, A., Melnikov, A., Ustuzhanin, D.: Block ciphers. General properties and cryptanalysis. In: MEPHI (1998)"},{"key":"523_CR13","unstructured":"Fulton, W., Harris, J.: Representation Theory: A First Course. Number 129 in Graduate Texts in Mathematics. Springer (1991)"},{"key":"523_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jsc.2015.11.016","volume":"75","author":"Y Kawano","year":"2016","unstructured":"Kawano, Y., Sekigawa, H.: Quantum Fourier transform over symmetric groups\u2014improved result. J. Symb. Comput. 75, 219\u2013243 (2016)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"523_CR15","first-page":"81","volume":"3","author":"B Pogorelov","year":"2012","unstructured":"Pogorelov, B., Pudovkina, M.: Factor structures of transformations. Math. Asp. Cryptogr. 3(3), 81\u2013104 (2012)","journal-title":"Math. Asp. Cryptogr."},{"issue":"138","key":"523_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1112\/jlms\/s1-35.2.184","volume":"35","author":"B Neumann","year":"1960","unstructured":"Neumann, B.: Embedding theorems for semigroups. J. Lond. Math. Soc. 35(138), 184\u2013192 (1960)","journal-title":"J. Lond. Math. Soc."},{"key":"523_CR17","doi-asserted-by":"crossref","unstructured":"Grigni, M., Schulman, L., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the non-abelian hidden subgroup problem. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, pp. 68\u201374 (2001)","DOI":"10.1145\/380752.380769"},{"key":"523_CR18","doi-asserted-by":"crossref","unstructured":"Moore, C., Russell, A., Schulman, L.: The symmetric group defies strong Fourier sampling. In: 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 479\u2013488 (2005)","DOI":"10.1109\/SFCS.2005.73"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00523-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-024-00523-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00523-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:12:05Z","timestamp":1729005125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-024-00523-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,24]]},"references-count":18,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,11]]}},"alternative-id":["523"],"URL":"https:\/\/doi.org\/10.1007\/s11416-024-00523-3","relation":{},"ISSN":["2263-8733"],"issn-type":[{"type":"electronic","value":"2263-8733"}],"subject":[],"published":{"date-parts":[[2024,5,24]]},"assertion":[{"value":"26 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}