{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:53:24Z","timestamp":1773201204304,"version":"3.50.1"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030457235","type":"print"},{"value":"9783030457242","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-45724-2_10","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T04:17:18Z","timestamp":1588306638000},"page":"280-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":161,"title":["Implementing Grover Oracles for Quantum Key Search on AES and LowMC"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Jaques","sequence":"first","affiliation":[]},{"given":"Michael","family":"Naehrig","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Virdia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","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"},{"key":"10_CR2","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. Cryptology ePrint Archive, Report 2016\/687 (2016)"},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-1864-3","volume":"17","author":"M Almazrooie","year":"2018","unstructured":"Almazrooie, M., Samsudin, A., Abdullah, R., Mutter, K.N.: Quantum reversible circuit of AES-128. Quantum Inf. Process. 17(5), 1\u201330 (2018). https:\/\/doi.org\/10.1007\/s11128-018-1864-3","journal-title":"Quantum Inf. Process."},{"key":"10_CR4","unstructured":"Amento, B., Steinwandt, R., Roetteler, M.: Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity. arXiv:1209.6348 (2012)"},{"issue":"4","key":"10_CR5","first-page":"041015","volume":"8","author":"R Babbush","year":"2018","unstructured":"Babbush, R., et al.: Encoding electronic spectra in quantum circuits with linear T complexity. Phys. Rev. X 8(4), 041015 (2018)","journal-title":"Phys. Rev. X"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-72565-9_16","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"G Banegas","year":"2018","unstructured":"Banegas, G., Bernstein, D.J.: Low-communication parallel quantum multi-target preimage search. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 325\u2013335. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_16"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Banik, S., Funabiki, Y., Isobe, T.: More results on shortest linear programs. Cryptology ePrint Archive, Report 2019\/856 (2019)","DOI":"10.1007\/978-3-030-26834-3_7"},{"key":"10_CR8","first-page":"20120686","volume":"469","author":"R Beals","year":"2013","unstructured":"Beals, R., et al.: Efficient distributed quantum computing. Proc. Roy. Soc. A Math. Phys. Eng. Sci. 469, 20120686 (2013)","journal-title":"Proc. Roy. Soc. A Math. Phys. Eng. Sci."},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.46586\/tosc.v2019.i2.55-93","volume":"2019","author":"X Bonnetain","year":"2019","unstructured":"Bonnetain, X., Naya-Plasencia, M., Schrottenloher, A.: Quantum security analysis of AES. IACR Trans. Symmetric Cryptol. 2019(2), 55\u201393 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13193-6_16","volume-title":"Experimental Algorithms","author":"J Boyar","year":"2010","unstructured":"Boyar, J., Peralta, R.: A new combinational logic minimization technique with applications to cryptology. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 178\u2013189. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13193-6_16"},{"key":"10_CR11","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-30436-1_24","volume-title":"Information Security and Privacy Research","author":"J Boyar","year":"2012","unstructured":"Boyar, J., Peralta, R.: A small depth-16 circuit for the AES S-Box. In: Gritzalis, D., Furnell, S., Theoharidou, M. (eds.) SEC 2012. IAICT, vol. 376, pp. 287\u2013298. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30436-1_24"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s12095-018-0296-3","volume":"11","author":"J Boyar","year":"2018","unstructured":"Boyar, J., Find, M.G., Peralta, R.: Small low-depth circuits for cryptographic applications. Crypt. Commun. 11(1), 109\u2013127 (2018). https:\/\/doi.org\/10.1007\/s12095-018-0296-3","journal-title":"Crypt. Commun."},{"issue":"4\u20135","key":"10_CR13","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschr. Phys."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: ACM CCS 2017. ACM (2017)","DOI":"10.1145\/3133956.3133997"},{"key":"10_CR15","unstructured":"Daemen, J., Rijmen, V.: AES proposal: Rijndael (1999)"},{"key":"10_CR16","unstructured":"Daemen, J., Rijmen, V.: Specification for the advanced encryption standard (AES). Federal Information Processing Standards Publication 197 (2001)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-030-17653-2_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"I Dinur","year":"2019","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"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Ekdahl, P., Johansson, T., Maximov, A., Yang, J.: A new SNOW stream cipher called SNOW-V. Cryptology ePrint Archive, Report 2018\/1143 (2018)","DOI":"10.46586\/tosc.v2019.i3.1-42"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"032324","DOI":"10.1103\/PhysRevA.86.032324","volume":"86","author":"AG Fowler","year":"2012","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012)","journal-title":"Phys. Rev. A"},{"key":"10_CR20","unstructured":"Gidney, C.: Windowed quantum arithmetic. arXiv preprint arXiv:1905.07682 (2019)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-29360-8_3","volume-title":"Post-Quantum Cryptography","author":"M Grassl","year":"2016","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying Grover\u2019s algorithm to AES: quantum resource estimates. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 29\u201343. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_3"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC 1996. ACM (1996)","DOI":"10.1145\/237814.237866"},{"issue":"3","key":"10_CR23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.26421\/QIC4.3-5","volume":"4","author":"LK Grover","year":"2004","unstructured":"Grover, L.K., Rudolph, T.: How significant are the known collision and element distinctness quantum algorithms? QIC 4(3), 201\u2013206 (2004)","journal-title":"QIC"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2$$^m$$) using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-030-26948-7_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Jaques","year":"2019","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"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-319-66787-4_33","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"J Jean","year":"2017","unstructured":"Jean, J., Moradi, A., Peyrin, T., Sasdrich, P.: Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 687\u2013707. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_33"},{"key":"10_CR27","first-page":"1109","volume":"19","author":"Y-S Jeon","year":"2010","unstructured":"Jeon, Y.-S., Kim, Y.-J., Lee, D.-H.: A compact memory-free architecture for the AES algorithm using resource sharing methods. JCSC 19, 1109\u20131130 (2010)","journal-title":"JCSC"},{"issue":"2","key":"10_CR28","doi-asserted-by":"publisher","first-page":"022328","DOI":"10.1103\/PhysRevA.87.022328","volume":"87","author":"C Jones","year":"2013","unstructured":"Jones, C.: Low-overhead constructions for the fault-tolerant Toffoli gate. Phys. Rev. A 87(2), 022328 (2013)","journal-title":"Phys. Rev. A"},{"issue":"12","key":"10_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2107-3","volume":"17","author":"P Kim","year":"2018","unstructured":"Kim, P., Han, D., Jeong, K.C.: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2. Quantum Inf. Process. 17(12), 1\u201339 (2018). https:\/\/doi.org\/10.1007\/s11128-018-2107-3","journal-title":"Quantum Inf. Process."},{"issue":"4","key":"10_CR30","doi-asserted-by":"publisher","first-page":"188","DOI":"10.46586\/tosc.v2017.i4.188-211","volume":"2017","author":"T Kranz","year":"2017","unstructured":"Kranz, T., Leander, G., Stoffelen, K., Wiemer, F.: Shorter linear straight-line programs for MDS matrices. IACR Trans. Symm. Cryptol. 2017(4), 188\u2013211 (2017)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"10_CR31","unstructured":"Langenberg, B., Pham, H., Steinwandt, R.: Reducing the cost of implementing AES as a quantum circuit. Cryptology ePrint Archive, Report 2019\/854 (2019)"},{"key":"10_CR32","unstructured":"Low, G.H., Kliuchnikov, V., Schaeffer, L.: Trading T-gates for dirty qubits in state preparation and unitary synthesis. arXiv preprint arXiv:1812.00954 (2018)"},{"key":"10_CR33","unstructured":"LowMC: LowMC\/lowmc at e847fb160ad8ca1f373efd91a55b6d67f7deb425 (2019). https:\/\/github.com\/LowMC\/lowmc\/tree\/e847fb160ad8ca1f373efd91a55b6d67f7deb425"},{"key":"10_CR34","unstructured":"Maximov, A.: AES MixColumn with 92 XOR gates. Cryptology ePrint Archive, Report 2019\/833 (2019)"},{"key":"10_CR35","unstructured":"Microsoft: Getting started with Python and Q# | Microsoft Docs (2019). https:\/\/docs.microsoft.com\/en-us\/quantum\/install-guide\/python"},{"key":"10_CR36","unstructured":"Microsoft: microsoft\/iqsharp: Microsoft\u2019s IQ# server (2019). https:\/\/github.com\/microsoft\/iqsharp"},{"key":"10_CR37","unstructured":"NIST: Submission requirements and evaluation criteria for the Post-Quantum Cryptography standardization process (2016)"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-15031-9_16","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"Y Nogami","year":"2010","unstructured":"Nogami, Y., Nekado, K., Toyota, T., Hongo, N., Morikawa, Y.: Mixed bases for efficient inversion in $${{\\mathbb{F}}{((2^2)^2)}{2}}$$ and conversion matrices of SubBytes of AES. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 234\u2013247. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15031-9_16"},{"key":"10_CR39","unstructured":"PyCryptodome: Welcome to PyCryptodome\u2019s documentation - PyCryptodome 3.8.2 documentation (2019). https:\/\/pycryptodome.readthedocs.io\/en\/stable\/index.html"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Reyhani-Masoleh, A., Taha, M., Ashmawy, D.: New area record for the AES combined S-box\/inverse S-box. In: ARITH. IEEE (2018)","DOI":"10.1109\/ARITH.2018.8464780"},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"298","DOI":"10.46586\/tches.v2018.i2.298-336","volume":"2018","author":"A Reyhani-Masoleh","year":"2018","unstructured":"Reyhani-Masoleh, A., Taha, M., Ashmawy, D.: Smashing the implementation records of AES S-box. TCHES 2018, 298\u2013336 (2018)","journal-title":"TCHES"},{"key":"10_CR42","volume-title":"Efficient implementation of the Rijndael S-box","author":"V Rijmen","year":"2000","unstructured":"Rijmen, V.: Efficient implementation of the Rijndael S-box. Katholieke Universiteit Leuven, Dept. ESAT, Belgium (2000)"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45682-1_15","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"A Satoh","year":"2001","unstructured":"Satoh, A., Morioka, S., Takano, K., Munetoh, S.: A compact rijndael hardware architecture with S-Box optimization. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 239\u2013254. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_15"},{"key":"10_CR44","doi-asserted-by":"publisher","first-page":"042302","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P Selinger","year":"2013","unstructured":"Selinger, P.: Quantum circuits of $$T$$-depth one. Phys. Rev. A 87, 042302 (2013)","journal-title":"Phys. Rev. A"},{"key":"10_CR45","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: FOCS 1994, pp. 124\u2013134. IEEE Computer Society (1994)"},{"issue":"5","key":"10_CR46","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"49","key":"10_CR47","first-page":"10","volume":"2","author":"DS Steiger","year":"2018","unstructured":"Steiger, D.S., H\u00e4ner, T., Troyer, M.: ProjectQ: an open source software framework for quantum computing. Quantum 2(49), 10\u201322331 (2018)","journal-title":"Quantum"},{"key":"10_CR48","unstructured":"Stein, W., et al.: Sage Mathematics Software Version 8.1 (2017)"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Svore, K.M., et al.: Q#: enabling scalable quantum computing and development with a high-level DSL. In: RWDSL@CGO 2018 (2018)","DOI":"10.1145\/3183895.3183901"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Tan, Q.Q., Peyrin, T.: Improved heuristics for short linear programs. Cryptology ePrint Archive, Report 2019\/847 (2019)","DOI":"10.46586\/tches.v2020.i1.203-230"},{"key":"10_CR51","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"L Trefethen","year":"1997","unstructured":"Trefethen, L., Bau, D.: Numerical Linear Algebra. Other Titles in Applied Mathematics. SIAM, Philadelphia (1997)"},{"key":"10_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-48324-4_4","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2015","author":"R Ueno","year":"2015","unstructured":"Ueno, R., Homma, N., Sugawara, Y., Nogami, Y., Aoki, T.: Highly efficient $$GF(2^8)$$ inversion circuit based on redundant GF arithmetic and its application to AES design. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 63\u201380. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_4"},{"key":"10_CR53","unstructured":"Wei, Z., Sun, S., Hu, L., Wei, M., Boyar, J., Peralta, R.: Scrutinizing the tower field implementation of the $$\\mathbb{F}_{2^8}$$ inverter - with applications to AES, Camellia, and SM4. Cryptology ePrint Archive, Report 2019\/738 (2019)"},{"key":"10_CR54","unstructured":"Yamamura, A., Ishizuka, H.: Quantum cryptanalysis of block ciphers (algebraic systems, formal languages and computations), vol. 1166, pp. 235\u2013243 (2000). https:\/\/repository.kulib.kyoto-u.ac.jp\/dspace\/bitstream\/2433\/64334\/1\/1166-29.pdf"},{"issue":"4","key":"10_CR55","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60(4), 2746 (1999)","journal-title":"Phys. Rev. A"},{"key":"10_CR56","unstructured":"Zaverucha, G., et al.: Picnic. Technical report, NIST (2017)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45724-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:09:39Z","timestamp":1682899779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45724-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457235","9783030457242"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45724-2_10","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":"1 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","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":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2020\/","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":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"81","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":"22% - 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","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":"20","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 due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}