{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:17:37Z","timestamp":1725495457620},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430100"},{"type":"electronic","value":"9783540453116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45311-3_29","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T14:01:41Z","timestamp":1195048901000},"page":"308-315","source":"Crossref","is-referenced-by-count":0,"title":["Comments on a Signature Scheme Based on the Third Order LFSR Proposed at ACISP2001"],"prefix":"10.1007","author":[{"given":"Seongan","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seungjoo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ikkwon","family":"Yie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaemoon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"key":"29_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-540-48000-6_26","volume-title":"Advances in Cryptology-Asiacrypt\u201999","author":"A. E. Brouwer","year":"1999","unstructured":"A. E. Brouwer, R. Pellikaan, Eric R. Verheul, Doing More with Fewer Bits, Advances in Cryptology-Asiacrypt\u201999, LNCS 1716 (1999), pp. 321\u2013332."},{"key":"29_CR2","series-title":"Lect Notes Comput Sci","first-page":"127","volume-title":"ACISP\u201997","author":"A. K. Lenstra","year":"1997","unstructured":"Arjen K. Lenstra, Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields, ACISP\u201997 (1997), LNCS 1270, pp. 127\u2013138."},{"key":"29_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology-CRYPTO\u201900","author":"A. K. Lenstra","year":"2000","unstructured":"Arjen K. Lenstra, Eric R. Verheul, The XTRpublic key system, Advances in Cryptology-CRYPTO\u201900 LNCS 1880 (2000), pp. 1\u201319"},{"key":"29_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-44448-3_17","volume-title":"Advances in Cryptology-Asiacrypt\u201900","author":"A. K. Lenstra","year":"2000","unstructured":"Arjen K. Lenstra, Eric R. Verheul, Key improvements to XTR, Advances in Cryptology-Asiacrypt\u201900 LNCS 1976 (2000), pp. 220\u2013233"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Arjen K. Lenstra, Eric R. Verheul, Selecting Cryptographic Key Sizes, http:\/\/www.cryptosavvy.com (1999).","DOI":"10.1007\/978-3-540-46588-1_30"},{"key":"29_CR6","series-title":"Lect Notes Comput Sci","first-page":"73","volume-title":"Fast irreduciblility and subgroup membership testing in XTR","author":"A. K. Lenstra","year":"2000","unstructured":"Arjen K. Lenstra, Eric R. Verheul, Fast irreduciblility and subgroup membership testing in XTR, Proceedings of the PKC\u201901 LNCS 1992 (2001), pp. 73\u201386"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Rudolf Lidl, Harald Niederreiter, Introduction to finite fields and their applications, Cambridge, 1994.","DOI":"10.1017\/CBO9781139172769"},{"key":"29_CR8","series-title":"Lect Notes Comput Sci","volume-title":"SAC\u201901","author":"S. Lim","year":"2001","unstructured":"Seongan Lim, Seungjoo Kim, Ikkwon Yie, Jaemoon Kim and Hongsub Lee, XTR Extended to GF(p 6m), to appear at SAC\u201901, LNCS (2001)."},{"key":"29_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-47719-5_35","volume-title":"ACISP\u201901","author":"C. H. Tan","year":"2001","unstructured":"Chik How Tan, Xun Yi and Chee Kheong Siew, Signature Schemes Based on 3rd Order Shift Registers, ACISP\u201901, LNCS 2119 (2001), pp.445\u2013459."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45311-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:18:03Z","timestamp":1556957883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45311-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430100","9783540453116"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45311-3_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}