{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T22:20:32Z","timestamp":1793485232592,"version":"4.5.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319706962","type":"print"},{"value":"9783319706979","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-70697-9_9","type":"book-chapter","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T18:27:49Z","timestamp":1510943269000},"page":"241-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":167,"title":["Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms"],"prefix":"10.1007","author":[{"given":"Martin","family":"Roetteler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Naehrig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Krysta M.","family":"Svore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,11,18]]},"reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"issue":"2","key":"9_CR2","first-page":"175","volume":"3","author":"S Beauregard","year":"2003","unstructured":"Beauregard, S.: Circuit for Shor\u2019s algorithm using 2n+3 qubits. Quantum Inf. Comput. 3(2), 175\u2013185 (2003)","journal-title":"Quantum Inf. Comput."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Biasse, J.-F., Mosca, M.: A low-resource quantum factoring algorithm. In: Lange and Takagi [28], pp. 330\u2013346","DOI":"10.1007\/978-3-319-59879-6_19"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_26"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Blake-Wilson, S., Bolyard, N., Gupta, V., Hawk, C., Moeller, B.: Elliptic curve cryptography (ECC) cipher suites for Transport Layer Security (TLS). RFC 4492, RFC Editor (2006)","DOI":"10.17487\/rfc4492"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-54631-0_12","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"JW Bos","year":"2014","unstructured":"Bos, J.W., Costello, C., Miele, A.: Elliptic and hyperelliptic curves: a practical security analysis. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 203\u2013220. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_12"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/jnth.1995.1088","volume":"53","author":"W Bosma","year":"1995","unstructured":"Bosma, W., Lenstra, H.W.: Complete system of two addition laws for elliptic curves. J. Number Theor. 53(2), 229\u2013240 (1995)","journal-title":"J. Number Theor."},{"key":"9_CR8","unstructured":"Certicom Research: Standards for efficient cryptography 2: recommended elliptic curve domain parameters. Standard SEC2, Certicom (2000)"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28979-8","volume-title":"Prime Numbers - A Computational Perspective","year":"2005","unstructured":"Crandall, R., Pomerance, C. (eds.): Prime Numbers - A Computational Perspective. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-28979-8"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Dierks, T., Rescorla, E.: The Transport Layer Security (TLS) protocol version 1.2. RFC 5246, RFC Editor (2008)","DOI":"10.17487\/rfc5246"},{"issue":"6","key":"9_CR11","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. Theor. 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: the second-generation onion router. In: Blaze, M. (ed.) USENIX Security 2004, pp. 303\u2013320. USENIX (2004)","DOI":"10.21236\/ADA465464"},{"key":"9_CR13","unstructured":"ECC Brainpool: ECC brainpool standard curves and curve generation (2005). http:\/\/www.ecc-brainpool.org\/download\/Domain-parameters.pdf"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Eker\u00e5, M., H\u00e5stad, J.: Quantum algorithms for computing short discrete logarithms and factoring RSA integers. In: Lange and Takagi [28], pp. 347\u2013363","DOI":"10.1007\/978-3-319-59879-6_20"},{"key":"9_CR15","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). arXiv:1208.0928","journal-title":"Phys. Rev. A"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10623-015-0146-7","volume":"78","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., Gaudry, P.: Recent progress on the elliptic curve discrete logarithm problem. Des. Codes Crypt. 78(1), 51\u201372 (2016)","journal-title":"Des. Codes Crypt."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"DM Gordon","year":"1993","unstructured":"Gordon, D.M.: Discrete logarithms in GF(P) using the number field sieve. SIAM J. Discrete Math. 6(1), 124\u2013138 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"17","key":"9_CR19","doi-asserted-by":"publisher","first-page":"3228","DOI":"10.1103\/PhysRevLett.76.3228","volume":"76","author":"R Griffiths","year":"1996","unstructured":"Griffiths, R., Niu, C.: Semiclassical Fourier transform for quantum computation. Phys. Rev. Lett. 76(17), 3228\u20133231 (1996)","journal-title":"Phys. Rev. Lett."},{"key":"9_CR20","unstructured":"Hamburg, M.: Ed448-Goldilocks, a new elliptic curve. IACR Cryptology ePrint Archive 2015:625 (2015)"},{"issue":"7&8","key":"9_CR21","first-page":"673","volume":"18","author":"T Haner","year":"2017","unstructured":"Haner, T., Roetteler, M., Svore, K.M.: Factoring using $$2n\\,{+}\\,2$$ qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 18(7&8), 673\u2013684 (2017)","journal-title":"Quantum Inf. Comput."},{"key":"9_CR22","unstructured":"Hollosi, A., Karlinger, G., Rossler, T., Centner, M., et al.: Die osterreichische Burgerkarte (2008). http:\/\/www.buergerkarte.at\/konzept\/securitylayer\/spezifikation\/20080220\/"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson, D., Menezes, A., Vanstone, S.A.: The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 1(1), 36\u201363 (2001)","journal-title":"Int. J. Inf. Secur."},{"issue":"242","key":"9_CR24","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A Joux","year":"2003","unstructured":"Joux, A., Lercier, R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method. Math. Comput. 72(242), 953\u2013967 (2003)","journal-title":"Math. Comput."},{"issue":"8","key":"9_CR25","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"BS Kaliski Jr","year":"1995","unstructured":"Kaliski Jr., B.S.: The Montgomery inverse and its applications. IEEE Trans. Comput. 44(8), 1064\u20131065 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/TC.2015.2409842","volume":"65","author":"V Kliuchnikov","year":"2016","unstructured":"Kliuchnikov, V., Maslov, D., Mosca, M.: Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and $$T$$ circuits. IEEE Trans. Comput. 65(1), 161\u2013172 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"177","key":"9_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6","volume-title":"Post-Quantum Cryptography","year":"2017","unstructured":"Lange, T., Takagi, T. (eds.): PQCrypto 2017. LNCS, vol. 10346. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Langley, A., Hamburg, M., Turner, S.: Elliptic curves for security. RFC 7748, RFC Editor (2016)","DOI":"10.17487\/RFC7748"},{"key":"9_CR30","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra, H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BFb0091534"},{"issue":"7","key":"9_CR31","first-page":"610","volume":"9","author":"D Maslov","year":"2009","unstructured":"Maslov, D., Mathew, J., Cheung, D., Pradhan, D.K.: An O(m$${^{2}}$$)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2$${^{m}})$$ $${^{a}}$$. Quantum Inf. Comput. 9(7), 610\u2013621 (2009)","journal-title":"Quantum Inf. Comput."},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 1985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"issue":"170","key":"9_CR33","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"9_CR34","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2009). http:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"9_CR35","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"9_CR36","unstructured":"Paterson, K.G.: Formal request from TLS WG to CFRG for new elliptic curves. CFRG mailing list, 14 July 2014. http:\/\/www.ietf.org\/mail-archive\/web\/cfrg\/current\/msg04655.html"},{"issue":"143","key":"9_CR37","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation mod p. Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"issue":"4","key":"9_CR38","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"JM Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, monopoly and discrete logarithms. J. Cryptol. 13(4), 437\u2013447 (2000)","journal-title":"J. Cryptol."},{"issue":"4","key":"9_CR39","first-page":"317","volume":"3","author":"J Proos","year":"2003","unstructured":"Proos, J., Zalka, C.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3(4), 317\u2013344 (2003)","journal-title":"Quantum Inf. Comput."},{"key":"9_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-662-49890-3_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Renes","year":"2016","unstructured":"Renes, J., Costello, C., Batina, L.: Complete addition formulas for prime order elliptic curves. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 403\u2013428. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_16"},{"issue":"2","key":"9_CR41","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","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. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"9_CR42","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"},{"issue":"1\u20132","key":"9_CR43","first-page":"159","volume":"15","author":"P Selinger","year":"2015","unstructured":"Selinger, P.: Efficient Clifford$$+T$$ approximation of single-qubit operators. Quantum Inf. Comput. 15(1\u20132), 159\u2013180 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: FOCS 1994, pp. 124\u2013134. IEEE Computer Society (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"9_CR45","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"9_CR46","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol. 106, 2nd edn. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09494-6","edition":"2"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Stebila, D., Green, J.: Elliptic curve algorithm integration in the Secure Shell Transport Layer. RFC 5656, RFC Editor (2009)","DOI":"10.17487\/rfc5656"},{"issue":"3","key":"9_CR48","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0021-9991(67)90047-2","volume":"1","author":"J Stein","year":"1967","unstructured":"Stein, J.: Computational problems associated with Racah algebra. J. Comput. Phys. 1(3), 397\u2013405 (1967)","journal-title":"J. Comput. Phys."},{"issue":"9&10","key":"9_CR49","first-page":"872","volume":"10","author":"Y Takahashi","year":"2010","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. Quantum Inf. Comput. 10(9&10), 872\u2013890 (2010)","journal-title":"Quantum Inf. Comput."},{"key":"9_CR50","unstructured":"U.S. Department of Commerce\/National Institute of Standards and Technology: Digital Signature Standard (DSS). FIPS-186-4 (2013). http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"issue":"1","key":"9_CR51","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)","journal-title":"J. Cryptol."},{"key":"9_CR52","unstructured":"Wecker, D., Svore, K.M.: LIQ$$Ui|\\rangle $$: a software design architecture and domain-specific language for quantum computing (2014). https:\/\/arxiv.org\/abs\/1402.4467"},{"key":"9_CR53","unstructured":"WhatsApp Inc.: Whatsapp encryption overview. Technical White Paper (2016)"},{"key":"9_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11745853","volume-title":"Public Key Cryptography - PKC 2006","year":"2006","unstructured":"Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.): PKC 2006. LNCS, vol. 3958. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70697-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:26:26Z","timestamp":1750998386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-70697-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319706962","9783319706979"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"18 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/asiacrypt.iacr.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}