{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:04Z","timestamp":1750221244914,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,15]],"date-time":"2018-07-15T00:00:00Z","timestamp":1531612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EU","award":["644729"],"award-info":[{"award-number":["644729"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,15]]},"DOI":"10.1145\/3229631.3264737","type":"proceedings-article","created":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T13:15:25Z","timestamp":1547471725000},"page":"173-178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum era challenges for classical computers"],"prefix":"10.1145","author":[{"given":"Francesco","family":"Regazzoni","sequence":"first","affiliation":[{"name":"ALaRI - USI, Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Austin","family":"Fowler","sequence":"additional","affiliation":[{"name":"Google Inc."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilia","family":"Polian","sequence":"additional","affiliation":[{"name":"University of Stuttgart"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/367701.367709"},{"key":"e_1_3_2_1_2_1","first-page":"19","volume-title":"Advanced encryption standard,\" Proceedings of Federal Information Processing Standards Publications","author":"Rijmen V.","year":"2001","unstructured":"V. Rijmen and J. Daemen , \" Advanced encryption standard,\" Proceedings of Federal Information Processing Standards Publications , National Institute of Standards and Technology , pp. 19 -- 22 , 2001 . V. Rijmen and J. Daemen, \"Advanced encryption standard,\" Proceedings of Federal Information Processing Standards Publications, National Institute of Standards and Technology, pp. 19--22, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29360-8_3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_5_1","unstructured":"National Security Agency \"Commercial national security algorithm suite \" August 2015. {Online}. Available: https:\/\/www.iad.gov\/iad\/programs\/iad-initiatives\/cnsa-suite.cfm  National Security Agency \"Commercial national security algorithm suite \" August 2015. {Online}. Available: https:\/\/www.iad.gov\/iad\/programs\/iad-initiatives\/cnsa-suite.cfm"},{"key":"e_1_3_2_1_6_1","volume-title":"Post-quantum cryptography. {Online}. Available: https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions","author":"NIST.","year":"2018","unstructured":"NIST. ( 2018 ) Post-quantum cryptography. {Online}. Available: https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions NIST. (2018) Post-quantum cryptography. {Online}. Available: https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions"},{"key":"e_1_3_2_1_7_1","unstructured":"NIST \"Post-quantum crypto project \" http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/ 2016.  NIST \"Post-quantum crypto project \" http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/ 2016."},{"volume-title":"ISA 2011, Brno, Czech Republic, August 15--17, 2011. Proceedings","author":"Cayrel P.-L.","key":"e_1_3_2_1_8_1","unstructured":"P.-L. Cayrel , S. M. El Yousfi Alaoui, G. Hoffmann, M. Meziani, and R. Niebuhr , ISA 2011, Brno, Czech Republic, August 15--17, 2011. Proceedings . Berlin, Heidelberg : Springer Berlin Heidelberg, 2011, ch. Recent Progress in Code-Based Cryptography, pp. 21--32. P.-L. Cayrel, S. M. El Yousfi Alaoui, G. Hoffmann, M. Meziani, and R. Niebuhr, ISA 2011, Brno, Czech Republic, August 15--17, 2011. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, ch. Recent Progress in Code-Based Cryptography, pp. 21--32."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.07.007"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_12_1","first-page":"120","volume-title":"2017 International Conference on. IEEE","author":"Homsirikamol E.","year":"2017","unstructured":"E. Homsirikamol and K. Gaj , \" Toward a new hls-based methodology for fpga benchmarking of candidates in cryptographic competitions: The caesar contest case study,\" in Field Programmable Technology (ICFPT) , 2017 International Conference on. IEEE , 2017 , pp. 120 -- 127 . E. Homsirikamol and K. Gaj, \"Toward a new hls-based methodology for fpga benchmarking of candidates in cryptographic competitions: The caesar contest case study,\" in Field Programmable Technology (ICFPT), 2017 International Conference on. IEEE, 2017, pp. 120--127."},{"key":"e_1_3_2_1_13_1","first-page":"398","volume-title":"Differential power analysis,\" M","author":"Kocher P.","year":"1999","unstructured":"P. Kocher , J. Jaffe , and B. Jun , \" Differential power analysis,\" M . Wiener, Ed. Berlin : Springer , Aug. 1999 , vol. 1666 , pp. 398 -- 412 . P.Kocher, J. Jaffe, and B. Jun, \"Differential power analysis,\" M. Wiener, Ed. Berlin: Springer, Aug. 1999, vol. 1666, pp. 398--412."},{"key":"e_1_3_2_1_14_1","first-page":"104","volume-title":"Ed","author":"Kocher P. C.","year":"1996","unstructured":"P. C. Kocher , \" Timing attacks on implementations of Diffie-Hellman , RSA , DSS, and other systems,\" N. I. Koblitz , Ed . Berlin : Springer , Sep. 1996 , vol. 1109 , pp. 104 -- 113 . P. C. Kocher, \"Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems,\" N. I. Koblitz, Ed. Berlin: Springer, Sep. 1996, vol. 1109, pp. 104 -- 13."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010016"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1004593"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935308_38"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04138-9_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1190590"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i1.142-174"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29360-8_15"},{"key":"e_1_3_2_1_22_1","article-title":"On Practical Discrete Gaussian Samplers For Lattice-Based Cryptography","author":"Howe J.","year":"2016","unstructured":"J. Howe , A. Khalid , C. Rafferty , F. Regazzoni , and M. O'Neill , \" On Practical Discrete Gaussian Samplers For Lattice-Based Cryptography ,\" IEEE Transactions on Computers , 2016 . J. Howe, A. Khalid, C. Rafferty, F. Regazzoni, and M. O'Neill, \"On Practical Discrete Gaussian Samplers For Lattice-Based Cryptography,\" IEEE Transactions on Computers, 2016.","journal-title":"IEEE Transactions on Computers"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178291.3178294"},{"key":"e_1_3_2_1_24_1","first-page":"63","volume-title":"2016 Workshop on. IEEE","author":"Bindel N.","year":"2016","unstructured":"N. Bindel , J. Buchmann , and J. Kr\u00e4mer , \" Lattice-based signature schemes and their sensitivity to fault attacks,\" in Fault Diagnosis and Tolerance in Cryptography (FDTC) , 2016 Workshop on. IEEE , 2016 , pp. 63 -- 77 . N. Bindel, J. Buchmann, and J. Kr\u00e4mer, \"Lattice-based signature schemes and their sensitivity to fault attacks,\" in Fault Diagnosis and Tolerance in Cryptography (FDTC), 2016 Workshop on. IEEE, 2016, pp. 63--77."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"e_1_3_2_1_26_1","volume-title":"New Methods of Concurrent Checking","author":"Goessel M.","year":"2008","unstructured":"M. Goessel , V. Ocheretny , E. Sogomonyan , and D. Marienfeld , New Methods of Concurrent Checking . Springer , 2008 . M. Goessel, V. Ocheretny, E. Sogomonyan, and D. Marienfeld, New Methods of Concurrent Checking. Springer, 2008."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/9\/6\/199"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258579"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1997v052n06ABEH002155"},{"key":"e_1_3_2_1_31_1","first-page":"9610011","article-title":"Accuracy threshold for quantum computation","volume":"96","author":"Knill E.","year":"1996","unstructured":"E. Knill , R. Laflamme , and W. H. Zurek , \" Accuracy threshold for quantum computation ,\" Los Alamos National Laboratory, Tech. Rep. LAUR- 96-2199 , 1996 , quant-ph\/ 9610011 . E. Knill, R. Laflamme, and W. H. Zurek, \"Accuracy threshold for quantum computation,\" Los Alamos National Laboratory, Tech. Rep. LAUR-96-2199, 1996, quant-ph\/9610011.","journal-title":"Los Alamos National Laboratory, Tech. Rep. LAUR-"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature14270"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep04657"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2747921"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/3179330.3179331"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-10657-8"},{"key":"e_1_3_2_1_37_1","volume-title":"trees, and flowers,\" Canadian Jor. Math","author":"Edmonds J.","year":"1965","unstructured":"J. Edmonds , \"Paths , trees, and flowers,\" Canadian Jor. Math ., 1965 . J. Edmonds, \"Paths, trees, and flowers,\" Canadian Jor. Math., 1965."},{"issue":"1","key":"e_1_3_2_1_38_1","first-page":"2","article-title":"Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time","volume":"15","author":"Fowler A. G.","year":"2015","unstructured":"A. G. Fowler , \" Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time ,\" Quantum Information & Computation , vol. 15 , no. 1 -- 2 , pp. 145--158, 2015 . A. G. Fowler, \"Minimum weight perfect matching of fault-tolerant topological quantum error correction in average O(1) parallel time,\" Quantum Information & Computation, vol. 15, no. 1--2, pp. 145--158, 2015.","journal-title":"Quantum Information & Computation"},{"key":"e_1_3_2_1_39_1","first-page":"143","volume-title":"Online Algorithms","author":"Albers S.","year":"2006","unstructured":"S. Albers , Online Algorithms . Berlin, Heidelberg : Springer Berlin Heidelberg , 2006 , pp. 143 -- 164 . {Online}. Available S. Albers, Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 143--164. {Online}. Available"}],"event":{"name":"SAMOS XVIII: Architectures, Modeling, and Simulation","acronym":"SAMOS XVIII","location":"Pythagorion Greece"},"container-title":["Proceedings of the 18th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3229631.3264737","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3229631.3264737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:38Z","timestamp":1750212458000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3229631.3264737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,15]]},"references-count":39,"alternative-id":["10.1145\/3229631.3264737","10.1145\/3229631"],"URL":"https:\/\/doi.org\/10.1145\/3229631.3264737","relation":{},"subject":[],"published":{"date-parts":[[2018,7,15]]},"assertion":[{"value":"2018-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}