{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:56:34Z","timestamp":1743108994747,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030129415"},{"type":"electronic","value":"9783030129422"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-12942-2_3","type":"book-chapter","created":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T08:26:50Z","timestamp":1549355210000},"page":"22-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Post-quantum Cryptography and a (Qu)Bit More"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9541-5705","authenticated-orcid":false,"given":"Diana","family":"Maimu\u0163","sequence":"first","affiliation":[]},{"given":"Emil","family":"Simion","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"key":"3_CR1","unstructured":"http:\/\/quantumbusiness.org\/secure-communications-in-the-post-quantum-era-conversation-with-jaya-baloo-from-kpn"},{"key":"3_CR2","unstructured":"https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"key":"3_CR3","unstructured":"BLISS. \n                    http:\/\/bliss.di.ens.fr\/"},{"key":"3_CR4","unstructured":"IBM Q Experience. \n                    https:\/\/quantumexperience.ng.bluemix.net\/qx\/experience"},{"key":"3_CR5","unstructured":"PQCrypto. \n                    https:\/\/cordis.europa.eu\/project\/rcn\/194347_en.html"},{"key":"3_CR6","unstructured":"SAFEcrypto. \n                    www.safecrypto.eu"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Ajtai, M.A.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing. STOC 1996, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Ajtai, M.A., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing. STOC 1997, pp. 284\u2013293. ACM (1997)","DOI":"10.1145\/258533.258604"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-319-78372-7_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"G Alagic","year":"2018","unstructured":"Alagic, G., Gagliardoni, T., Majenz, C.: Unforgeable quantum encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 489\u2013519. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-78372-7_16"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-56617-7_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"G Alagic","year":"2017","unstructured":"Alagic, G., Russell, A.: Quantum-secure symmetric-key cryptography based on hidden shifts. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 65\u201393. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-56617-7_3"},{"key":"3_CR11","volume-title":"Serious Cryptography: A Practical Introduction to Modern Encryption","author":"JP Aumasson","year":"2017","unstructured":"Aumasson, J.P.: Serious Cryptography: A Practical Introduction to Modern Encryption. No Starch Press, San Francisco (2017)"},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"2006","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (Corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-46800-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"DJ Bernstein","year":"2015","unstructured":"Bernstein, D.J., et al.: SPHINCS: practical stateless hash-based signatures. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 368\u2013397. Springer, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46800-5_15"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31\u201346. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88403-3_3"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88702-7_1","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Introduction to post-quantum Cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 1\u201314. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88702-7_1"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 11\u201320. ACM (1993)","DOI":"10.1145\/167088.167097"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-030-03326-2_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"X Bonnetain","year":"2018","unstructured":"Bonnetain, X., Naya-Plasencia, M.: Hidden shift quantum cryptanalysis and implications. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 560\u2013592. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-03326-2_19"},{"key":"3_CR19","unstructured":"Bruinderink, L.G., H\u00fclsing, A., Lange, T., Yarom, Y.: Flush, gauss, and reload - a cache attack on the BLISS lattice-based signature scheme (2016). \n                    https:\/\/eprint.iacr.org\/2016\/300"},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Springer, Heidelberg (2002). \n                    https:\/\/doi.org\/10.1007\/978-3-662-04722-4"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10623-014-0010-1","volume":"78","author":"C Delfs","year":"2016","unstructured":"Delfs, C., Galbraith, S.D.: Computing isogenies between supersingular elliptic curves over \n                    \n                      \n                    \n                    $$\\mathbb{F}_p$$\n                    \n                      \n                        \n                          F\n                          p\n                        \n                      \n                    \n                  . Des. Codes Crypt. 78(2), 425\u2013440 (2016)","journal-title":"Des. Codes Crypt."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-39799-X_24","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"H Fell","year":"1986","unstructured":"Fell, H., Diffie, W.: Analysis of a public key approach based on polynomial substitution. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 340\u2013349. Springer, Heidelberg (1986). \n                    https:\/\/doi.org\/10.1007\/3-540-39799-X_24"},{"key":"3_CR23","unstructured":"Feo, L.D., Jao, D., Pl\u00fbt, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. \n                    https:\/\/eprint.iacr.org\/2011\/506"},{"issue":"6\/7","key":"3_CR24","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6\/7), 467\u2013488 (1982)","journal-title":"Int. J. Theor. Phys."},{"key":"3_CR25","unstructured":"Gagliardoni, T.: Quantum security of cryptographic primitives. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (2017)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing - STOC 1996, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"3_CR28","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., \u00a0Naya-Plasencia, M.: Breaking symmetric cryptosystems using\u00a0quantum\u00a0period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 207\u2013237. Springer, Heidelberg (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8"},{"key":"3_CR29","first-page":"34","volume":"76","author":"D Maimu\u0163","year":"2018","unstructured":"Maimu\u0163, D.: Antifragilitatea: o nou\u0103 strategie \u00een securitatea informa\u0163iei. \u015etiin\u0163\u0103 & Tehnic\u0103 76, 34\u201335 (2018)","journal-title":"\u015etiin\u0163\u0103 & Tehnic\u0103"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201988","author":"T Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 419\u2013453. Springer, Heidelberg (1988). \n                    https:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"issue":"44","key":"3_CR31","first-page":"114","volume":"42","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(44), 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"key":"3_CR32","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems. Ph.D. thesis (1979)"},{"key":"3_CR33","volume-title":"Antifragile: Things That Gain from Disorder","author":"NT Nassim","year":"2012","unstructured":"Nassim, N.T.: Antifragile: Things That Gain from Disorder. Random House, New York City (2012)"},{"key":"3_CR34","unstructured":"Naya-Plasencia, M.: Symmetric cryptography for long-term security. Habilitation thesis, Pierre et Marie Curie Universit\u00e9 (2017)"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BFb0055731","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"P Nguyen","year":"1998","unstructured":"Nguyen, P., Stern, J.: Cryptanalysis of the ajtai-dwork cryptosystem. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 223\u2013242. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/BFb0055731"},{"key":"3_CR36","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, Cambridge (2011)","edition":"10"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). \n                    https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11818175_8","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"O Regev","year":"2006","unstructured":"Regev, O.: Lattice-based cryptography. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 131\u2013141. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11818175_8"},{"issue":"5","key":"3_CR39","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)","journal-title":"SIAM J. Comput."},{"key":"3_CR40","unstructured":"Simon, D.R.: On the power of quantum computation. In: FOCS 1994, pp. 116\u2013123. IEEE Computer Society (1994)"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12942-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:40:46Z","timestamp":1558478446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12942-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030129415","9783030129422"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12942-2_3","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":"6 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SECITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security for Information Technology and Communications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.secitc.eu\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - 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"}},{"value":"2.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Three papers of invited keynote speakers are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}