{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:37:58Z","timestamp":1770741478359,"version":"3.49.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030568795","type":"print"},{"value":"9783030568801","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-56880-1_6","type":"book-chapter","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T15:04:50Z","timestamp":1597244690000},"page":"155-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast Reduction of Algebraic Lattices over Cyclotomic Fields"],"prefix":"10.1007","author":[{"given":"Paul","family":"Kirchner","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Espitau","sequence":"additional","affiliation":[]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th STOC, pp. 99\u2013108. ACM, May 1996","DOI":"10.1145\/237814.237838"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53018-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions - cryptanalysis of some FHE and graded encoding schemes. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 153\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-662-48800-3_31","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Cocis, C., Laguillaumie, F., Langlois, A.: Implementing candidate graded encoding schemes from ideal lattices. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part II. LNCS, vol. 9453, pp. 752\u2013775. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_31"},{"key":"6_CR4","unstructured":"Batut, C., Belabas, K., Bernardi, D., Cohen, H., Olivier, M.: PARI-GP (1998). ftp:\/\/megrez.math.u-bordeaux.fr\/pub\/pari"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-56620-7_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J-F Biasse","year":"2017","unstructured":"Biasse, J.-F., Espitau, T., Fouque, P.-A., G\u00e9lin, A., Kirchner, P.: Computing generator in cyclotomic integer rings - a subfield algorithm for the principal ideal problem in L$$_{|{{\\varDelta }{\\mathbb{K}|}}}(\\frac{1}{2})$$ and application to the cryptanalysis of a FHE scheme. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 60\u201388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_3"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Jeong, J., Lee, C.: An algorithm for NTRU-problems, cryptanalysis of the GGH multilinear map without an encoding of zero. In: ANTS (2016)","DOI":"10.1112\/S1461157016000371"},{"key":"6_CR7","volume-title":"Advanced topics in Computational Number Theory","author":"H Cohen","year":"2012","unstructured":"Cohen, H.: Advanced topics in Computational Number Theory, vol. 193. Springer, Heidelberg (2012)"},{"issue":"4","key":"6_CR8","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":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-662-49896-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Cramer","year":"2016","unstructured":"Cramer, R., Ducas, L., Peikert, C., Regev, O.: Recovering short generators of principal ideals in cyclotomic rings. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 559\u2013585. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_20"},{"key":"6_CR10","doi-asserted-by":"crossref","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.) CCS 2017, pp. 1857\u20131874. ACM (2017)","DOI":"10.1145\/3133956.3134028"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11761679_15","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"N Gama","year":"2006","unstructured":"Gama, N., Howgrave-Graham, N., Nguyen, P.Q.: Symplectic lattice reduction and NTRU. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 233\u2013253. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_15"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Ladner, R.E., Dwork, C. (eds.) 40th STOC, pp. 207\u2013216. ACM (2008)","DOI":"10.1145\/1374376.1374408"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_1"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-46035-7_20","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"C Gentry","year":"2002","unstructured":"Gentry, C., Szydlo, M.: Cryptanalysis of the revised NTRU signature scheme. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 299\u2013320. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_20"},{"key":"6_CR15","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25"},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1137\/S0097539795295626","volume":"27","author":"C Heckler","year":"1998","unstructured":"Heckler, C., Thiele, L.: Complexity analysis of a parallel lattice basis reduction algorithm. SIAM J. Comput. 27(5), 1295\u20131302 (1998)","journal-title":"SIAM J. Comput."},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia (2002)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-662-49890-3_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Jia, H.: Cryptanalysis of GGH map. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 537\u2013565. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_21"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Johnson, D.S., et al. (eds.) Symposium on Theory of Computing, pp. 193\u2013206. ACM (1983)","DOI":"10.1145\/800061.808749"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-71045-7_19","volume-title":"Cryptography and Coding","author":"T Kim","year":"2017","unstructured":"Kim, T., Lee, C.: Lattice reductions over Euclidean rings with applications to cryptanalysis. In: O\u2019Neill, M. (ed.) IMACC 2017. LNCS, vol. 10655, pp. 371\u2013391. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71045-7_19"},{"key":"6_CR22","unstructured":"Kirchner, P.: Algorithms on ideal over complex multiplication order. Cryptology ePrint Archive, Report 2016\/220 (2016)"},{"key":"6_CR23","unstructured":"Kirchner, P., Espitau, T., Fouque, P.-A.: Algebraic and euclidean lattices: optimal lattice reduction and beyond. Cryptology ePrint Archive, Report 2019\/1436 (2019)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56620-7_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"P Kirchner","year":"2017","unstructured":"Kirchner, P., Fouque, P.-A.: Revisiting lattice attacks on overstretched NTRU parameters. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 3\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_1"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-34621-8_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"C Lee","year":"2019","unstructured":"Lee, C., Pellet-Mary, A., Stehl\u00e9, D., Wallet, A.: An LLL algorithm for module lattices. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part II. LNCS, vol. 11922, pp. 59\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_3"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W.J., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"issue":"4","key":"6_CR28","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/17M115390X","volume":"48","author":"HWJ Lenstra","year":"2019","unstructured":"Lenstra, H.W.J., Silverberg, A.: Testing isomorphism of lattices over CM-orders. SIAM J. Comput. 48(4), 1300\u20131334 (2019)","journal-title":"SIAM J. Comput."},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","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"},{"key":"6_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77978-0","volume-title":"Algorithms and Data Structures: The Basic Toolbox","author":"K Mehlhorn","year":"2008","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77978-0"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-662-49890-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Micciancio","year":"2016","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 820\u2013849. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_31"},{"key":"6_CR32","unstructured":"Mukherjee, T., Stephens-Davidowitz, N.: Lattice reduction for modules, or how to reduce Module-SVP to Module-SVP. Cryptology ePrint Archive, Report 2019\/1142 (2019). Accepted to Crypto 2020"},{"issue":"2","key":"6_CR33","doi-asserted-by":"publisher","first-page":"387","DOI":"10.5802\/jtnb.176","volume":"8","author":"H Napias","year":"1996","unstructured":"Napias, H.: A generalization of the LLL-algorithm over Euclidean rings or orders. J. th\u00e9orie nombres Bordeaux 8(2), 387\u2013396 (1996)","journal-title":"J. th\u00e9orie nombres Bordeaux"},{"key":"6_CR34","volume-title":"Algebraic Number Theory","author":"J Neukirch","year":"1988","unstructured":"Neukirch, J.: Algebraic Number Theory. Springer, Heidelberg (1988)"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Neumaier, A., Stehl\u00e9, D.: Faster LLL-type reduction of lattice bases, In: International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 373\u2013380. ACM (2016)","DOI":"10.1145\/2930889.2930917"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"PQ Ngu\u00ean","year":"2005","unstructured":"Ngu\u00ean, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215\u2013233. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_13"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Novocin, A., Stehl\u00e9, D., Villard, G.: An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd STOC, pp. 403\u2013412. ACM Press, June 2011","DOI":"10.1145\/1993636.1993691"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-030-17259-6_17","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"T Pornin","year":"2019","unstructured":"Pornin, T., Prest, T.: More efficient algorithms for the NTRU key generation using the field norm. In: Lin, D., Sako, K. (eds.) PKC 2019, Part II. LNCS, vol. 11443, pp. 504\u2013533. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_17"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th STOC, pp. 84\u201393. ACM Press (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.laa.2015.12.013","volume":"493","author":"P Sawyer","year":"2016","unstructured":"Sawyer, P.: Computing Iwasawa decomposition of classical Lie groups of noncompact type using QR-decomposition. Linear Algebra Appl. 493, 573\u2013579 (2016)","journal-title":"Linear Algebra Appl."},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., 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","journal-title":"Math. Program."},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nhage, A.: Fast reduction and composition of binary quadratic forms. In: International Symposium on Symbolic and Algebraic Computation, ISSAC 1991, pp. 128\u2013133. ACM (1991)","DOI":"10.1145\/120694.120711"},{"issue":"3","key":"6_CR43","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF01202355","volume":"13","author":"M Seysen","year":"1993","unstructured":"Seysen, M.: Simultaneous reduction of a lattice basis its reciprocal basis. Combinatorica 13(3), 363\u2013376 (1993)","journal-title":"Combinatorica"},{"key":"6_CR44","unstructured":"The FPLLL development team FPLLL, a lattice reduction library (2016). https:\/\/github.com\/fplll\/fplll"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Villard, G.: Parallel lattice basis reduction. In: International Symposium on Symbolic and Algebraic Computation, ISSAC 1992, pp. 269\u2013277. ACM (1992)","DOI":"10.1145\/143242.143327"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-56880-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T00:05:51Z","timestamp":1691798751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-56880-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030568795","9783030568801"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-56880-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, 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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2020\/index.html","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"371","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":"85","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":"23% - 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":"2.82","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":"19.43","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}