{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:42:17Z","timestamp":1742917337390,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030354220"},{"type":"electronic","value":"9783030354237"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35423-7_21","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"415-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Quantum Algorithms Related to Autocorrelation Spectrum"],"prefix":"10.1007","author":[{"given":"Debajyoti","family":"Bera","sequence":"first","affiliation":[]},{"given":"Subhamoy","family":"Maitra","sequence":"additional","affiliation":[]},{"given":"Sapv","family":"Tharrmashastha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"012331","DOI":"10.1103\/PhysRevA.100.012331","volume":"100","author":"D Bera","year":"2019","unstructured":"Bera, D., Tharrmashastha, P.V.: Error reduction of quantum algorithms. Phys. Rev. A 100, 012331 (2019)","journal-title":"Phys. Rev. A"},{"key":"21_CR2","unstructured":"Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for Simon\u2019s problem. In: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS 1997), Washington, DC, USA, p. 12. IEEE Computer Society (1997)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/BFb0053450","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"F Chabaud","year":"1995","unstructured":"Chabaud, F., Vaudenay, S.: Links between differential and linear cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356\u2013365. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053450"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-70697-9_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Chailloux","year":"2017","unstructured":"Chailloux, A., Naya-Plasencia, M., Schrottenloher, A.: An efficient quantum collision search algorithm and implications on symmetric cryptography. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 211\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_8"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. Ser. A 439, 553\u2013558 (1992)","journal-title":"Proc. R. Soc. Lond. Ser. A"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-29360-8_3","volume-title":"Post-Quantum Cryptography","author":"M Grassl","year":"2016","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying Grover\u2019s algorithm to AES: quantum resource estimates. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 29\u201343. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_3"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"LK Grover","year":"1998","unstructured":"Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80, 4329\u20134332 (1998)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1504\/IJWMC.2007.013798","volume":"2","author":"M Hell","year":"2007","unstructured":"Hell, M., Johansson, T., Meier, W.: Grain: a stream cipher for constrained environments. Int. J. Wirel. Mob. Comput. 2(1), 86\u201393 (2007)","journal-title":"Int. J. Wirel. Mob. Comput."},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53008-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Kaplan","year":"2016","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using quantum period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 207\u2013237. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.46586\/tosc.v2016.i1.71-94","volume":"2016","author":"M Kaplan","year":"2016","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Quantum differential and linear cryptanalysis. IACR Trans. Symmetric Cryptol. 2016(1), 71\u201394 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"21_CR11","series-title":"The Springer International Series in Engineering and Computer Science (Communications and Information Theory)","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4615-2694-0_23","volume-title":"Communications and Cryptography","author":"X Lai","year":"1994","unstructured":"Lai, X.: Higher order derivatives and differential cryptanalysis. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds.) Communications and Cryptography. The Springer International Series in Engineering and Computer Science (Communications and Information Theory), vol. 276, pp. 227\u2013233. Springer, Boston (1994). https:\/\/doi.org\/10.1007\/978-1-4615-2694-0_23"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-70697-9_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"G Leander","year":"2017","unstructured":"Leander, G., May, A.: Grover meets Simon \u2013 quantumly attacking the FX-construction. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 161\u2013178. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_6"},{"issue":"02","key":"21_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0219749905000980","volume":"03","author":"S Maitra","year":"2005","unstructured":"Maitra, S., Mukhopadhyay, P.: The Deutsch-Jozsa algorithm revisited in the domain of cryptographically significant Boolean functions. Int. J. Quantum Inf. 03(02), 359\u2013370 (2005)","journal-title":"Int. J. Quantum Inf."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-1-4615-2696-4_11","volume-title":"Theoretical Advances in Neural Computation and Learning","author":"Y Mansour","year":"1994","unstructured":"Mansour, Y.: Learning Boolean functions via the Fourier transform. In: Roychowdhury, V., Siu, K.Y., Orlitsky, A. (eds.) Theoretical Advances in Neural Computation and Learning, pp. 391\u2013424. Springer, Boston (1994). https:\/\/doi.org\/10.1007\/978-1-4615-2696-4_11"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10623-016-0211-x","volume":"82","author":"S Sarkar","year":"2017","unstructured":"Sarkar, S., Maitra, S., Baksi, A.: Observing biases in the state: case studies with Trivium and Trivia-SC. Des. Codes Crypt. 82(1), 351\u2013375 (2017)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C.E.: A mathematical theory of communication. SIGMOBILE Mob. Comput. Commun. Rev. 5(1), 3\u201355 (2001)","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1109\/TIT.2017.2769092","volume":"64","author":"D Tang","year":"2018","unstructured":"Tang, D., Maitra, S.: Construction of $$n$$-variable ($$n\\equiv 2 \\;mod \\;4$$) balanced Boolean functions with maximum absolute value in autocorrelation spectra $${<}2^{\\frac{n}{2}}$$. IEEE Trans. Inf. Theory 64(1), 393\u2013402 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"21_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s11128-018-1885-y","volume":"17","author":"Z Xie","year":"2018","unstructured":"Xie, Z., Qiu, D., Cai, G.: Quantum algorithms on Walsh transform and Hamming distance for Boolean functions. Quantum Inf. Process. 17(6), 139 (2018)","journal-title":"Quantum Inf. Process."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.113.210501","volume":"113","author":"TJ Yoder","year":"2014","unstructured":"Yoder, T.J., Low, G.H., Chuang, I.L.: Fixed-point quantum search with an optimal number of queries. Phys. Rev. Lett. 113, 210501 (2014)","journal-title":"Phys. Rev. Lett."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35423-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:46:20Z","timestamp":1709833580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35423-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030354220","9783030354237"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35423-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt2019\/#\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Please note that there were 110 submissions, but 20 were not peer-reviewed because they were withdrawn before the deadline or they violated the submission policy.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}