{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T23:48:30Z","timestamp":1778802510602,"version":"3.51.4"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319598789","type":"print"},{"value":"9783319598796","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59879-6_18","type":"book-chapter","created":{"date-parts":[[2017,6,3]],"date-time":"2017-06-03T16:28:34Z","timestamp":1496507314000},"page":"311-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["Post-quantum RSA"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Heninger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Valenta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,4]]},"reference":[{"key":"18_CR1","unstructured":"\u2014 (no editor): Second International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2008, 10\u201315 February 2008, Sainte Luce, Martinique, French Caribbean. IEEE Computer Society (2008). See [17]"},{"key":"18_CR2","unstructured":"\u2014 (no editor): Kernel BUG at mm\/huge_memory.c:1798! (2012). http:\/\/linux-kernel.2935.n7.nabble.com\/kernel-BUG-at-mm-huge-memory-c-1798-td574029.html. Citations in this document: \u00a7A"},{"key":"18_CR3","unstructured":"\u2014 (no editor): Proceedings of the 23rd USENIX Security Symposium, 20\u201322 August 2014, San Diego, CA, USA. USENIX (2014). See [19]"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14712-8","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","year":"2010","unstructured":"Abdalla, M., Barreto, P.S.L.M. (eds.): LATINCRYPT 2010. LNCS, vol. 6212. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14712-8. See [11]"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Bos, J.W., Bouvier, C., Kleinjung, T., Montgomery, P.L.: Finding ECM-friendly curves through a study of Galois properties. In: ANTS-X: Proceedings of the Tenth Algorithmic Number Theory Symposium, pp. 63\u201386 (2013). http:\/\/msp.org\/obs\/2013\/1\/p04.xhtml. Citations in this document: \u00a72","DOI":"10.2140\/obs.2013.1.63"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Beauchemin, P., Brassard, G., Cr\u00e9peau, C., Goutier, C., Pomerance, C.: The generation of random numbers that are probably prime. J. Cryptol. 1, 53\u201364 (1988). https:\/\/math.dartmouth.edu\/~carlp\/probprime.pdf. Citations in this document: \u00a73","DOI":"10.1007\/BF00206325"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kane, D., Rogaway, P.: Big-key symmetric encryption: resisting key exfiltration. In: [44], pp. 373\u2013402 (2016). https:\/\/eprint.iacr.org\/2016\/541.pdf. Citations in this document: \u00a71","DOI":"10.1007\/978-3-662-53018-4_14"},{"key":"18_CR8","unstructured":"Bernstein, D.J.: How to find small factors of integers (2002). https:\/\/cr.yp.to\/papers.html#sf. Citations in this document: \u00a73"},{"key":"18_CR9","unstructured":"Bernstein, D.J.: How to find smooth parts of integers (2004). https:\/\/cr.yp.to\/papers.html#smoothparts. Citations in this document: \u00a73, \u00a73"},{"key":"18_CR10","unstructured":"Bernstein, D.J.: Fast multiplication and its applications. In: [18], pp. 325-384 (2008). https:\/\/cr.yp.to\/papers.html#multapps. Citations in this document: \u00a73,\u00a73,\u00a73"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Lange, T.: Starfish on strike. In: LATINCRYPT 2010 [4], pp. 61\u201380 (2010). https:\/\/eprint.iacr.org\/2010\/367. Citations in this document: \u00a72","DOI":"10.1007\/978-3-642-14712-8_4"},{"key":"18_CR12","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: ECM using Edwards curves (2008). https:\/\/eprint.iacr.org\/2008\/016. Citations in this document: \u00a72, \u00a72"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring $$N=p^r q$$ for large $$r$$. In: [54], pp. 326\u2013337 (1999). http:\/\/crypto.stanford.edu\/~dabo\/abstracts\/prq.html. Citations in this document: \u00a73","DOI":"10.1007\/3-540-48405-1_21"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Kleinjung, T.: ECM at work pages. In: ASIACRYPT 2012 [53], pp. 467\u2013484 (2012). https:\/\/eprint.iacr.org\/2012\/089. Citations in this document: \u00a72","DOI":"10.1007\/978-3-642-34961-4_29"},{"key":"18_CR15","unstructured":"Boukhonine, S.: Cryptography: a security tool of the information age (1998). https:\/\/pdfs.semanticscholar.org\/3932\/8253d692f791b37c425e776f6cee0b8c3e56.pdf. Citations in this document: \u00a71"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Kalach, K., Kaplan, M., Laplante, S., Salvail, L.: Merkle puzzles in a quantum world. In: CRYPTO 2011 [45], pp. 391\u2013410 (2011). https:\/\/arxiv.org\/abs\/1108.2316. Citations in this document: \u00a71,\u00a71","DOI":"10.1007\/978-3-642-22792-9_22"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Brassard, G., Salvail, L.: Quantum Merkle puzzles. In: ICQNM 2008 [1], pp. 76\u201379 (2008). Citations in this document: \u00a71","DOI":"10.1109\/ICQNM.2008.16"},{"key":"18_CR18","series-title":"Mathematical Sciences Research Institute Publications","doi-asserted-by":"crossref","DOI":"10.1017\/9781139049801","volume-title":"Surveys in Algorithmic Number Theory","author":"JP Buhler","year":"2008","unstructured":"Buhler, J.P., Stevenhagen, P.: Surveys in Algorithmic Number Theory. Mathematical Sciences Research Institute Publications, vol. 44. Cambridge University Press, New York (2008). See [10]"},{"key":"18_CR19","unstructured":"Checkoway, S., Fredrikson, M., Niederhagen, R., Everspaugh, A., Green, M., Lange, T., Ristenpart, T., Bernstein, D.J., Maskiewicz, J., Shacham, H.: On the practical exploitability of Dual EC in TLS implementations. In: USENIX Security 2014 [3] (2014). https:\/\/projectbullrun.org\/dual-ec\/index.html. Citations in this document: \u00a71"},{"key":"18_CR20","unstructured":"Ekert, A.: Quantum cryptoanalysis\u2013introduction (2010). http:\/\/www.qi.damtp.cam.ac.uk\/node\/69. Citations in this document: \u00a71"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster integer multiplication. In: [30], pp. 57\u201366 (2007). https:\/\/www.cse.psu.edu\/~furer\/. Citations in this document: \u00a73","DOI":"10.1145\/1250790.1250800"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"G\u00e9lin, A., Kleinjung, T., Lenstra, A.K.: Parametrizations for families of ECM-friendly curves (2016). https:\/\/eprint.iacr.org\/2016\/1092. Citations in this document: \u00a72","DOI":"10.1145\/3087604.3087606"},{"key":"18_CR23","unstructured":"Goldwasser, S. (ed.): 35th Annual IEEE Symposium on the Foundations of Computer Science. Proceedings of the IEEE Symposium Held in Santa Fe, NM, 20\u201322 November 1994. IEEE (1994). ISBN 0\u20138186-6580-7. MR 98h:68008. See [48]"},{"key":"18_CR24","unstructured":"Goodin, D.: Symantec employees fired for issuing rogue HTTPS certificate for Google (2015). https:\/\/arstechnica.com\/security\/2015\/09\/symantec-employees-fired-for-issuing-rogue-https-certificate-for-google\/. Citations in this document: \u00a71"},{"key":"18_CR25","unstructured":"Granlund, T.: GMP integer size limitation (2012). https:\/\/gmplib.org\/list-archives\/gmp-discuss\/2012-April\/005020.html. Citations in this document: \u00a7A"},{"key":"18_CR26","unstructured":"Granlund, T., The GMP Development Team: GNU MP: The GNU Multiple Precision Arithmetic Library (2015). https:\/\/gmplib.org\/. Citations in this document: \u00a74"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jco.2016.03.001","volume":"36","author":"D Harvey","year":"2016","unstructured":"Harvey, D., van der Hoeven, J., Lecerf, G.: Even faster integer multiplication. J. Complex. 36, 1\u201330 (2016). https:\/\/arxiv.org\/abs\/1407.3360. Citations in this document: \u00a73","journal-title":"J. Complex."},{"key":"18_CR28","unstructured":"Harvey, D., van der Hoeven, J., Lecerf, G.: Fast polynomial multiplication over $${ F}_{2^{60}}$$. In: Proceedings of ISSAC 2016 (2016, to appear). https:\/\/hal.archives-ouvertes.fr\/hal-01265278. Citations in this document: \u00a74, \u00a74"},{"key":"18_CR29","unstructured":"ID Quantique: Future-proof data confidentiality with quantum cryptography (2005). https:\/\/classic-web.archive.org\/web\/20070728200504\/, http:\/\/www.idquantique.com\/products\/files\/vectis-future.pdf. Citations in this document: \u00a74"},{"key":"18_CR30","unstructured":"Johnson, D.S., Feige, U. (eds.): Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007. Association for Computing Machinery, New York (2007). ISBN 978-1-59593-631-8. See [21]"},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1090\/S0025-5718-1989-0982368-4","volume":"53","author":"SH Kim","year":"1989","unstructured":"Kim, S.H., Pomerance, C.: The probability that a random probable prime is composite. Math. Comput. 53, 721\u2013741 (1989). https:\/\/math.dartmouth.edu\/~carlp\/PDF\/paper72.pdf. Citations in this document: \u00a74","journal-title":"Math. Comput."},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055715","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","year":"1998","unstructured":"Krawczyk, H. (ed.): CRYPTO 1998. LNCS, vol. 1462. Springer, Heidelberg (1998). doi:10.1007\/BFb0055715. ISBN 3-540-64892-5. MR 99i:94059. See [52]"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1090\/S0002-9904-1931-05271-X","volume":"37","author":"DH Lehmer","year":"1931","unstructured":"Lehmer, D.H., Powers, R.E.: On factoring large numbers. Bull. Am. Math. Soc. 37, 770\u2013776 (1931). Citations in this document: \u00a72","journal-title":"Bull. Am. Math. Soc."},{"key":"18_CR34","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 Jr., H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993). doi:10.1007\/BFb0091534. ISBN 3-540-57013-6. MR 96m:11116. Citations in this document: \u00a72"},{"key":"18_CR35","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra Jr","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. Math. 126, 649\u2013673 (1987). MR 89g:11125. Citations in this document: \u00a72","journal-title":"Ann. Math."},{"key":"18_CR36","series-title":"Mathematical Centre Tracts","volume-title":"Computational Methods in Number Theory I","author":"HW Lenstra Jr","year":"1982","unstructured":"Lenstra Jr., H.W., Tijdeman, R.: Computational Methods in Number Theory I. Mathematical Centre Tracts, vol. 154. Mathematisch Centrum, Amsterdam (1982). ISBN 90-6196-248-X. MR 84c:10002. See [41]"},{"key":"18_CR37","unstructured":"Lepr\u00e9vost, F.: The end of public key cryptography or does God play dices? PricewaterhouseCoopers Cryptogr. Centre Excell. Q. J. (1999). http:\/\/tinyurl.com\/jdkkxc3. Citations in this document: \u00a72"},{"key":"18_CR38","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00202269","volume":"8","author":"UM Maurer","year":"1995","unstructured":"Maurer, U.M.: Fast generation of prime numbers and secure public-key cryptographic parameters. J. Cryptol. 8, 123\u2013155 (1995). http:\/\/link.springer.com\/article\/10.1007\/BF00202269. Citations in this document: \u00a72","journal-title":"J. Cryptol."},{"key":"18_CR39","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"JM Pollard","year":"1974","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing. Proc. Camb. Philos. Soc. 76, 521\u2013528 (1974). MR 50 #6992. Citations in this document: \u00a72","journal-title":"Proc. Camb. Philos. Soc."},{"key":"18_CR40","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"JM Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT 15, 331\u2013334 (1975). MR 52 #13611. Citations in this document: \u00a72","journal-title":"BIT"},{"key":"18_CR41","unstructured":"Pomerance, C.: Analysis and comparison of some integer factoring algorithms. In: [36], pp. 89\u2013139 (1982). MR 84i:10005. Citations in this document: \u00a72"},{"key":"18_CR42","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractableas factorization. Technical report 212, MIT Laboratory for Computer Science (1979). https:\/\/archive.org\/details\/bitsavers_mitlcstrMI_457188. Citations in this document: \u00a73"},{"key":"18_CR43","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, 120\u2013126 (1978). ISSN 0001-0782. Citations in this document: \u00a73","journal-title":"Commun. ACM"},{"key":"18_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","year":"2016","unstructured":"Robshaw, M., Katz, J. (eds.): CRYPTO 2016. LNCS, vol. 9814. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-53018-4. ISBN 978-3-662-53017-7. See [7]"},{"key":"18_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","year":"2011","unstructured":"Rogaway, P. (ed.): CRYPTO 2011. LNCS, vol. 6841. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22792-9. See [16]"},{"key":"18_CR46","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing 7, 281\u2013292 (1971). http:\/\/link.springer.com\/article\/10.1007\/BF02242355. Citations in this document: \u00a73","journal-title":"Computing"},{"key":"18_CR47","unstructured":"Shamir, S.: RSA for paranoids. CryptoBytes 1 (1995). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.154.5763&rep=rep1&type=pdf. Citations in this document: \u00a71,\u00a73"},{"key":"18_CR48","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: [23], pp. 124\u2013134 (1994). See also newer version [49]. MR 1489242. Citations in this document: \u00a71"},{"key":"18_CR49","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer (1995). See also older version [48]; see also newer version [50]. https:\/\/arxiv.org\/abs\/quant-ph\/9508027v2"},{"key":"18_CR50","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, 1484\u20131509 (1997). See also older version [49]. MR 98i:11108","journal-title":"SIAM J. Comput."},{"key":"18_CR51","unstructured":"Shoup, V.: A proposal for an ISO standard for public key encryption (version 2.1) (2001). http:\/\/www.shoup.net\/papers. Citations in this document: \u00a73"},{"key":"18_CR52","doi-asserted-by":"crossref","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo $$p^{k}q$$. In: [32], pp. 318\u2013326 (1998). http:\/\/imi.kyushu-u.ac.jp\/takagi\/takagi\/publications\/cr98.ps. Citations in this document: \u00a71, \u00a73","DOI":"10.1007\/BFb0055738"},{"key":"18_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","year":"2012","unstructured":"Wang, X., Sako, K. (eds.): ASIACRYPT 2012. LNCS, vol. 7658. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34961-4. ISBN 978-3-642-34960-7. See [14]"},{"key":"18_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","year":"1999","unstructured":"Wiener, M. (ed.): CRYPTO 1999. LNCS, vol. 1666. Springer, Heidelberg (1999). doi:10.1007\/3-540-48405-1. ISBN 3-540-66347-9. MR 2000h:94003. See [13]"},{"key":"18_CR55","first-page":"225","volume":"39","author":"HC Williams","year":"1982","unstructured":"Williams, H.C.: A $$p+1$$ method of factoring. Math. Comput. 39, 225\u2013234 (1982). MR 83h:10016. Citations in this document: \u00a72","journal-title":"Math. Comput."},{"key":"18_CR56","unstructured":"Zalka, C.: Fast versions of Shor\u2019s quantum factoring algorithm (1998). https:\/\/arxiv.org\/abs\/quant-ph\/9806084. Citations in this document: \u00a72, \u00a74"},{"key":"18_CR57","unstructured":"Zimmermann, P.: About memory-usage of mpz_mul (2016). https:\/\/gmplib.org\/list-archives\/gmp-discuss\/2016-June\/006009.html. Citations in this document: \u00a7A"}],"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-319-59879-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:34:47Z","timestamp":1750289687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59879-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319598789","9783319598796"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59879-6_18","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":"4 June 2017","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 Workshop on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"26 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2017.pqcrypto.org\/conference\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}