{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:46:29Z","timestamp":1773261989431,"version":"3.50.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031172335","type":"print"},{"value":"9783031172342","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-17234-2_10","type":"book-chapter","created":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T21:02:18Z","timestamp":1664139738000},"page":"185-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["2F - A New Method for\u00a0Constructing Efficient Multivariate Encryption Schemes"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Smith-Tone","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"10_CR1","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. CoRR abs\/1301.1026 (2013)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part I. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"10_CR3","unstructured":"Melchor, C.A., et al.: ROLLO - Rank-Ouroboros, Lake & LOcker. Submission to the NIST\u2019s Post-quantum Cryptography Standardization Process (2019)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-030-77870-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Improved cryptanalysis of UOV and rainbow. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 348\u2013373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_13"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Beullens, W.: Breaking rainbow takes a weekend on a laptop. IACR Cryptology ePrint Archive, p. 214 (2022)","DOI":"10.1007\/978-3-031-15979-4_16"},{"key":"10_CR6","unstructured":"Casanova, A., Faugere, J.C., Macario-Rat, G., Patarin, J., Perret, L., Ryckeghem, J.: G$$e$$MSS - A Gr$$e$$at Multivariate Short Signature. Submission to the NIST\u2019s Post-quantum Cryptography Standardization Process (2020)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-030-84242-0_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Tao","year":"2021","unstructured":"Tao, C., Petzoldt, A., Ding, J.: Efficient key recovery for all HFE signature variants. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 70\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_4"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Baena, J., Briaud, P., Cabarcas, D., Perlner, R.A., Smith-Tone, D., Verbel, J.A.: Improving support-minors rank attacks: applications to GeMSS and rainbow. IACR Cryptology ePrint Archive, p. 1677 (2021)","DOI":"10.1007\/978-3-031-15982-4_13"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9617-2","volume":"69","author":"L Bettale","year":"2013","unstructured":"Bettale, L., Faug\u00e8re, J., Perret, L.: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. Des. Codes Cryptogr. 69(1), 1\u201352 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-59879-6_16","volume-title":"Post-Quantum Cryptography","author":"J Vates","year":"2017","unstructured":"Vates, J., Smith-Tone, D.: Key recovery attack for all parameters of HFE-. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 272\u2013288. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_16"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-44223-1_17","volume-title":"Post-Quantum Cryptography","author":"D Apon","year":"2020","unstructured":"Apon, D., Moody, D., Perlner, R., Smith-Tone, D., Verbel, J.: Combinatorial rank attacks against the rectangular simple matrix encryption scheme. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 307\u2013322. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_17"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-319-79063-3_18","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2018","unstructured":"Ding, J., Perlner, R., Petzoldt, A., Smith-Tone, D.: Improved cryptanalysis of HFEv- via projection. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 375\u2013395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_18"},{"key":"10_CR13","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). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"10_CR14","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). https:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"issue":"111","key":"10_CR15","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"ER Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comput. 24(111), 713\u2013735 (1970)","journal-title":"Math. Comput."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_2"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-030-25510-7_10","volume-title":"Post-Quantum Cryptography","author":"J Verbel","year":"2019","unstructured":"Verbel, J., Baena, J., Cabarcas, D., Perlner, R., Smith-Tone, D.: On the complexity of \u201csuperdetermined\u2019\u2019 minrank instances. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 167\u2013186. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_10"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-00862-7_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"C Clough","year":"2009","unstructured":"Clough, C., Baena, J., Ding, J., Yang, B.-Y., Chen, M.: Square, a new multivariate encryption scheme. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 252\u2013264. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_17"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-10366-7_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"O Billet","year":"2009","unstructured":"Billet, O., Macario-Rat, G.: Cryptanalysis of the square cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 451\u2013468. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_27"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74143-5_1","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"V Dubois","year":"2007","unstructured":"Dubois, V., Fouque, P.-A., Shamir, A., Stern, J.: Practical cryptanalysis of SFLASH. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 1\u201312. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_1"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-38616-9_16","volume-title":"Post-Quantum Cryptography","author":"C Tao","year":"2013","unstructured":"Tao, C., Diene, A., Tang, S., Ding, J.: Simple matrix scheme for encryption. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 231\u2013242. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_16"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.ffa.2015.06.001","volume":"35","author":"C Tao","year":"2015","unstructured":"Tao, C., Xiang, H., Petzoldt, A., Ding, J.: Simple matrix - a multivariate public key cryptosystem (MPKC) for encryption. Finite Fields Their Appl. 35, 352\u2013368 (2015)","journal-title":"Finite Fields Their Appl."},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-11659-4_5","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2014","unstructured":"Ding, J., Petzoldt, A., Wang, L.: The cubic simple matrix encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 76\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_5"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-319-11659-4_11","volume-title":"Post-Quantum Cryptography","author":"D Moody","year":"2014","unstructured":"Moody, D., Perlner, R., Smith-Tone, D.: An asymptotically optimal structural attack on the ABC multivariate encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 180\u2013196. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_11"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-319-69453-5_29","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"D Moody","year":"2017","unstructured":"Moody, D., Perlner, R., Smith-Tone, D.: Key recovery attack on the cubic ABC simple matrix multivariate encryption scheme. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 543\u2013558. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_29"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-59879-6_15","volume-title":"Post-Quantum Cryptography","author":"D Moody","year":"2017","unstructured":"Moody, D., Perlner, R., Smith-Tone, D.: Improved attacks for characteristic-2 parameters of the cubic ABC simple matrix encryption scheme. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 255\u2013271. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_15"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"101778","DOI":"10.1016\/j.ffa.2020.101778","volume":"69","author":"D Smith-Tone","year":"2021","unstructured":"Smith-Tone, D., Tone, C.: A multivariate cryptosystem inspired by random linear codes. Finite Fields Their Appl. 69, 101778 (2021)","journal-title":"Finite Fields Their Appl."},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-319-79063-3_19","volume-title":"Post-Quantum Cryptography","author":"Y Ikematsu","year":"2018","unstructured":"Ikematsu, Y., Perlner, R., Smith-Tone, D., Takagi, T., Vates, J.: HFERP - a new multivariate encryption scheme. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 396\u2013416. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_19"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-030-10970-7_13","volume-title":"Selected Areas in Cryptography","author":"R Cartor","year":"2018","unstructured":"Cartor, R., Smith-Tone, D.: EFLASH: A new multivariate encryption scheme. In: Cid, C., Jacobson, M., Jr. (eds.) SAC 201. LNCS, pp. 281\u2013299. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_13"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/978-3-540-70583-3_56","volume-title":"Automata, Languages and Programming","author":"J Ding","year":"2008","unstructured":"Ding, J., Dubois, V., Yang, B.-Y., Chen, O.C.-H., Cheng, C.-M.: Could SFLASH be repaired? In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 691\u2013701. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_56"},{"key":"10_CR31","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). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"10_CR32","unstructured":"Chen, C., et al.: NTRU. Submission to the NIST\u2019s Post-quantum Cryptography Standardization Process (2020)"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-030-44223-1_20","volume-title":"Post-Quantum Cryptography","author":"D Smith-Tone","year":"2020","unstructured":"Smith-Tone, D.: Practical cryptanalysis of k-ary $$C^*$$. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 360\u2013380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_20"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-40186-3_5","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"M \u00d8ygarden","year":"2020","unstructured":"\u00d8ygarden, M., Felke, P., Raddum, H., Cid, C.: Cryptanalysis of the multivariate encryption scheme EFLASH. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 85\u2013105. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_5"},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faugere","year":"1999","unstructured":"Faugere, J.C.: A new efficient algorithm for computing grobner bases (f4). J. Pure Appl. Algebra 139, 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"N Courtois","year":"2000","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"},{"key":"10_CR37","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: Holz, T., Savage, S. (eds.) 25th USENIX Security Symposium, USENIX Security 2016, Austin, TX, USA, 10\u201312 August 2016, pp. 327\u2013343. USENIX Association (2016)"},{"key":"10_CR38","unstructured":"Submission requirements and evaluation criteria for the post-quantum cryptography standardization process. NIST CSRC (2016). http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/documents\/call-for-proposals-final-dec-2016.pdf"},{"issue":"3\u20134","key":"10_CR39","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The magma algebra system I: the user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-99277-4_17","volume-title":"Selected Areas in Cryptography","author":"W Beullens","year":"2022","unstructured":"Beullens, W.: MAYO: practical post-quantum signatures from oil-and-vinegar maps. In: AlTawy, R., H\u00fclsing, A. (eds.) SAC 2021. LNCS, vol. 13203, pp. 355\u2013376. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_17"},{"key":"10_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206\u2013222. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_15"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-81293-5_5","volume-title":"Post-Quantum Cryptography","author":"D Smith-Tone","year":"2021","unstructured":"Smith-Tone, D.: New practical multivariate signatures from a nonlinear modifier. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 79\u201397. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_5"},{"key":"10_CR43","unstructured":"Hashimoto, Y.: On the modifier Q for multivariate signature schemes. IACR Cryptology ePrint Archive, p. 1046 (2021)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17234-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T12:48:21Z","timestamp":1676897301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17234-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031172335","9783031172342"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17234-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.pqcrypto.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","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":"23","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":"35% - 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.1","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":"5","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)"}}]}}