{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:52:29Z","timestamp":1743069149600,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006220"},{"type":"electronic","value":"9783540364924"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/3-540-36492-7_24","type":"book-chapter","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T19:36:10Z","timestamp":1193168170000},"page":"369-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Extension Fields for XTR"],"prefix":"10.1007","author":[{"given":"Dong-Guk","family":"Han","sequence":"first","affiliation":[]},{"given":"Ki Soon","family":"Yoon","sequence":"additional","affiliation":[]},{"given":"Young-Ho","family":"Park","sequence":"additional","affiliation":[]},{"given":"Chang Han","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Jongin","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"24_CR1","volume-title":"The Design and Analysis of Computer Algorithms.","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J., The Design and Analysis of Computer Algorithms., Addison-Wesley, Reading Mass,1974."},{"key":"24_CR2","volume-title":"Algorithmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E, Shallit, J., Algorithmic Number Theory., Vol 1, The MIT Press, Mass, 1996."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bailey. D.V. and Paar C, Optimal extension fields for fast arithmetic in public-key algorithms., Crypto\u2019 98, Springer-Verlag pp.472\u2013485, 1998.","DOI":"10.1007\/BFb0055748"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1090\/S0025-5718-1987-0866102-2","volume":"48","author":"H. Cohen","year":"1987","unstructured":"H. Cohen, A.K. Lenstra, Implementation of a new primality test., Math.Comp.48 (1987) 103\u2013121.","journal-title":"Math.Comp."},{"key":"24_CR5","unstructured":"D.E. Knuth, The art of computer programming., Volume 2, Seminumerical Algorithms, second edition, Addison-Wesley, 1981."},{"key":"24_CR6","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"The XTR public key system","author":"A.K. Lenstra","year":"2000","unstructured":"A.K. Lenstra, E.R. Verheul, The XTR public key system., Proceedings of Crypto 2000, LNCS 1880,Springer-Verlag, 2000,1\u201319; available from \nhttp:\/\/www.ecstr.com\n\n."},{"key":"24_CR7","series-title":"Lect Notes Comput Sci","first-page":"127","volume-title":"Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields","author":"A.K. Lenstra","year":"1997","unstructured":"A.K. Lenstra, Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields., Proceedings of ACISP 1997, LNCS 1270,Springer-Verlag, 1997,127\u2013138."},{"key":"24_CR8","unstructured":"A.K. Lenstra, Lip 1.1, available at \nhttp:\/\/www.ecstr.com\n\n."},{"key":"24_CR9","series-title":"Lect Notes Comput Sci","first-page":"317","volume-title":"XTR Extended to GF(p6m)","author":"S. Lim","year":"2001","unstructured":"Seongan Lim, Seungjoo Kim, Ikkwon Yie, Jaemoon Kim, Hongsub Lee, XTR Extended to GF(p\n6m). Procee dings of SAC 2001,317\u2013328, LNCS 2259, Springer-Verlag, 2001,125-143."},{"key":"24_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-45682-1_8","volume-title":"Speeding Up XTR","author":"M. Stam","year":"2001","unstructured":"Martijn Stam, A.K. Lenstra, Speeding Up XTR. Proceedings of Asiacrypt 2001, LNCS 2248, Springer-Verlag, 2001,125\u2013143; available from \nhttp:\/\/www.ecstr.com\n\n."},{"key":"24_CR11","unstructured":"A.J Menezes, Applications of Finite Fields., Waterloo, 1993."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1049\/el:19850536","volume":"21917","author":"S.B. Mohan","year":"1985","unstructured":"S.B. Mohan and B.S. Adiga, Fast Algorithms for Implementating RSA Public Key Cryptosystem., Electronics Letters, 21917):761,1985.","journal-title":"Electronics Letters"},{"key":"24_CR13","unstructured":"S. Oh, S. Hong, D. Cheon, C. Kim, J. Lim and M. Sung, An Extension Field of Characteristic Greater than Two and its Applicatins. Technical Report 99-2, CIST,1999. Available from \nhttp:\/\/cist.korea.ac.kr\/\n\n."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36492-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T03:04:24Z","timestamp":1579143864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36492-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006220","9783540364924"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36492-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"17 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}