{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:53:37Z","timestamp":1742968417541,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031460760"},{"type":"electronic","value":"9783031460777"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46077-7_28","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T11:01:58Z","timestamp":1699268518000},"page":"423-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Computing Research Lines in\u00a0the\u00a0Italian Center for\u00a0Supercomputing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0840-6358","authenticated-orcid":false,"given":"Alessandro","family":"Barenghi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1253-8081","authenticated-orcid":false,"given":"Paolo","family":"Cremonesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3812-5429","authenticated-orcid":false,"given":"Gerardo","family":"Pelosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-030-64834-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Gheorghiu, V., Postlethwaite, E.W., Schanck, J.M.: Estimating quantum speedups for lattice sieves. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 583\u2013613. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_20"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-65277-7_18","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"R Anand","year":"2020","unstructured":"Anand, R., Maitra, A., Mukhopadhyay, S.: Evaluation of quantum cryptanalysis on SPECK. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 395\u2013413. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_18"},{"issue":"9","key":"28_CR3","doi-asserted-by":"publisher","first-page":"340","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), 340 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02844-w","journal-title":"Quantum Inf. Process."},{"key":"28_CR4","doi-asserted-by":"publisher","unstructured":"Antognazza, F., Barenghi, A., Pelosi, G., Susella, R.: A flexible ASIC-oriented design for a full NTRU accelerator. In: Takahashi, A. (ed.) Proceedings of the 28th Asia and South Pacific Design Automation Conference, ASPDAC 2023, Tokyo, Japan, January 16\u201319, 2023, pp. 591\u2013597. ACM (2023). https:\/\/doi.org\/10.1145\/3566097.3567916","DOI":"10.1145\/3566097.3567916"},{"key":"28_CR5","doi-asserted-by":"publisher","unstructured":"Antognazza, F., Barenghi, A., Pelosi, G., Susella, R.: An efficient unified architecture for polynomial multiplications in lattice-based cryptoschemes. In: Mori, P., Lenzini, G., Furnell, S. (eds.) Proceedings of the 9th International Conference on Information Systems Security and Privacy, ICISSP 2023, Lisbon, Portugal, February 22\u201324, 2023, pp. 81\u201388. SciTePress (2023). https:\/\/doi.org\/10.5220\/0011654200003405","DOI":"10.5220\/0011654200003405"},{"issue":"10","key":"28_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.3390\/a12100209","volume":"12","author":"M Baldi","year":"2019","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., Pelosi, G., Santini, P.: A finite regime analysis of information set decoding algorithms. Algorithms 12(10), 209 (2019). https:\/\/doi.org\/10.3390\/a12100209","journal-title":"Algorithms"},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Banegas, G., Bernstein, D.J., van Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 451\u2013472 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i1.451-472","DOI":"10.46586\/tches.v2021.i1.451-472"},{"key":"28_CR8","doi-asserted-by":"publisher","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the inherent intractability of certain coding problems (Corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055873","DOI":"10.1109\/TIT.1978.1055873"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-12929-2_6","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2010","unstructured":"Bernstein, D.J.: Grover vs.\u00a0McEliece. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 73\u201380. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_6"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1504\/IJACT.2012.045590","volume":"2","author":"JW Bos","year":"2012","unstructured":"Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. Appl. Cryptogr. 2(3), 212\u2013228 (2012). https:\/\/doi.org\/10.1504\/IJACT.2012.045590","journal-title":"Int. J. Appl. Cryptogr."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-030-45388-6_18","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"C Costello","year":"2020","unstructured":"Costello, C., Longa, P., Naehrig, M., Renes, J., Virdia, F.: Improved classical cryptanalysis of SIKE in practice. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 505\u2013534. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_18"},{"key":"28_CR12","doi-asserted-by":"publisher","unstructured":"Cross, A., Javadi-Abhari, A., Alexander, T., De Beaudrap, N., Bishop, L.S., Heidel, S., Ryan, C.A., Sivarajah, P., Smolin, J., Gambetta, J.M., Johnson, B.R.: OpenQASM 3: A Broader and Deeper Quantum Assembly Language. ACM Transactions on Quantum Computing 3(3) (sep 2022). https:\/\/doi.org\/10.1145\/3505636, https:\/\/doi.org\/10.1145\/3505636","DOI":"10.1145\/3505636"},{"key":"28_CR13","first-page":"1221","volume":"2018","author":"M Delcourt","year":"2018","unstructured":"Delcourt, M., Kleinjung, T., Lenstra, A.K., Nath, S., Page, D., Smart, N.P.: Using the cloud to determine key strengths - triennial update. IACR Cryptol. ePrint Arch. 2018, 1221 (2018)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"28_CR14","unstructured":"European Telecommunications Standards Institute (ETSI): Quantum-Safe Cryptography (2020). https:\/\/www.etsi.org\/technologies\/quantum-safe-cryptography"},{"key":"28_CR15","unstructured":"European Union - Directorate-General for Communication: NextGenerationEU (2022). https:\/\/next-generation-eu.europa.eu\/index_en"},{"key":"28_CR16","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 - Open J. Quantum Sci. 5(433), 10 (2021). https:\/\/doi.org\/10.22331\/q-2021-04-15-433","DOI":"10.22331\/q-2021-04-15-433"},{"key":"28_CR17","doi-asserted-by":"publisher","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, 22\u201324 May 1996, pp. 212\u2013219. ACM (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-44223-1_23","volume-title":"Post-Quantum Cryptography","author":"T H\u00e4ner","year":"2020","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roetteler, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_23"},{"key":"28_CR19","unstructured":"IBM: The IBM Quantum Development Roadmap (2022). https:\/\/www.ibm.com\/quantum\/roadmap"},{"key":"28_CR20","unstructured":"ICSC Foundation: High-Performance Computing, Big Data e Quantum Computing Research Centre (2022). https:\/\/www.supercomputing-icsc.it\/en\/icsc-home\/"},{"key":"28_CR21","unstructured":"ICSC Foundation: Spoke 0 - Cloud infrastructure for supercomputing (2022). https:\/\/www.supercomputing-icsc.it\/spoke-0-infrastruttura-cloud-di-supercalcolo\/"},{"key":"28_CR22","unstructured":"ICSC Foundation: Spoke 1 - Future HPC & Big Data (2022). https:\/\/www.supercomputing-icsc.it\/spoke-1-future-hpc-big-data\/"},{"key":"28_CR23","unstructured":"ICSC Foundation: Spoke 10 - Quantum Computing (2022). https:\/\/www.supercomputing-icsc.it\/spoke-10-quantum-computing\/"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-45724-2_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Jaques","year":"2020","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 280\u2013310. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_10"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-59879-6_5","volume-title":"Post-Quantum Cryptography","author":"G Kachigar","year":"2017","unstructured":"Kachigar, G., Tillich, J.-P.: Quantum information set decoding algorithms. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 69\u201389. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_5"},{"issue":"1","key":"28_CR26","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3474222","volume":"18","author":"N Khammassi","year":"2022","unstructured":"Khammassi, N., et al.: OpenQL: a portable quantum programming framework for quantum accelerators. ACM J. Emerg. Technol. Comput. Syst. 18(1), 13:1-13:24 (2022). https:\/\/doi.org\/10.1145\/3474222","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-319-79063-3_24","volume-title":"Post-Quantum Cryptography","author":"E Kirshanova","year":"2018","unstructured":"Kirshanova, E.: Improved quantum information set decoding. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 507\u2013527. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_24"},{"issue":"1","key":"28_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10586-010-0149-0","volume":"15","author":"T Kleinjung","year":"2012","unstructured":"Kleinjung, T., et al.: A heterogeneous computing environment to solve the 768-bit RSA challenge. Clust. Comput. 15(1), 53\u201368 (2012). https:\/\/doi.org\/10.1007\/s10586-010-0149-0","journal-title":"Clust. Comput."},{"key":"28_CR29","unstructured":"National Institute of Standards and Technology: Post-Quantum Cryptography Standardization process (2017). https:\/\/nist.gov\/pqcrypto"},{"key":"28_CR30","doi-asserted-by":"publisher","unstructured":"Perriello, S., Barenghi, A., Pelosi, G.: A complete quantum circuit to solve the information set decoding problem. In: M\u00fcller, H.A., Byrd, G., Culhane, C., Humble, T. (eds.) IEEE International Conference on Quantum Computing and Engineering, QCE 2021, Broomfield, CO, USA, 17\u201322 October 2021, pp. 366\u2013377. IEEE (2021). https:\/\/doi.org\/10.1109\/QCE52317.2021.00056","DOI":"10.1109\/QCE52317.2021.00056"},{"key":"28_CR31","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-030-90022-9_25","volume-title":"Security and Privacy in Communication Networks","author":"S Perriello","year":"2021","unstructured":"Perriello, S., Barenghi, A., Pelosi, G.: A quantum circuit to speed-up the cryptanalysis of code-based cryptosystems. In: Garcia-Alfaro, J., Li, S., Poovendran, R., Debar, H., Yung, M. (eds.) SecureComm 2021. LNICST, vol. 399, pp. 458\u2013474. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90022-9_25"},{"key":"28_CR32","unstructured":"Preskill, J.: Quantum computing and the entanglement frontier (2012)"},{"issue":"5","key":"28_CR33","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"issue":"2","key":"28_CR34","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). https:\/\/doi.org\/10.1137\/S0036144598347011","journal-title":"SIAM Rev."},{"key":"28_CR35","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1038\/nphys2258","volume":"8","author":"A Trabesinger","year":"2012","unstructured":"Trabesinger, A.: Quantum simulation. Nat. Phys. 8, 263\u2013263 (2012). https:\/\/doi.org\/10.1038\/nphys2258","journal-title":"Nat. Phys."},{"key":"28_CR36","unstructured":"Wro\u0144ski, M.: Solving discrete logarithm problem over prime fields using quantum annealing and $$\\frac{n^3}{2}$$ logical qubits. Cryptology ePrint Archive, Report 2021\/527 (2021). https:\/\/eprint.iacr.org\/2021\/527"},{"key":"28_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/978-3-030-64834-3_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"J Zou","year":"2020","unstructured":"Zou, J., Wei, Z., Sun, S., Liu, X., Wu, W.: Quantum circuit implementations of AES with fewer qubits. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 697\u2013726. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_24"}],"container-title":["Lecture Notes in Computer Science","Embedded Computer Systems: Architectures, Modeling, and Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46077-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T11:05:28Z","timestamp":1699268728000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46077-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031460760","9783031460777"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46077-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAMOS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Embedded Computer Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Samos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"samos2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/samos-conference.com\/wp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Softconf","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","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":"11","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":"7","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":"24% - 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":"4","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":"2","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)"}}]}}