{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T17:37:59Z","timestamp":1790789879973,"version":"4.1.0"},"publisher-location":"Cham","reference-count":190,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030755386","type":"print"},{"value":"9783030755393","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75539-3_19","type":"book-chapter","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T23:36:24Z","timestamp":1620689784000},"page":"444-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["SoK: How (not) to Design and Implement Post-quantum Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6498-3099","authenticated-orcid":false,"given":"James","family":"Howe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1445-6212","authenticated-orcid":false,"given":"Thomas","family":"Prest","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Apon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"19_CR1","unstructured":"Aguilar, C., Gaborit, P., Lacharme, P., Schrek, J., Zemor, G.: Noisy Diffie-Hellman protocols. Rump session of PQCrypto (2010). https:\/\/www.yumpu.com\/en\/document\/view\/53051354\/noisy-diffie-hellman-protocols"},{"key":"19_CR2","unstructured":"Melchor, C.A., et al.: HQC. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, May 1996. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: 29th ACM STOC, pp. 284\u2013293. ACM Press, May 1997. https:\/\/doi.org\/10.1145\/258533.258604","DOI":"10.1145\/258533.258604"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: status report on the second round of the NIST post-quantum cryptography standardization process. Technical report, NIST (2020)","DOI":"10.6028\/NIST.IR.8240"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Deo, A., Paterson, K.G.: Cold boot attacks on ring and module LWE keys under the NTT. IACR TCHES 2018(3), 173\u2013213 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i3.173-213. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7273. ISSN 2569\u20132925","DOI":"10.13154\/tches.v2018.i3.173-213"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). http:\/\/www.degruyter.com\/view\/j\/jmc.2015.9.issue-3\/jmc-2015-0016\/jmc-2015-0016.xml","DOI":"10.1515\/jmc-2015-0016"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., et al.: Estimate all the LWE, NTRU schemes!. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 351\u2013367. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_19","DOI":"10.1007\/978-3-319-98113-0_19"},{"key":"19_CR10","unstructured":"Apon, D., Howe, J.: Attacks on NIST PQC 3rd round candidates. In: IACR Real World Crypto Symposium, January 2021. https:\/\/iacr.org\/submit\/files\/slides\/2021\/rwc\/rwc2021\/22\/slides.pdf"},{"key":"19_CR11","unstructured":"Aragon, N., et al.: BIKE. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Orlandi, C., Takahashi, A., Zaverucha, G.: Security of Hedged Fiat-Shamir signatures under fault attacks. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 644\u2013674. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_23","DOI":"10.1007\/978-3-030-45721-1_23"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Aumasson, J.-P., Endignoux, G.: Improving stateless hash-based signatures. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 219\u2013242. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_12","DOI":"10.1007\/978-3-319-76953-0_12"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Backendal, M., Bellare, M., Sorrell, J., Sun, J.: The Fiat-Shamir Zoo: relating the security of different signature variants. In: Gruschka, N. (ed.) NordSec 2018. LNCS, vol. 11252, pp. 154\u2013170. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03638-6_10","DOI":"10.1007\/978-3-030-03638-6_10"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Bai, S., Galbraith, S.D.: An improved compression technique for signatures based on learning with errors. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 28\u201347. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_2","DOI":"10.1007\/978-3-319-04852-9_2"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s00145-016-9233-9","volume":"30","author":"B Barak","year":"2017","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle\u2019s key agreement protocol is optimal: an $$O(n^2)$$ attack on any key agreement from random oracles. J. Cryptol. 30(3), 699\u2013734 (2017). https:\/\/doi.org\/10.1007\/s00145-016-9233-9","journal-title":"J. Cryptol."},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Barthe, G., Bela\u00efd, S., Espitau, T., Fouque, P.-A., Rossi, M., Tibouchi, M.: GALACTICS: Gaussian sampling for lattice-based constant-time implementation of cryptographic signatures, revisited. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS, pp. 2147\u20132164. ACM Press, November 2019. https:\/\/doi.org\/10.1145\/3319535.3363223","DOI":"10.1145\/3319535.3363223"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Barthe, G., et al.: Masking the GLP lattice-based signature scheme at any order. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 354\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_12","DOI":"10.1007\/978-3-319-78375-8_12"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Baum, C., Nof, A.: Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 495\u2013526. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_17","DOI":"10.1007\/978-3-030-45374-9_17"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Baum, C., de Saint Guilhem, C.D., Kales, D., Orsini, E., Scholl, P., Zaverucha, G.: Banquet: short and fast signatures from AES. PKC (2021). https:\/\/eprint.iacr.org\/2021\/068","DOI":"10.1007\/978-3-030-75245-3_11"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R., (ed.) SODA, pp. 10\u201324. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2. https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2 10.1137\/1.9781611974331.ch2"},{"key":"19_CR22","unstructured":"Van Beirendonck, M., D\u2019Anvers, J.-P., Karmakar, A., Balasch, J., Verbauwhede, I.: A side-channel resistant implementation of SABER. Cryptology ePrint Archive, Report 2020\/733 (2020). https:\/\/eprint.iacr.org\/2020\/733"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th FOCS, pp. 374\u2013383. IEEE Computer Society Press, October 1997. https:\/\/doi.org\/10.1109\/SFCS.1997.646126","DOI":"10.1109\/SFCS.1997.646126"},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS, vol. 93, pp. 62\u201373. ACM Press, November 1993. https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and Rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_34","DOI":"10.1007\/3-540-68339-9_34"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7","DOI":"10.1007\/978-3-540-88702-7"},{"key":"19_CR27","unstructured":"Bernstein, D.J., Yang, B.-Y.: Asymptotically faster quantum algorithms to solve multivariate quadratic equations. Cryptology ePrint Archive, Report 2017\/1206 (2017). https:\/\/eprint.iacr.org\/2017\/1206"},{"key":"19_CR28","unstructured":"Bernstein, D.J., et al.: Classic McEliece. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR29","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., van Vredendaal, C.: NTRU Prime. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR30","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_15","DOI":"10.1007\/978-3-662-46800-5_15"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The SPHINCS$$^+$$ signature framework. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (ed.) ACM CCS, pp. 2129\u20132146. ACM Press, November 2019. https:\/\/doi.org\/10.1145\/3319535.3363229","DOI":"10.1145\/3319535.3363229"},{"key":"19_CR32","doi-asserted-by":"publisher","unstructured":"Bert, P., Fouque, P.-A., Roux-Langlois, A., Sabt, M.: Practical implementation of ring-SIS\/LWE based signature and IBE. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 271\u2013291. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_13","DOI":"10.1007\/978-3-319-79063-3_13"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Solving polynomial systems over finite fields: improved analysis of the hybrid approach. In: ISSAC, pp. 67\u201374. ACM (2012)","DOI":"10.1145\/2442829.2442843"},{"key":"19_CR34","doi-asserted-by":"publisher","unstructured":"Beullens, W.: Sigma protocols for MQ, PKP and SIS, and Fishy signature schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 183\u2013211. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_7","DOI":"10.1007\/978-3-030-45727-3_7"},{"key":"19_CR35","doi-asserted-by":"publisher","unstructured":"Beullens, W., Delpech de Saint Guilhem, C.: LegRoast: efficient post-quantum signatures from the Legendre PRF. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 130\u2013150. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_8","DOI":"10.1007\/978-3-030-44223-1_8"},{"key":"19_CR36","doi-asserted-by":"publisher","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9","DOI":"10.1007\/978-3-030-34578-5_9"},{"key":"19_CR37","doi-asserted-by":"publisher","unstructured":"Beullens, W., Preneel, B., Szepieniec, A.: Public key compression for constrained linear signature schemes. In: Cid, C., Jacobson Jr., M.J. (eds.) SAC. LNCS, vol. 11349, pp. 300\u2013321. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_14","DOI":"10.1007\/978-3-030-10970-7_14"},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Beullens, W., Faug\u00e8re, J.-C., Koussa, E., Macario-Rat, G., Patarin, J., Perret, L.: PKP-based signature scheme. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 3\u201322. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_1","DOI":"10.1007\/978-3-030-35423-7_1"},{"key":"19_CR39","unstructured":"Bindel, N., et al.: qTESLA. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR40","doi-asserted-by":"publisher","unstructured":"Bonnetain, X., Schrottenloher, A.: Quantum security analysis of CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 493\u2013522. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_17","DOI":"10.1007\/978-3-030-45724-2_17"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Bos, J.W., Friedberger, S., Martinoli, M., Oswald, E., Stam, M.: Assessing the feasibility of single trace power analysis of Frodo. In: Cid, C., Jacobson Jr., M.J. (eds.) SAC. LNCS, vol. 11349, pp. 216\u2013234. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_10","DOI":"10.1007\/978-3-030-10970-7_10"},{"key":"19_CR42","doi-asserted-by":"publisher","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 25\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_2","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"19_CR43","doi-asserted-by":"publisher","unstructured":"Bruinderink, L.G., Pessl, P.: Differential fault attacks on deterministic lattice signatures. IACR TCHES 2018(3), 21\u201343 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i3.21-43. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7267. ISSN 2569\u20132925","DOI":"10.13154\/tches.v2018.i3.21-43"},{"key":"19_CR44","doi-asserted-by":"publisher","unstructured":"Groot Bruinderink, L., H\u00fclsing, A., Lange, T., Yarom, Y.: Flush, gauss, and reload - a cache attack on the BLISS lattice-based signature scheme. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 323\u2013345. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_16","DOI":"10.1007\/978-3-662-53140-2_16"},{"key":"19_CR45","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-21969-6_23","volume-title":"AFRICACRYPT 11","author":"J Buchmann","year":"2011","unstructured":"Buchmann, J., Dahmen, E., Ereth, S., H\u00fclsing, A., R\u00fcckert, M.: On the security of the Winternitz one-time signature scheme. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 11. LNCS, vol. 6737, pp. 363\u2013378. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21969-6_23"},{"key":"19_CR46","unstructured":"Casanova, A., Faug\u00e8re, J.-C., Macario-Rat, G., Patarin, J., Perret, L., Ryckeghem, J.: GeMSS. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR47","doi-asserted-by":"publisher","unstructured":"Castelnovi, L., Martinelli, A., Prest, T.: Grafting trees: a fault attack against the SPHINCS framework. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 165\u2013184. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_8","DOI":"10.1007\/978-3-319-79063-3_8"},{"key":"19_CR48","doi-asserted-by":"publisher","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Cayrel, P.-L., Colombier, B., Dragoi, V.-F., Menu, A., Bossuet, L.: Message-recovery laser fault injection attack on the classic Mceliece cryptosystem. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77886-6_15"},{"key":"19_CR50","doi-asserted-by":"publisher","unstructured":"Chailloux, A., Debris-Alazard, T.: Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 453\u2013479. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_16","DOI":"10.1007\/978-3-030-45388-6_16"},{"key":"19_CR51","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-70697-9_8"},{"key":"19_CR52","doi-asserted-by":"publisher","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS, pp. 1825\u20131842. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3133997","DOI":"10.1145\/3133956.3133997"},{"key":"19_CR53","doi-asserted-by":"publisher","unstructured":"Chen, M.-S., H\u00fclsing, A., Rijneveld, J., Samardjiska, S., Schwabe, P.: From 5-Pass $$\\cal{MQ}$$-based identification to $$\\cal{MQ}$$-based signatures. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 135\u2013165. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_5","DOI":"10.1007\/978-3-662-53890-6_5"},{"key":"19_CR54","doi-asserted-by":"publisher","unstructured":"Chen, Y., Genise, N., Mukherjee, P.: Approximate trapdoors for lattices and smaller hash-and-sign signatures. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_1","DOI":"10.1007\/978-3-030-34618-8_1"},{"key":"19_CR55","unstructured":"Chung, C.-M.M., Hwang, V., Kannwischer, M.J., G., Seiler, M.J., Shih, C.-J., Yang, B.-Y.: NTT multiplication for NTT-unfriendly rings. Cryptology ePrint Archive, Report 2020\/1397 (2020). https:\/\/eprint.iacr.org\/2020\/1397"},{"key":"19_CR56","doi-asserted-by":"publisher","unstructured":"Cooper, D., Apon, D., Dang, Q., Davidson, M., Dworkin, M., Miller, C.: Recommendation for stateful hash-based signature schemes (2020). https:\/\/doi.org\/10.6028\/NIST.SP.800-208","DOI":"10.6028\/NIST.SP.800-208"},{"issue":"4","key":"19_CR57","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997). https:\/\/doi.org\/10.1007\/s001459900030","journal-title":"J. Cryptol."},{"key":"19_CR58","doi-asserted-by":"publisher","unstructured":"Coron, J.-S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229\u2013235. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_14","DOI":"10.1007\/3-540-44598-6_14"},{"key":"19_CR59","doi-asserted-by":"publisher","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10","DOI":"10.1007\/3-540-45682-1_10"},{"key":"19_CR60","doi-asserted-by":"publisher","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392\u2013407. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_27","DOI":"10.1007\/3-540-45539-6_27"},{"key":"19_CR61","unstructured":"Couveignes, J.-M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006). http:\/\/eprint.iacr.org\/2006\/291"},{"key":"19_CR62","doi-asserted-by":"publisher","unstructured":"Dachman-Soled, D., Ducas, L., Gong, H., Rossi, M.: LWE with side information: attacks and concrete security estimation. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 329\u2013358. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_12","DOI":"10.1007\/978-3-030-56880-1_12"},{"key":"19_CR63","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I.B.: On the randomness of Legendre and Jacobi sequences. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 163\u2013172. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_13","DOI":"10.1007\/0-387-34799-2_13"},{"key":"19_CR64","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J.-P., Rossi, M., Virdia, F.: (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 3\u201333. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_1","DOI":"10.1007\/978-3-030-45727-3_1"},{"key":"19_CR65","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J.-P., Vercauteren, F., Verbauwhede, I.: The impact of error dependencies on ring\/Mod-LWE\/LWR based schemes. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 103\u2013115. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_6","DOI":"10.1007\/978-3-030-25510-7_6"},{"key":"19_CR66","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J.-P., Guo, Q., Johansson, T., Nilsson, A., Vercauteren, F., Verbauwhede, I.: Decryption failure attacks on IND-CCA secure lattice-based schemes. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 565\u2013598. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_19","DOI":"10.1007\/978-3-030-17259-6_19"},{"key":"19_CR67","unstructured":"D\u2019Anvers, J.-P., Karmakar, A., Roy, S.S., Vercauteren, F.: SABER. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR68","doi-asserted-by":"publisher","unstructured":"D\u2019Anvers, J.-P., Tiepelt, M., Vercauteren, F., Verbauwhede, I.: Timing attacks on error correcting codes in post-quantum schemes. In: Bilgin, B., Petkova-Nikova, S., Rijmen, V. (eds.) TIS@CCS, pp. 2\u20139. ACM (2019). https:\/\/doi.org\/10.1145\/3338467.3358948. https:\/\/doi.org\/10.1145\/3338467.3358948","DOI":"10.1145\/3338467.3358948 10.1145\/3338467.3358948"},{"key":"19_CR69","doi-asserted-by":"publisher","unstructured":"De Feo, L., Galbraith, S.D.: SeaSign: compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 759\u2013789. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26","DOI":"10.1007\/978-3-030-17659-4_26"},{"key":"19_CR70","doi-asserted-by":"publisher","unstructured":"De Feo, L., Kieffer, J., Smith, B.: Towards practical key exchange from ordinary isogeny graphs. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 365\u2013394. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_14","DOI":"10.1007\/978-3-030-03332-3_14"},{"key":"19_CR71","doi-asserted-by":"publisher","unstructured":"De Feo, L., Kohel, D., Leroux, A., Petit, C., Wesolowski, B.: SQISign: compact post-quantum signatures from quaternions and isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_3","DOI":"10.1007\/978-3-030-64837-4_3"},{"key":"19_CR72","doi-asserted-by":"publisher","unstructured":"de Saint Guilhem, C.D., De Meyer, L., Orsini, E., Smart, N.P.: BBQ: using AES in picnic signatures. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 669\u2013692. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38471-5_27","DOI":"10.1007\/978-3-030-38471-5_27"},{"key":"19_CR73","doi-asserted-by":"publisher","unstructured":"Debris-Alazard, T., Sendrier, N., Tillich, J.-P.: Wave: a new family of trapdoor one-way preimage sampleable functions based on codes. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 21\u201351. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_2","DOI":"10.1007\/978-3-030-34578-5_2"},{"key":"19_CR74","doi-asserted-by":"publisher","unstructured":"Debris-Alazard, T., Tillich, J.-P.: Two attacks on rank metric code-based schemes: RankSign and an IBE scheme. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 62\u201392. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_3","DOI":"10.1007\/978-3-030-03326-2_3"},{"key":"19_CR75","doi-asserted-by":"publisher","unstructured":"Degabriele, J.P., Lehmann, A., Paterson, K.G., Smart, N.P., Strefler, M.: On the joint security of encryption and signature in EMV. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 116\u2013135. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_8","DOI":"10.1007\/978-3-642-27954-6_8"},{"key":"19_CR76","doi-asserted-by":"publisher","unstructured":"Diem, C.: The XL-algorithm and a conjecture from commutative algebra. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol. 3329, pp. 323\u2013337. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30539-2_23","DOI":"10.1007\/978-3-540-30539-2_23"},{"issue":"6","key":"19_CR77","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR78","unstructured":"Ding, J., Xie, X., Lin, X.: A simple provably secure key exchange scheme based on the learning with errors problem. Cryptology ePrint Archive, Report 2012\/688 (2012). http:\/\/eprint.iacr.org\/2012\/688"},{"key":"19_CR79","unstructured":"Ding, J., Chen, M.-S., Petzoldt, A., Schmidt, D., Yang, B.-Y.: Rainbow. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR80","doi-asserted-by":"publisher","unstructured":"Dinur, I., Kales, D., Promitzer, A., Ramacher, S., Rechberger, C.: Linear equivalence of block ciphers with partial non-linear layers: application to LowMC. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 343\u2013372. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_12","DOI":"10.1007\/978-3-030-17653-2_12"},{"key":"19_CR81","doi-asserted-by":"publisher","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 22\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_2","DOI":"10.1007\/978-3-662-45608-8_2"},{"key":"19_CR82","doi-asserted-by":"publisher","unstructured":"Ducas, L., Nguyen, P.Q.: Learning a zonotope and more: cryptanalysis of NTRUSign countermeasures. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 433\u2013450. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_27","DOI":"10.1007\/978-3-642-34961-4_27"},{"key":"19_CR83","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR84","doi-asserted-by":"publisher","unstructured":"Espitau, T., Fouque, P.-A., G\u00e9rard, B., Tibouchi, M.: Side-channel attacks on BLISS lattice-based signatures: exploiting branch tracing against strongSwan and electromagnetic emanations in microcontrollers. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS, pp. 1857\u20131874. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3134028","DOI":"10.1145\/3133956.3134028"},{"key":"19_CR85","unstructured":"fail0verflow. Console Hacking 2010: PS3 Epic Fail. In: 27th Chaos Communications Congress (2010)"},{"key":"19_CR86","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing gr\u00f6bner bases without reduction to zero (f5). In: ISSAC 2002, pp. 75\u201383. Association for Computing Machinery, New York (2002). ISBN 1581134843. https:\/\/doi.org\/10.1145\/780506.780516","DOI":"10.1145\/780506.780516"},{"issue":"10","key":"19_CR87","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"J-C Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re, J.-C., Gauthier-Uma\u00f1a, V., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high-rate Mceliece cryptosystems. IEEE Trans. Inf. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR88","unstructured":"Feo, L.D.: Mathematics of isogeny based cryptography (2017)"},{"issue":"3","key":"19_CR89","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1515\/jmc-2012-0015","volume":"8","author":"L De Feo","year":"2014","unstructured":"De Feo, L., Jao, D., Pl\u00fbt, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209\u2013247 (2014)","journal-title":"J. Math. Cryptol."},{"key":"19_CR90","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"19_CR91","unstructured":"Fluhrer, S.: Cryptanalysis of ring-LWE based key exchange with key share reuse. Cryptology ePrint Archive, Report 2016\/085 (2016). http:\/\/eprint.iacr.org\/2016\/085"},{"key":"19_CR92","doi-asserted-by":"publisher","unstructured":"Fumaroli, G., Martinelli, A., Prouff, E., Rivain, M.: Affine masking against higher-order side channel analysis. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 262\u2013280. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_18","DOI":"10.1007\/978-3-642-19574-7_18"},{"key":"19_CR93","doi-asserted-by":"publisher","unstructured":"Gaborit, P., Ruatta, O., Schrek, J., Z\u00e9mor, G.: RankSign: an efficient signature algorithm based on the rank metric. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 88\u2013107. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_6","DOI":"10.1007\/978-3-319-11659-4_6"},{"key":"19_CR94","unstructured":"Galbraith, S., Panny, L., Smith, B., Vercauteren, F.: Quantum equivalence of the DLP and CDHP for group actions. Cryptology ePrint Archive, Report 2018\/1199 (2018). https:\/\/eprint.iacr.org\/2018\/1199"},{"key":"19_CR95","doi-asserted-by":"publisher","unstructured":"Galbraith, S.D., Petit, C., Shani, B., Ti, Y.B.: On the security of supersingular isogeny cryptosystems. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 63\u201391. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_3","DOI":"10.1007\/978-3-662-53887-6_3"},{"key":"19_CR96","unstructured":"Gellersen, T., Seker, O., Eisenbarth, T.: Differential power analysis of the picnic signature scheme. Cryptology ePrint Archive, Report 2020\/267 (2020). https:\/\/eprint.iacr.org\/2020\/267"},{"key":"19_CR97","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press, May 2008. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"19_CR98","doi-asserted-by":"publisher","unstructured":"Gentry, C., Jonsson, J., Stern, J., Szydlo, M.: Cryptanalysis of the NTRU signature scheme (NSS) from Eurocrypt 2001. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 1\u201320. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_1","DOI":"10.1007\/3-540-45682-1_1"},{"key":"19_CR99","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Two remarks concerning the Goldwasser-Micali-Rivest signature scheme. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 104\u2013110. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_8","DOI":"10.1007\/3-540-47721-7_8"},{"key":"19_CR100","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112\u2013131. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052231","DOI":"10.1007\/BFb0052231"},{"key":"19_CR101","doi-asserted-by":"publisher","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS, pp. 430\u2013443. ACM Press, October 2016. https:\/\/doi.org\/10.1145\/2976749.2978332","DOI":"10.1145\/2976749.2978332"},{"key":"19_CR102","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: 28th ACM STOC, pp. 212\u2013219. ACM Press, May 1996. https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"19_CR103","doi-asserted-by":"publisher","unstructured":"G\u00fcneysu, T., Lyubashevsky, V., P\u00f6ppelmann, T.: Practical lattice-based cryptography: a signature scheme for embedded systems. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 530\u2013547. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_31","DOI":"10.1007\/978-3-642-33027-8_31"},{"key":"19_CR104","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., Nilsson, A.: A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 359\u2013386. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_13","DOI":"10.1007\/978-3-030-56880-1_13"},{"key":"19_CR105","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: A key recovery attack on MDPC with CCA security using decoding errors. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 789\u2013815. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_29","DOI":"10.1007\/978-3-662-53887-6_29"},{"key":"19_CR106","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., Yang, J.: A novel CCA attack using decryption errors against LAC. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 82\u2013111. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_4","DOI":"10.1007\/978-3-030-34578-5_4"},{"key":"19_CR107","doi-asserted-by":"publisher","unstructured":"Guo, S., Kamath, P., Rosen, A., Sotiraki, K.: Limits on the efficiency of (Ring) LWE based non-interactive key exchange. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 374\u2013395. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_13","DOI":"10.1007\/978-3-030-45374-9_13"},{"key":"19_CR108","series-title":"LNCS","first-page":"2","volume-title":"ICICS 99","author":"C Hall","year":"1999","unstructured":"Hall, C., Goldberg, I., Schneier, B.: Reaction attacks against several public-key cryptosystems. In: Varadharajan, V., Yi, M. (eds.) ICICS 99. LNCS, vol. 1726, pp. 2\u201312. Springer, Heidelberg (1999)"},{"key":"19_CR109","unstructured":"Hamburg, M.: Three Bears. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR110","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NSS: An NTRU lattice-based signature scheme. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 211\u2013228. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_14","DOI":"10.1007\/3-540-44987-6_14"},{"key":"19_CR111","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/BFb0054868","DOI":"10.1007\/BFb0054868"},{"key":"19_CR112","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSign: digital signatures using the NTRU lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122\u2013140. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_9","DOI":"10.1007\/3-540-36563-X_9"},{"key":"19_CR113","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 341\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"19_CR114","doi-asserted-by":"crossref","unstructured":"Howe, J., Prest, T., Apon, D.: SOK: how (not) to design and implement post-quantum cryptography. Cryptology ePrint Archive, Report 2021 (2021). https:\/\/eprint.iacr.org\/2021\/","DOI":"10.1007\/978-3-030-75539-3_19"},{"key":"19_CR115","doi-asserted-by":"publisher","unstructured":"Paquin, C., Stebila, D., Tamvada, G.: Benchmarking post-quantum cryptography in TLS. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 72\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_5","DOI":"10.1007\/978-3-030-44223-1_5"},{"key":"19_CR116","unstructured":"Howe, J., Martinoli, M., Oswald, E., Regazzoni, F.: Optimised Lattice-Based Key Encapsulation in Hardware. In: NIST\u2019s Second PQC Standardization Conference (2019)"},{"key":"19_CR117","doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N., et al.: The impact of decryption failures on the security of NTRU encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 226\u2013246. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_14","DOI":"10.1007\/978-3-540-45146-4_14"},{"key":"19_CR118","unstructured":"Huang, W.-L., Chen, J.-P., Yang, B.-Y.: Power Analysis on NTRU Prime. IACR TCHES 2020(1) (2020). ISSN 2569\u20132925"},{"key":"19_CR119","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A.: W-OTS+ - shorter signatures for hash-based signature schemes. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 173\u2013188. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38553-7_10","DOI":"10.1007\/978-3-642-38553-7_10"},{"key":"19_CR120","unstructured":"Hulsing, A., et al.: SPHINCS+. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR121","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press, June 2007. https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"19_CR122","doi-asserted-by":"publisher","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2","DOI":"10.1007\/978-3-642-25405-5_2"},{"key":"19_CR123","unstructured":"Jao, D., et al.: SIKE. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR124","doi-asserted-by":"publisher","unstructured":"Jaques, S., Schanck, J.M.: Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 32\u201361. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_2","DOI":"10.1007\/978-3-030-26948-7_2"},{"key":"19_CR125","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"19_CR126","unstructured":"Joux, A., Vitse, V.: A crossbred algorithm for solving Boolean polynomial systems. Cryptology ePrint Archive, Report 2017\/372 (2017). http:\/\/eprint.iacr.org\/2017\/372"},{"key":"19_CR127","doi-asserted-by":"crossref","unstructured":"Kales, D., Zaverucha, G.: An attack on some signature schemes constructed from five-pass identification schemes. Cryptology ePrint Archive, Report 2020\/837 (2020). https:\/\/eprint.iacr.org\/2020\/837","DOI":"10.1007\/978-3-030-65411-5_1"},{"key":"19_CR128","doi-asserted-by":"publisher","unstructured":"Kannwischer, M.J., Pessl, P., Primas, R.: Single-trace attacks on Keccak. IACR TCHES 2020(3), 243\u2013268 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i3.243-268. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8590. ISSN 2569\u20132925","DOI":"10.13154\/tches.v2020.i3.243-268"},{"key":"19_CR129","doi-asserted-by":"publisher","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS, pp. 525\u2013537. ACM Press, October 2018. https:\/\/doi.org\/10.1145\/3243734.3243805","DOI":"10.1145\/3243734.3243805"},{"issue":"1","key":"19_CR130","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170\u2013188 (2005). https:\/\/doi.org\/10.1137\/S0097539703436345","journal-title":"SIAM J. Comput."},{"key":"19_CR131","doi-asserted-by":"publisher","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In: Severini, S., Brand\u00e3o, F.G.S.L. (eds.) TQC, volume 22 of LIPIcs, pp. 20\u201334. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2013.20","DOI":"10.4230\/LIPIcs.TQC.2013.20"},{"key":"19_CR132","doi-asserted-by":"publisher","unstructured":"Laarhoven, T., Mosca, M., van de Pol, J.: Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptogr. 77(2\u20133), 375\u2013400 (2015). https:\/\/doi.org\/10.1007\/s10623-015-0067-5. https:\/\/doi.org\/10.1007\/s10623-015-0067-5","DOI":"10.1007\/s10623-015-0067-5 10.1007\/s10623-015-0067-5"},{"key":"19_CR133","doi-asserted-by":"publisher","unstructured":"Lahr, N., Niederhagen, R., Petri, R., Samardjiska, S.: Side channel information set decoding using iterative chunking. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 881\u2013910. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_29","DOI":"10.1007\/978-3-030-64837-4_29"},{"key":"19_CR134","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical report SRI-CSL-98, SRI International Computer Science Laboratory, October 1979"},{"key":"19_CR135","doi-asserted-by":"publisher","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4. https:\/\/doi.org\/10.1007\/s10623-014-9938-4","DOI":"10.1007\/s10623-014-9938-4 10.1007\/s10623-014-9938-4"},{"key":"19_CR136","unstructured":"Liu, F., Isobe, T., Meier, W. Cryptanalysis of full LowMC and LowMC-M with algebraic techniques. Cryptology ePrint Archive, Report 2020\/1034 (2020). https:\/\/eprint.iacr.org\/2020\/1034"},{"key":"19_CR137","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"19_CR138","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"19_CR139","unstructured":"Lyubashevsky, V., Ducas, L., Kiltz, E., Lepoint, T., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR140","first-page":"05","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report 44, 05 (1978)","journal-title":"JPL DSN Progress Report"},{"key":"19_CR141","doi-asserted-by":"publisher","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21","DOI":"10.1007\/0-387-34805-0_21"},{"key":"19_CR142","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"19_CR143","doi-asserted-by":"publisher","unstructured":"Migliore, V., G\u00e9rard, B., Tibouchi, M., Fouque, P.-A.: Masking dilithium. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 344\u2013362. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_17","DOI":"10.1007\/978-3-030-21568-2_17"},{"key":"19_CR144","doi-asserted-by":"publisher","unstructured":"Mus, K., Islam, S., Sunar, B.: QuantumHammer: a practical hybrid attack on the LUOV signature scheme. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1071\u20131084. ACM Press, November 2020. https:\/\/doi.org\/10.1145\/3372297.3417272","DOI":"10.1145\/3372297.3417272"},{"key":"19_CR145","unstructured":"Naehrig, M., et al.: FrodoKEM. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR146","doi-asserted-by":"publisher","unstructured":"Nguyen, P.Q., Regev, O.: Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 271\u2013288. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_17","DOI":"10.1007\/11761679_17"},{"key":"19_CR147","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"},{"key":"19_CR148","doi-asserted-by":"publisher","unstructured":"Oswald, E., Mangard, S.: Template attacks on masking\u2013resistance is futile. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 243\u2013256. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11967668_16","DOI":"10.1007\/11967668_16"},{"key":"19_CR149","doi-asserted-by":"publisher","unstructured":"Park, A., Shim, K.-A., Koo, N., Han, D.-G.: Side-channel attacks on post-quantum signature schemes based on multivariate quadratic equations. IACR TCHES 2018(3), 500\u2013523 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i3.500-523. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7284. ISSN 2569\u20132925","DOI":"10.13154\/tches.v2018.i3.500-523"},{"key":"19_CR150","doi-asserted-by":"publisher","unstructured":"Paterson, K.G., Villanueva-Polanco, R.: Cold boot attacks on NTRU. In: Patra, A., Smart, N.P. (eds.) INDOCRYPT 2017. LNCS, vol. 10698, pp. 107\u2013125. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71667-1_6","DOI":"10.1007\/978-3-319-71667-1_6"},{"key":"19_CR151","unstructured":"Peikert, C.: A decade of lattice cryptography. Cryptology ePrint Archive, Report 2015\/939 (2015). http:\/\/eprint.iacr.org\/2015\/939"},{"key":"19_CR152","doi-asserted-by":"publisher","unstructured":"Peikert, C.: He gives C-sieves on the CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 463\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_16","DOI":"10.1007\/978-3-030-45724-2_16"},{"key":"19_CR153","doi-asserted-by":"publisher","unstructured":"Peikert, C.: How (Not) to instantiate ring-LWE. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 411\u2013430. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_22","DOI":"10.1007\/978-3-319-44618-9_22"},{"key":"19_CR154","doi-asserted-by":"publisher","unstructured":"Peikert, C.: Lattice cryptography for the internet. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 197\u2013219. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_12","DOI":"10.1007\/978-3-319-11659-4_12"},{"key":"19_CR155","doi-asserted-by":"publisher","unstructured":"Peikert, C., Pepin, Z.: Algebraically structured LWE, revisited. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 1\u201323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_1","DOI":"10.1007\/978-3-030-36030-6_1"},{"key":"19_CR156","doi-asserted-by":"publisher","unstructured":"Perrig, A.: The BiBa one-time signature and broadcast authentication protocol. In: Reiter, M.K., Samarati, P. (eds.) ACM CCS, pp. 28\u201337. ACM Press, November 2001. https:\/\/doi.org\/10.1145\/501983.501988","DOI":"10.1145\/501983.501988"},{"key":"19_CR157","doi-asserted-by":"publisher","unstructured":"Pessl, P., Bruinderink, L.G., Yarom, Y.: To BLISS-B or not to be: attacking strongSwan\u2019s implementation of post-quantum signatures. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS, pp. 1843\u20131855. ACM Press, October\/November 2017. https:\/\/doi.org\/10.1145\/3133956.3134023","DOI":"10.1145\/3133956.3134023"},{"key":"19_CR158","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387\u2013398. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_33","DOI":"10.1007\/3-540-68339-9_33"},{"key":"19_CR159","unstructured":"Polanco, R.L.V.: Cold Boot Attacks on Post-Quantum Schemes. Ph.D. thesis, Royal Holloway, University of London (2018)"},{"issue":"5","key":"19_CR160","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962). https:\/\/doi.org\/10.1109\/TIT.1962.1057777","journal-title":"IRE Trans. Inf. Theory"},{"key":"19_CR161","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR162","doi-asserted-by":"crossref","unstructured":"Ravi, P., Jhanwar, M.P., Howe, J., Chattopadhyay, A., Bhasin, S.: Exploiting determinism in lattice-based signatures: practical fault attacks on PQM4 implementations of nist candidates. In: AsiaCCS, pp. 427\u2013440 (2019)","DOI":"10.1145\/3321705.3329821"},{"key":"19_CR163","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press, May 2005. https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"19_CR164","doi-asserted-by":"publisher","unstructured":"Reyzin, L., Reyzin, N.: Better than BiBa: short one-time signatures with fast signing and verifying. In: Batten, L., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 144\u2013153. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45450-0_11","DOI":"10.1007\/3-540-45450-0_11"},{"issue":"2","key":"19_CR165","first-page":"120","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. Assoc. Comput. Machinery 21(2), 120\u2013126 (1978)","journal-title":"Commun. Assoc. Comput. Machinery"},{"key":"19_CR166","doi-asserted-by":"publisher","unstructured":"Rossi, M., Hamburg, M., Hutter, M., Marson, M.E.: A side-channel assisted cryptanalytic attack against QcBits. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 3\u201323. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_1","DOI":"10.1007\/978-3-319-66787-4_1"},{"key":"19_CR167","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-Key Cryptosystem Based On Isogenies. Cryptology ePrint Archive, Report 2006\/145 (2006). http:\/\/eprint.iacr.org\/2006\/145"},{"key":"19_CR168","doi-asserted-by":"publisher","unstructured":"Sakumoto, K., Shirai, T., Hiwatari, H.: On provable security of UOV and HFE signature schemes against chosen-message attack. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 68\u201382. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_5","DOI":"10.1007\/978-3-642-25405-5_5"},{"key":"19_CR169","doi-asserted-by":"publisher","unstructured":"Sakumoto, K., Shirai, T., Hiwatari, H.: Public-key identification schemes based on multivariate quadratic polynomials. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 706\u2013723. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_40","DOI":"10.1007\/978-3-642-22792-9_40"},{"key":"19_CR170","doi-asserted-by":"publisher","unstructured":"Samardjiska, S., Santini, P., Persichetti, E., Banegas, G.: A reaction attack against cryptosystems based on LRPC codes. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 197\u2013216. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_10","DOI":"10.1007\/978-3-030-30530-7_10"},{"key":"19_CR171","unstructured":"Samardjiska, S., Chen, M.-S., Hulsing, A., Rijneveld, J., Schwabe, P.: MQDSS. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR172","doi-asserted-by":"publisher","unstructured":"Samwel, N., Batina, L., Bertoni, G., Daemen, J., Susella, R.: Breaking Ed25519 in WolfSSL. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 1\u201320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_1","DOI":"10.1007\/978-3-319-76953-0_1"},{"key":"19_CR173","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239\u2013252. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"key":"19_CR174","doi-asserted-by":"publisher","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144. https:\/\/doi.org\/10.1007\/BF01581144","DOI":"10.1007\/BF01581144 10.1007\/BF01581144"},{"key":"19_CR175","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"key":"19_CR176","doi-asserted-by":"publisher","unstructured":"Shamir, A.: An efficient identification scheme based on permuted kernels (extended abstract). In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 606\u2013609. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_54","DOI":"10.1007\/0-387-34805-0_54"},{"key":"19_CR177","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press, November 1994. https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"19_CR178","doi-asserted-by":"publisher","unstructured":"Sim, B.-Y., Kwon, J., Choi, K.Y., Cho, J., Park, A., Han, D.-G.: Novel side-channel attacks on quasi-cyclic code-based cryptography. IACR TCHES 2019(4), 180\u2013212 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i4.180-212. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8349. ISSN 2569\u20132925","DOI":"10.13154\/tches.v2019.i4.180-212"},{"key":"19_CR179","doi-asserted-by":"publisher","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 13\u201321. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_2","DOI":"10.1007\/3-540-48329-2_2"},{"key":"19_CR180","doi-asserted-by":"publisher","unstructured":"Stern, J.: A new paradigm for public key identification. IEEE Trans. Inf. Theory 42(6), 1757\u20131768 (1996). https:\/\/doi.org\/10.1109\/18.556672. https:\/\/doi.org\/10.1109\/18.556672","DOI":"10.1109\/18.556672 10.1109\/18.556672"},{"key":"19_CR181","doi-asserted-by":"publisher","unstructured":"Szydlo, M.: Merkle tree traversal in log space and time. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 541\u2013554. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_32","DOI":"10.1007\/978-3-540-24676-3_32"},{"key":"19_CR182","doi-asserted-by":"publisher","unstructured":"Canto Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10","DOI":"10.1007\/978-3-319-29360-8_10"},{"issue":"1","key":"19_CR183","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999). https:\/\/doi.org\/10.1007\/PL00003816","journal-title":"J. Cryptol."},{"key":"19_CR184","unstructured":"Verhulst, K.: Power Analysis and Masking of Saber. Master\u2019s thesis, KU Leuven, Belgium (2019)"},{"key":"19_CR185","doi-asserted-by":"publisher","unstructured":"V\u00e9ron, P.: Improved identification schemes based on error-correcting codes. Appl. Algebra Eng. Commun. Comput. 8(1), 57\u201369 (1996). https:\/\/doi.org\/10.1007\/s002000050053. https:\/\/doi.org\/10.1007\/s002000050053","DOI":"10.1007\/s002000050053 10.1007\/s002000050053"},{"key":"19_CR186","doi-asserted-by":"publisher","unstructured":"Yang, B.-Y., Chen, J.-M.: All in the XL family: theory and practice. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 67\u201386. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496618_7","DOI":"10.1007\/11496618_7"},{"key":"19_CR187","unstructured":"Yarom, Y., Falkner, K., FLUSH+RELOAD: a high resolution, low noise, L3 cache side-channel attack. In: Fu, K., Jung, J. (eds.) USENIX Security, pp. 719\u2013732. USENIX Association, August 2014"},{"key":"19_CR188","unstructured":"Zaverucha, G., et al.: Picnic. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"},{"issue":"7&8","key":"19_CR189","first-page":"557","volume":"15","author":"M Zhandry","year":"2015","unstructured":"Zhandry, M.: A note on the quantum collision and set equality problems. Quantum Inf. Comput. 15(7&8), 557\u2013567 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"19_CR190","unstructured":"Zhang, Z., et al.: NTRUEncrypt. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-2-submissions"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75539-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:08:19Z","timestamp":1710263299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75539-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030755386","9783030755393"],"references-count":190,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75539-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/ctrsa2021\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","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":"27","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":"27% - 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.25","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":"8","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":"The conference was held virtually.","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)"}}]}}