{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:54:11Z","timestamp":1768521251392,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642147111","type":"print"},{"value":"9783642147128","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-14712-8_5","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T09:17:50Z","timestamp":1280395070000},"page":"81-91","source":"Crossref","is-referenced-by-count":17,"title":["Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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.K.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-47719-5_38","volume-title":"Information Security and Privacy","author":"C. Boyd","year":"2001","unstructured":"Boyd, C., Montague, P., Nguyen, K.Q.: Elliptic curve based password-authenticated key exchange protocols. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol.\u00a02119, pp. 487\u2013501. Springer, Heidelberg (2001)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-45539-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Boyko","year":"2000","unstructured":"Boyko, V., MacKenzie, P.D., Patel, S.: Provably secure password-authenticated key exchange using Diffie-Hellman. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 156\u2013171. Springer, Heidelberg (2000)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of CRYPTO 2010","author":"E. Brier","year":"2010","unstructured":"Brier, E., Coron, J.-S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient indifferentiable hashing to elliptic curves. In: Proceedings of CRYPTO 2010. LNCS. Springer, Heidelberg (2010)"},{"key":"5_CR5","series-title":"Series in Pure Mathematics","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033081","volume-title":"Galois theory","author":"D.A. Cox","year":"2004","unstructured":"Cox, D.A.: Galois theory. Series in Pure Mathematics. Wiley, Chichester (2004)"},{"key":"5_CR6","series-title":"Ergebnisse der Mathematik und ihre Grenzgebiete","volume-title":"Field arithmetic","author":"M.D. Fried","year":"2002","unstructured":"Fried, M.D., Jarden, M.: Field arithmetic, 2nd edn. Ergebnisse der Mathematik und ihre Grenzgebiete, vol.\u00a011. Springer, Heidelberg (2002)","edition":"2"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"C. Gentry","year":"2002","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 548\u2013566. Springer, Heidelberg (2002)"},{"issue":"10","key":"5_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1515\/JMC.2009.022","volume":"3","author":"R.R. Farashahi","year":"2009","unstructured":"Farashahi, R.R., Shparlinski, I., Voloch, J.F.: On hashing into elliptic curves. J. Math. Crypt.\u00a03(10), 353\u2013360 (2009)","journal-title":"J. Math. Crypt."},{"key":"5_CR9","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)"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.2307\/2323198","volume":"96","author":"L.C. Kappe","year":"1989","unstructured":"Kappe, L.C., Warren, B.: An elementary test for the Galois group of a quartic polynomial. Amer. Math. Monthly, Mathematical Association of America\u00a096(2), 133\u2013137 (1989)","journal-title":"Amer. Math. Monthly, Mathematical Association of America"},{"key":"5_CR11","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 Woestjine, C.: Construction of rational points on elliptic curves over finite fields. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 510\u2013524. Springer, Heidelberg (2006)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.4064\/aa117-3-7","volume":"117","author":"M. Ska\u0142ba","year":"2005","unstructured":"Ska\u0142ba, M.: Points on elliptic curves over finite fields. Acta Arith. impan\u00a0117, 293\u2013301 (2005)","journal-title":"Acta Arith. impan"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.4064\/ba55-2-1","volume":"55","author":"M. Ulas","year":"2007","unstructured":"Ulas, M.: Rational points on certain hyperelliptic curves over finite fields. Bull. Polish Acad. Sci. Math. impan\u00a055, 97\u2013104 (2007)","journal-title":"Bull. Polish Acad. Sci. Math. impan"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14712-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:49:41Z","timestamp":1558298981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14712-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642147111","9783642147128"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14712-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}