{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:08Z","timestamp":1772283488858,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642215179","type":"print"},{"value":"9783642215186","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21518-6_8","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T07:34:59Z","timestamp":1310974499000},"page":"105-114","source":"Crossref","is-referenced-by-count":4,"title":["A Generalization of Verheul\u2019s Theorem for Some Ordinary Curves"],"prefix":"10.1007","author":[{"given":"Zhi","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maozhi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenghua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Cryptography. Chapman and Hall\/CRC (2006)","DOI":"10.1201\/9781420034981"},{"key":"8_CR2","unstructured":"Charles, D.: On the Existence of Distortion Maps on Ordinary Elliptic Curves. Cryptology ePrint Archive Report 2006\/128, http:\/\/eprint.iacr.org\/2006\/128\/"},{"key":"8_CR3","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1996","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Berlin (1996)"},{"key":"8_CR4","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.: A Remark Concerning m-divisibility and The Discrete Logarithm in The Divisor Class Group of Curves. Math. Comp.\u00a062, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptology\u00a023, 224\u2013280 (2010)","journal-title":"J. Cryptology"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"5719","DOI":"10.1109\/TIT.2008.2006431","volume":"12","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Hess, F., Vercauteren, F.: Aspects of Pairing Inversion. IEEE Trans. Inform. Theory\u00a012, 5719\u20135728 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for Cryptographers. Discrete Applied Mathematics\u00a0156, 3113\u20133121 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR8","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"8_CR9","series-title":"Grad. Texts in Math.","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A Classical Introduction to Modern Number Theory","author":"K. Ireland","year":"1990","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Grad. Texts in Math., vol.\u00a084. Springer, New York (1990)","edition":"2"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.J.: Pairing-Based Cryptography at High Security Levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A. Joux","year":"2004","unstructured":"Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. J. Cryptology\u00a017, 263\u2013276 (2004)","journal-title":"J. Cryptology"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"A. Joux","year":"2003","unstructured":"Joux, A., Nguyen, K.: Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups. J. Cryptology\u00a016, 239\u2013247 (2003)","journal-title":"J. Cryptology"},{"key":"8_CR13","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\u201319. Springer, Heidelberg (2000)"},{"key":"8_CR14","unstructured":"Miller, V.S.: Short Programs for Functions on Curves. Unpublished manuscript (1986)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil Pairing, and Its Efficient Calculation. J. Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10623-009-9287-x","volume":"52","author":"D. Moody","year":"2009","unstructured":"Moody, D.: The Diffie-Hellman Problem and Generalization of Verheuls Theorem. Des. Codes Cryptogr.\u00a052, 381\u2013390 (2009)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A.J. Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.A.: Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Trans. Inform. Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"J. Silverman","year":"1986","unstructured":"Silverman, J.: The Arithmetic of Elliptic Curves. Springer, New York (1986)"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(87)90003-3","volume":"46","author":"R. Schoof","year":"1987","unstructured":"Schoof, R.: Nonsingular Plane Cubic Curves over Finite Fields. J. Combinatorial Theory, Series A\u00a046(2), 183\u2013208 (1987)","journal-title":"J. Combinatorial Theory, Series A"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-44987-6_13","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"E.R. Verheul","year":"2001","unstructured":"Verheul, E.R.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 195\u2013210. Springer, Heidelberg (2001)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00145-004-0313-x","volume":"17","author":"R. Verheul","year":"2004","unstructured":"Verheul, R.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. J. Cryptology\u00a017, 277\u2013296 (2004)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21518-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T21:35:39Z","timestamp":1560375339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21518-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215179","9783642215186"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21518-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}