{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:24Z","timestamp":1772283684162,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","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":[[2000]]},"DOI":"10.1007\/3-540-44598-6_1","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":110,"title":["The XTR Public Key System"],"prefix":"10.1007","author":[{"given":"Arjen K.","family":"Lenstra","sequence":"first","affiliation":[]},{"given":"Eric R.","family":"Verheul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"1_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-48329-2_13","volume-title":"Proceedings Crypto\u201993","author":"L.M. Adleman","year":"1994","unstructured":"L.M. Adleman, J. DeMarrais, A subexponential algorithm for discrete logarithms over all finite fields, Proceedings Crypto\u201993, LNCS 773, Springer-Verlag 1994, 147\u2013158."},{"key":"1_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Proceedings Crypto\u201998","author":"D.V. Bailey","year":"1998","unstructured":"D.V. Bailey, C. Paar, Optimal extension fields for fast arithmetic in public-key algorithms, Proceedings Crypto\u201998, LNCS 1462, Springer-Verlag 1998, 472\u2013485."},{"key":"1_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-540-48000-6_26","volume-title":"Proceedings Asiacrypt99","author":"A.E. Brouwer","year":"1999","unstructured":"A.E. Brouwer, R. Pellikaan, E.R. Verheul, Doing more with fewer bits, Proceedings Asiacrypt99, LNCS 1716, Springer-Verlag 1999, 321\u2013332."},{"key":"1_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Proceedings Asiacrypt\u201998","author":"H. Cohen","year":"1998","unstructured":"H. Cohen, A. Miyaji, T. Ono, Efficient elliptic curve exponentiation using mixed coordinates, Proceedings Asiacrypt\u201998, LNCS 1514, Springer-Verlag 1998, 51\u201365."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D. Coppersmith","year":"1984","unstructured":"D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory 30 (1984), 587\u2013594.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1_CR6","unstructured":"D. Coppersmith, personal communication, March 2000."},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, A Public Key Cryptosystem and a Signature scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory 31(4), 1985, 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR8","unstructured":"P. Gaudry, F. Hess, N.P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, manuscript, January, 2000, submitted to Journal of Cryptology."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0406010","volume":"6","author":"D. Gordon","year":"1993","unstructured":"D. Gordon, Discrete logarithms in GF(p) using the number field sieve, SIAM J. Discrete Math. 6 (1993), 312\u2013323.","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR10","unstructured":"D.E. Knuth, The art of computer programming, Volume 2, Seminumerical Algorithms, second edition, Addison-Wesley, 1981."},{"key":"1_CR11","series-title":"Lect Notes Comput Sci","first-page":"127","volume-title":"Proceedings ACISP97","author":"A.K. Lenstra","year":"1997","unstructured":"A.K. Lenstra, Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields, Proceedings ACISP97, LNCS 1270, Springer-Verlag 1997, 127\u2013138."},{"key":"1_CR12","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings Asiacrypt\u2019 98","author":"A.K. Lenstra","year":"1998","unstructured":"A.K. Lenstra, Generating RSA moduli with a predetermined portion, Proceedings Asiacrypt\u2019 98, LNCS 1514, Springer-Verlag 1998, 1\u201310."},{"key":"1_CR13","unstructured":"A.K. Lenstra, E.R. Verheul, Key improvements to XTR, in preparation."},{"key":"1_CR14","unstructured":"A.J. Menezes, Comparing the security of ECC and RSA, manuscript, January, 2000, available as http:\/\/www.cacr.math.uwaterloo.ca\/ajmeneze\/misc\/cryptogramarticle.html ."},{"key":"1_CR15","unstructured":"A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of applied cryptography, CRC Press, 1997."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008350005447","volume":"19","author":"A.M. Odlyzko","year":"2000","unstructured":"A.M. Odlyzko, Discrete Logarithms: The past and the future, Designs, Codes and Cryptography, 19 (2000), 129\u2013145.","journal-title":"Designs, Codes and Cryptography"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S.C. Pohlig","year":"1978","unstructured":"S.C. Pohlig, M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. on IT, 24 (1978), 106\u2013110.","journal-title":"IEEE Trans. on IT"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"J.M. Pollard, Monte Carlo methods for index computation (mod p), Math. Comp., 32 (1978), 918\u2013924.","journal-title":"Math. Comp."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O. Schirokauer","year":"1993","unstructured":"O. Schirokauer, Discrete logarithms and local units, Phil. Trans. R. Soc. Lond. A 345, 1993, 409\u2013423.","journal-title":"Phil. Trans. R. Soc. Lond. A"},{"key":"1_CR20","unstructured":"O. Schirokauer, personal communication, March 2000."},{"key":"1_CR21","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings ANTS II","author":"O. Schirokauer","year":"1996","unstructured":"O. Schirokauer, D. Weber, Th.F. Denny, Discrete logarithms: the effectiveness of the index calculus method, Proceedings ANTS II, LNCS 1122 Springer-Verlag 1996."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, 4 (1991), 161\u2013174.","journal-title":"Journal of Cryptology"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00190758","volume":"8","author":"S.A. Vanstone","year":"1995","unstructured":"S.A. Vanstone, R.J. Zuccherato, Short RSA keys and their generation, Journal of Cryptology, 8 (1995), 101\u2013114.","journal-title":"Journal of Cryptology"},{"key":"1_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-46588-1_18","volume-title":"Proceedings of PKC 2000","author":"E. Verheul","year":"2000","unstructured":"E. Verheul, Certificates of recoverability with scalable recovery agent security, Proceedings of PKC 2000, LNCS 1751, Springer-Verlag 2000, 258\u2013275."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T16:34:19Z","timestamp":1587486859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"11 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}