{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:07:13Z","timestamp":1743098833482,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727378"},{"type":"electronic","value":"9783540727385"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72738-5_27","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T20:36:01Z","timestamp":1182544561000},"page":"420-431","source":"Crossref","is-referenced-by-count":0,"title":["Compressed XTR"],"prefix":"10.1007","author":[{"given":"Masaaki","family":"Shirase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong-Guk","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasushi","family":"Hibino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho Won","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013369. Springer, Heidelberg (2002)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","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":"Brouwer, A.E., Pellikaan, R., Verheul, E.R.: Doing More with Fewer Bits. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 321\u2013332. Springer, Heidelberg (1999)"},{"key":"27_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (1993)"},{"issue":"4","key":"27_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public Key Cryptosystem and a Signature scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"27_CR5","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1109\/18.796413","volume":"45","author":"G. Gong","year":"1999","unstructured":"Gong, G., Harn, L.: Public key cryptosystems based on cubic finite field extensions. IEEE Transactions on Information Theory\u00a045(7), 2601\u20132605 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Teechai, O., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2\n                    m\n                  ) using normal bases. Information and Computation\u00a078, 171\u2013177 (1988)","journal-title":"Information and Computation"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: The XTR Public Key System. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 1\u201320. Springer, Heidelberg (2000)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0027920","volume-title":"Information Security and Privacy","author":"A.K. Lenstra","year":"1997","unstructured":"Lenstra, A.K.: Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields. In: Mu, Y., Pieprzyk, J.P., Varadharajan, V. (eds.) ACISP 1997. LNCS, vol.\u00a01270, pp. 127\u2013138. Springer, Heidelberg (1997)"},{"key":"27_CR9","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0000447","volume-title":"Advances in Cryptology - ASIACRYPT \u201994","author":"P. Smith","year":"1995","unstructured":"Smith, P., Skinner, C.: A Public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol.\u00a0917, pp. 357\u2013364. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72738-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:48:52Z","timestamp":1558259332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72738-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727378","9783540727385"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72738-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}