{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:11:25Z","timestamp":1769314285488,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642174544","type":"print"},{"value":"9783642174551","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17455-1_18","type":"book-chapter","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T15:31:49Z","timestamp":1290007909000},"page":"278-297","source":"Crossref","is-referenced-by-count":12,"title":["Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time"],"prefix":"10.1007","author":[{"given":"Jean-Gabriel","family":"Kammerer","sequence":"first","affiliation":[]},{"given":"Reynald","family":"Lercier","sequence":"additional","affiliation":[]},{"given":"Gu\u00e9na\u00ebl","family":"Renault","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"203","key":"18_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A.O.L. Atkin","year":"1993","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Mathematics of Computation\u00a061(203), 29\u201368 (1993)","journal-title":"Mathematics of Computation"},{"key":"18_CR2","unstructured":"Bersntein, D.J., Kohel, D., Lange, T.: Twisted Hessian curves, \n                    \n                      http:\/\/www.hyperelliptic.org\/EFD\/g1p\/auto-twistedhessian.html"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"issue":"10","key":"18_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2307\/2969571","volume":"15","author":"R.L. Borger","year":"1908","unstructured":"Borger, R.L.: On De Moivre\u2019s quintic. The American Mathematical Monthly\u00a015(10), 171\u2013174 (1908)","journal-title":"The American Mathematical Monthly"},{"issue":"3\/4","key":"18_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma Algebra System I: The user language. J. Symb. Comput.\u00a024(3\/4), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-14623-7_13","volume-title":"CRYPTO 2010","author":"E. Brier","year":"2010","unstructured":"Brier, E., Coron, J.-S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient indifferentiable hashing into ordinary elliptic curves. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 237\u2013254. Springer, Heidelberg (2010), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/340\/"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"2831","DOI":"10.1090\/S0002-9947-07-04111-6","volume":"359","author":"G. Cardona","year":"2007","unstructured":"Cardona, G., Quer, J.: Curves of genus 2 with group of automorphisms isomorphic to D\n                  8 or D\n                  12. Trans. Amer. Math. Soc.\u00a0359, 2831\u20132849 (2007)","journal-title":"Trans. Amer. Math. Soc."},{"key":"18_CR8","volume-title":"Pure and Applied Mathematics (New York)","author":"D.A. Cox","year":"2004","unstructured":"Cox, D.A.: Galois theory. In: Pure and Applied Mathematics (New York). Wiley-Interscience [John Wiley & Sons], Hoboken (2004)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-13013-7_15","volume-title":"PKC 2010","author":"R.R. Farashahi","year":"2010","unstructured":"Farashahi, R.R., Joye, M.: Efficient Arithmetic on Hessian Curves. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 243\u2013260. Springer, Heidelberg (2010)"},{"key":"18_CR10","unstructured":"Farashahi, R.R., Fouque, P.-A., Shparlinski, I.E., Tibouchi, M., Felipe Voloch, J.: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Preprint (2010), \n                    \n                      http:\/\/www.ma.utexas.edu\/users\/voloch\/Preprints\/welldistributed.pdf"},{"key":"18_CR11","unstructured":"Farashahi, R.R.: Hashing into hessian curves. Cryptology ePrint Archive, Report 2010\/373 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Tibouchi, M.: Deterministic encoding and hashing to odd hyperelliptic curves. Cryptology ePrint Archive, Report 2010\/382 (2010), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-17455-1_17"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-03356-8_18","volume-title":"CRYPTO 2009","author":"T. Icart","year":"2009","unstructured":"Icart, T.: How to Hash into Elliptic Curves. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 303\u2013316. Springer, Heidelberg (2009)"},{"key":"18_CR14","unstructured":"Waterloo\u00a0Maple Incorporated. Maple. Waterloo, Ontario, Canada, \n                    \n                      http:\/\/www.maplesoft.com\/"},{"key":"18_CR15","volume-title":"Rational Algebraic Curves: A Computer Algebra Approach","author":"J.R. Sendra","year":"2007","unstructured":"Sendra, J.R., Winkler, F., Prez-Diaz, S.: Rational Algebraic Curves: A Computer Algebra Approach. Springer Publishing Company, Incorporated, Heidelberg (2007)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/11792086_36","volume-title":"Algorithmic Number Theory","author":"A. Shallue","year":"2006","unstructured":"Shallue, A., van de Woestijne, C.: Construction of Rational Points on Elliptic Curves over Finite Fields. In: Hess, F., Pauli, S., Pohst, M.E. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 510\u2013524. Springer, Heidelberg (2006)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Ulas, M.: Rational points on certain hyperelliptic curves over finite fields. Bull. Polish Acad. Sci. Math.\u00a0(55), 97\u2013104 (2007)","DOI":"10.4064\/ba55-2-1"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography - Pairing 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17455-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:15:52Z","timestamp":1558307752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17455-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174544","9783642174551"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17455-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}