{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:20:46Z","timestamp":1772274046963,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:00:00Z","timestamp":1637280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:00:00Z","timestamp":1637280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s11128-021-03322-7","type":"journal-article","created":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T05:02:25Z","timestamp":1637298145000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Evaluation of Grover\u2019s algorithm toward quantum cryptanalysis on ChaCha"],"prefix":"10.1007","volume":"20","author":[{"given":"Bhagwan","family":"Bathe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2158-6226","authenticated-orcid":false,"given":"Ravi","family":"Anand","sequence":"additional","affiliation":[]},{"given":"Suman","family":"Dutta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,19]]},"reference":[{"issue":"9","key":"3322_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02844-w","volume":"19","author":"R Anand","year":"2020","unstructured":"Anand, R., Maitra, A., Mukhopadhyay, S.: Grover on SIMON. Quantum Inf. Process. 19(9), 1\u201317 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02844-w","journal-title":"Quantum Inf. Process."},{"key":"3322_CR2","unstructured":"Anand, R., Maitra, A., Mukhopadhyay, S.: Evaluation of quantum cryptanalysis on SPECK. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) Progress in Cryptology INDOCRYPT 2020. LNCS, vol. 12578. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/ 978-3-030-65277-7_18"},{"key":"3322_CR3","unstructured":"Anand, R., Maitra, S., Maitra, A., Mukherjee, C.S., Mukhopadhyay, S.: Resource estimation of Grovers-kind quantum cryptanalysis against FSR based symmetric ciphers. Cryptology ePrint Archive, Report 2020\/1438, https:\/\/eprint.iacr.org\/2020\/1438 (2020)"},{"issue":"6","key":"3322_CR4","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013). https:\/\/doi.org\/10.1109\/TCAD.2013.2244643","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"3322_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71039-4_30","volume-title":"Fast Software Encryption. FSE 2008. Lecture Notes in Computer Science","author":"JP Aumasson","year":"2008","unstructured":"Aumasson, J.P., Fischer, S., Khazaei, S., Meier, W., Rechberger, C.: New features of Latin dances: analysis of Salsa, ChaCha, and Rumba. In: Nyberg, K. (ed.) Fast Software Encryption. FSE 2008. Lecture Notes in Computer Science, vol. 5086. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-71039-4_30"},{"key":"3322_CR6","unstructured":"Aumasson, J.P.: Too much crypto. IACR Cryptol. ePrint Arch., p.1492 (2019). https:\/\/eprint.iacr.org\/2019\/1492"},{"key":"3322_CR7","unstructured":"Bernstein, D.J.: ChaCha, a variant of Salsa20. In: Workshop Record of SASC, vol. 8, pp. 3\u20135 (2008)"},{"issue":"4\u20135","key":"3322_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik: Progress of Physics 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschritte der Physik: Progress of Physics"},{"key":"3322_CR9","unstructured":"Choudhuri, A., Maitra, S.: Differential cryptanalysis of salsa and ChaCha: An evaluation with a hybrid model. Cryptology ePrint Archive: Report 2016\/377, (2016)"},{"key":"3322_CR10","doi-asserted-by":"crossref","unstructured":"Davenport, J.H., Pring, B.: Improvements to quantum search techniques for block-ciphers, with applications to AES. In: Selected Areas in Cryptography-SAC (2020)","DOI":"10.1007\/978-3-030-81652-0_14"},{"key":"3322_CR11","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.dam.2017.04.034","volume":"227","author":"S Dey","year":"2017","unstructured":"Dey, S., Sarkar, S.: Improved analysis for reduced round Salsa and Chacha. Discrete Appl. Math. 227, 58\u201369 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.04.034","journal-title":"Discrete Appl. Math."},{"key":"3322_CR12","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M. and Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC. Advances in Cryptology\u2014EUROCRYPT 2020, volume 12106 of Lecture Notes in Computer Science, pp. 280\u2013310. Springer (2020)","DOI":"10.1007\/978-3-030-45724-2_10"},{"issue":"12","key":"3322_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2107-3","volume":"17","author":"P Kim","year":"2018","unstructured":"Kim, P., Han, D., Jeong, K.C.: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2. Quantum Inf. Process. 17(12), 1\u201339 (2018)","journal-title":"Quantum Inf. Process."},{"key":"3322_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.2965697","volume":"1","author":"B Langenberg","year":"2020","unstructured":"Langenberg, B., Pham, H., Steinwandt, R.: Reducing the cost of implementing the advanced encryption standard as a quantum circuit. IEEE Trans. Quantum Eng. 1, 1\u201312 (2020). https:\/\/doi.org\/10.1109\/TQE.2020.2965697","journal-title":"IEEE Trans. Quantum Eng."},{"key":"3322_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.dam.2016.02.020","volume":"208","author":"S Maitra","year":"2016","unstructured":"Maitra, S.: Chosen IV cryptanalysis on reduced round ChaCha and Salsa. Discrete Appl. Math. 208, 88\u201397 (2016)","journal-title":"Discrete Appl. Math."},{"key":"3322_CR16","unstructured":"Maitra, S., Paul, G., Meier, W.: Salsa20 cryptanalysis: new moves and revisiting old styles. In: The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Ga\u00ebtan Leurent, Maria Naya-Plasencia, Paris, France. ffhal-01276506f (2015)"},{"key":"3322_CR17","doi-asserted-by":"publisher","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying Grover\u2019s algorithm to AES: quantum resource estimates. In: Takagi, T. (ed.) Post-quantum Cryptography. PQCrypto. Lecture Notes in Computer Science, vol. 9606, pp. 29\u201343. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_3","DOI":"10.1007\/978-3-319-29360-8_3"},{"key":"3322_CR18","doi-asserted-by":"crossref","unstructured":"Ramos-Calderer, S., Bellini, E., Latorre, J.I., Manzano, M., Mateu, V.: Quantum search for scaled hash function preimages. arXiv preprint arXiv:2009.00621. (2020)","DOI":"10.1007\/s11128-021-03118-9"},{"key":"3322_CR19","doi-asserted-by":"crossref","unstructured":"Shi, Z., Zhang, B., Feng, D., Wu, W.: Improved key recovery attacks on reduced-round Salsa20 and ChaCha. In: Information Security and Cryptology\u2014ICISC, pp. 337\u2013351 (2012)","DOI":"10.1007\/978-3-642-37682-5_24"},{"issue":"9","key":"3322_CR20","first-page":"872","volume":"10","author":"Y Takahashi","year":"2010","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. Quantum Inf. Comput. 10(9), 872\u2013890 (2010)","journal-title":"Quantum Inf. Comput."},{"key":"3322_CR21","unstructured":"NIST. Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf"},{"issue":"1\u20132","key":"3322_CR22","first-page":"134","volume":"16","author":"N Wiebe","year":"2014","unstructured":"Wiebe, N., Roetteler, M.: Quantum arithmetic and numerical analysis using repeat-until-success circuits. Quantum Inf. Comput. 16(1\u20132), 134\u2013178 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"3322_CR23","unstructured":"https:\/\/github.com\/raviro\/chacha"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03322-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03322-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03322-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T07:16:57Z","timestamp":1638429417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03322-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,19]]},"references-count":23,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["3322"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03322-7","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,19]]},"assertion":[{"value":"25 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2021","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"394"}}