{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T05:27:13Z","timestamp":1773552433807,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T00:00:00Z","timestamp":1754438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T00:00:00Z","timestamp":1754438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Technologies for Countering Previously Unknown Quantum Cyber Threats","award":["FTS-2024-2.3-VY-1160-5744"],"award-info":[{"award-number":["FTS-2024-2.3-VY-1160-5744"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-025-00563-3","type":"journal-article","created":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T16:38:04Z","timestamp":1754498284000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Application of quantum fourier transform in cryptology"],"prefix":"10.1007","volume":"21","author":[{"given":"Alexey","family":"Petrenko","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Petrenko","sequence":"additional","affiliation":[]},{"given":"Konstantin","family":"Gnidko","sequence":"additional","affiliation":[]},{"given":"Kristina","family":"Popova","sequence":"additional","affiliation":[]},{"given":"Natalie","family":"Grigorieva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,6]]},"reference":[{"key":"563_CR1","unstructured":"Grover, L., & Rudolph, T.: Creating superpositions that correspond to efficiently integrable probability distributions. arXiv preprint, arXiv:quant-ph\/0208112. (2002)"},{"key":"563_CR2","unstructured":"Kitaev, A.Y.: Quantum Measurements and the Abelian Stabilizer Problem. arXiv preprint, arXiv:quant-ph\/9511026. (1995)"},{"key":"563_CR3","doi-asserted-by":"publisher","unstructured":"Steane, A.M.: Error correcting codes in quantum theory. Phys. Rev. Lett., 77, 793\u2013797. (1996). https:\/\/doi.org\/10.1103\/PhysRevLett.77.793","DOI":"10.1103\/PhysRevLett.77.793"},{"key":"563_CR4","doi-asserted-by":"publisher","unstructured":"Seifert, J.-P.: Using fewer qubits in Shor\u2019s factorization algorithm via simultaneous Diophantine approximation. In Topics in Cryptology \u2013 CT-RSA 2001, LNCS,  2020, 319\u2013327. Springer. (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_26","DOI":"10.1007\/3-540-45353-9_26"},{"key":"563_CR5","doi-asserted-by":"publisher","unstructured":"Harrow, A.W., Hassidim, A., & Lloyd, S.: Quantum Algorithm for Linear Systems of Equations. Phys. Rev. Lett., 103, 150502. (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"563_CR6","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett., 79, 325\u2013328. (1997). https:\/\/doi.org\/10.1103\/PhysRevLett.79.325","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"563_CR7","unstructured":"Petrenko, A.: Parametric Selection of Cryptographic Primitives for Blockchain Platforms. Athena Publishing. (2022). https:\/\/elibrary.ru\/item.asp?id=50043211"},{"key":"563_CR8","unstructured":"Petrenko, A.S., & Petrenko, S.A.: Method for assessing quantum resistance of blockchain platforms. Cybersecurity Issues, 3(49), 2\u201322. (2022)"},{"key":"563_CR9","unstructured":"Petrenko, A.S., Petrenko, S.A., & Taran, V.N.: Universal quantum gate as a tool for modeling quantum cryptanalysis algorithms. CEUR Workshop Proc., Series AISMA 2021, pp. 143\u2013150. (2022)"},{"key":"563_CR10","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. arXiv preprint, arXiv:quant-ph\/0201067v1. (2002). https:\/\/arxiv.org\/abs\/quant-ph\/0201067"},{"key":"563_CR11","unstructured":"Crandall, R., & Pomerance, C.: Prime Numbers: A Computational Perspective (2nd ed.). Springer, New York. ISBN: 978-0387252827. (2005)"},{"key":"563_CR12","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 124\u2013134. (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"563_CR13","doi-asserted-by":"publisher","unstructured":"Eker\u00e5, M., & H\u00e5stad, J.: Quantum algorithms for computing short discrete logarithms and factoring RSA integers. Lecture Notes in Computer Science, 10346, 347\u2013363. (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_20","DOI":"10.1007\/978-3-319-59879-6_20"},{"key":"563_CR14","doi-asserted-by":"publisher","unstructured":"Gama, N., & Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. Proc. 40th ACM Symposium on Theory of Computing (STOC), pp. 207\u2013216. (2008). https:\/\/doi.org\/10.1145\/1374376.1374406","DOI":"10.1145\/1374376.1374406"},{"key":"563_CR15","unstructured":"Nielsen, M.A., & Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press. ISBN: 978-1107002173. (2000)"},{"key":"563_CR16","doi-asserted-by":"publisher","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., & Cleland, A.N.: Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A, 86, 032324. (2012). https:\/\/doi.org\/10.1103\/PhysRevA.86.032324","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"563_CR17","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6), 34. (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"563_CR18","doi-asserted-by":"publisher","unstructured":"Cleve, R., & Watrous, J.: Fast parallel circuits for the quantum Fourier transform. Proc. 41st Annual FOCS, IEEE, pp. 526\u2013536. (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892140","DOI":"10.1109\/SFCS.2000.892140"},{"key":"563_CR19","unstructured":"Boev, S.F., Petrenko, A.S., Petrenko, S.A., & Stupin, D.D.: Quantum cryptanalysis of cryptoschemes of blockchain platforms. Proc. MVUS-2022 Conference, Taganrog, SFedU, pp. 12\u201320. (2022)"},{"key":"563_CR20","unstructured":"Gottesman, D.: The Heisenberg Representation of Quantum Computers. arXiv preprint, arXiv:quant-ph\/9807006. (1998)"},{"key":"563_CR21","doi-asserted-by":"publisher","unstructured":"Gidney, C., & Eker\u00e5, M.: How to factor 2048-bit RSA integers in 8 hours using 20 million noisy qubits. Quantum, 5, 433. (2021). https:\/\/doi.org\/10.22331\/q-2021-04-15-433","DOI":"10.22331\/q-2021-04-15-433"},{"key":"563_CR22","doi-asserted-by":"publisher","unstructured":"Harvey, D., & van der Hoeven, J.: Integer multiplication in time O(n log n). Annals of Mathematics, 193, 563\u2013617. (2021). https:\/\/doi.org\/10.4007\/annals.2021.193.2.6","DOI":"10.4007\/annals.2021.193.2.6"},{"key":"563_CR23","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 41(2), 303\u2013332. (1999). https:\/\/doi.org\/10.1137\/S0036144598347011","DOI":"10.1137\/S0036144598347011"},{"key":"563_CR24","unstructured":"Petrenko, A.: Applied Quantum Cryptanalysis. River Publishers. ISBN: 978-87-7022-299-4. (2023)"},{"key":"563_CR25","doi-asserted-by":"crossref","unstructured":"Petrenko, A.S., & Petrenko, S.A.: Basic algorithms of quantum cryptanalysis. Cybersecurity Issues, 1(53), 100\u2013115. (2023)","DOI":"10.21681\/2311-3456-2023-1-100-115"},{"key":"563_CR26","doi-asserted-by":"publisher","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, 296, 625\u2013635. (1993). https:\/\/doi.org\/10.1007\/BF01445125","DOI":"10.1007\/BF01445125"},{"key":"563_CR27","unstructured":"Petrenko, A.: Quantum-Resistant Blockchain: Scientific Monograph. Piter, St. Petersburg. ISBN: 978-5-4461-1920-1. (2023)"},{"key":"563_CR28","doi-asserted-by":"publisher","unstructured":"Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D.A.: Exponential algorithmic speedup by a quantum walk. Proc. 35th ACM Symposium on Theory of Computing (STOC), pp. 59\u201368. (2003). https:\/\/doi.org\/10.1145\/780542.780552","DOI":"10.1145\/780542.780552"},{"key":"563_CR29","doi-asserted-by":"publisher","unstructured":"Abrams, D.S., & Lloyd, S.: Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors. Phys. Rev. Lett., 83, 5162\u20135165. (1999). https:\/\/doi.org\/10.1103\/PhysRevLett.83.5162","DOI":"10.1103\/PhysRevLett.83.5162"},{"key":"563_CR30","unstructured":"Petrenko, A.: Quantum Threat to Blockchain Technology: Educational and Methodological Manual. Athena Publishing. (2022).https:\/\/elibrary.ru\/item.asp?id=50043242"},{"key":"563_CR31","unstructured":"Petrenko, A.S., Petrenko, S.A., & Buchneva, A.A.: Innovative platform for quantum cryptanalysis of well-known cryptographic primitives in blockchain. Information Protection. Insight, 2(110), 58. (2023)"},{"key":"563_CR32","doi-asserted-by":"publisher","unstructured":"Pomerance, C.: The expected number of random elements to generate a finite abelian group. Period. Math. Hungar., 43, 191\u2013198. 2021. https:\/\/doi.org\/10.1023\/A:1013779624625","DOI":"10.1023\/A:1013779624625"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-025-00563-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-025-00563-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-025-00563-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T17:20:22Z","timestamp":1764004822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-025-00563-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,6]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s11416-025-00563-3","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,6]]},"assertion":[{"value":"29 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2025","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"26"}}