{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:11Z","timestamp":1740098951042,"version":"3.37.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319686363"},{"type":"electronic","value":"9783319686370"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68637-0_13","type":"book-chapter","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T06:07:56Z","timestamp":1508134076000},"page":"219-235","source":"Crossref","is-referenced-by-count":1,"title":["Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem"],"prefix":"10.1007","author":[{"given":"Fangguo","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,17]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-58691-1_39","volume-title":"Algorithmic Number Theory","author":"LM Adleman","year":"1994","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.-D.: A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, pp. 28\u201340. Springer, Heidelberg (1994). doi:\n10.1007\/3-540-58691-1_39"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: FOCS 2003, pp. 146\u2013157. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238189"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17, 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"key":"13_CR4","volume-title":"Handbook of Elliptic and Hyperelliptic Cryptography","author":"R Avanzi","year":"2006","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, Boca Raton (2006)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-662-45611-8_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"DJ Bernstein","year":"2014","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T., Schwabe, P.: Kummer strikes back: new DH speed records. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 317\u2013337. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-45611-8_17"},{"issue":"4","key":"13_CR6","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-44647-8_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Shparlinski, I.E.: On the unpredictability of bits of the elliptic curve Diffie-Hellman scheme. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 201\u2013212. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-44647-8_12"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 1996","author":"D Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in diffie-hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 129\u2013142. Springer, Heidelberg (1996). doi:\n10.1007\/3-540-68697-5_11"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-45682-1_30"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-38348-9_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"JW Bos","year":"2013","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: Fast cryptography in genus 2. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 194\u2013210. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-38348-9_12"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"DG Cantor","year":"1987","unstructured":"Cantor, D.G.: Computing in the Jacobian of a hyperelliptic curve. Math. Comput. 48, 95\u2013101 (1987)","journal-title":"Math. Comput."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-28496-0_6","volume-title":"Selected Areas in Cryptography","author":"C Costello","year":"2012","unstructured":"Costello, C., Lauter, K.: Group law computations on Jacobians of hyperelliptic curves. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 92\u2013117. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-28496-0_6"},{"key":"13_CR13","unstructured":"Diao, O., Joye, M.: Unified addition formul\u00e6 for hyperelliptic curve cryptosystems. In: The 3rd International Conference on Symbolic Computation and Cryptography (SCC 2012), pp. 45\u201350 (2012)"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theor. 22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-642-32009-5_48","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"A Duc","year":"2012","unstructured":"Duc, A., Jetchev, D.: Hardness of computing individual bits for one-way functions on elliptic curves. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 832\u2013849. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-32009-5_48"},{"key":"13_CR16","doi-asserted-by":"crossref","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 Trans. Inf. Theor. 31, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"13_CR17","unstructured":"FIPS 186\u20132, Digital signature standard, Federal Information Processing Standards Publication 186\u20132, February 2000"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-40084-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"N Fazio","year":"2013","unstructured":"Fazio, N., Gennaro, R., Perera, I.M., Skeith III, W.E.: Hard-core predicates for a Diffie-Hellman problem over finite fields. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 148\u2013165. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-40084-1_9"},{"key":"13_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139012843","volume-title":"Mathematics of Public Key Cryptography","author":"SD Galbraith","year":"2012","unstructured":"Galbraith, S.D.: Mathematics of Public Key Cryptography. Cambridge University Press, Cambridge (2012)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-27800-9_32","volume-title":"Information Security and Privacy","author":"SD Galbraith","year":"2004","unstructured":"Galbraith, S.D., Hopkins, H.J., Shparlinski, I.E.: Secure bilinear Diffie-Hellman bits. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 370\u2013378. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-27800-9_32"},{"issue":"3","key":"13_CR21","first-page":"243","volume":"1","author":"P Gaudry","year":"2007","unstructured":"Gaudry, P.: Fast genus 2 arithmetic based on theta functions. J. Math. Crypt. JMC 1(3), 243\u2013265 (2007)","journal-title":"J. Math. Crypt. JMC"},{"issue":"257","key":"13_CR22","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P Gaudry","year":"2007","unstructured":"Gaudry, P., Thom\u00e9, E., Th\u00e9riault, N., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76(257), 475\u2013492 (2007)","journal-title":"Math. Comput."},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-24632-9_12","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"MI Gonz\u00e1lez Vasco","year":"2004","unstructured":"Gonz\u00e1lez Vasco, M.I., N\u00e4slund, M., Shparlinski, I.E.: New results on the hardness of Diffie-Hellman\u00a0bits. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 159\u2013172. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-24632-9_12"},{"key":"13_CR24","unstructured":"Harley, R.: Fast arithmetic on genus 2 curves. For C source code and further explanations. \nhttp:\/\/cristal.inria.fr\/~harley\/hyper"},{"issue":"2","key":"13_CR25","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/972639.972642","volume":"51","author":"J H\u0227stad","year":"2004","unstructured":"H\u0227stad, J., N\u00e4slund, M.: The security of all RSA and discrete log bits. J. ACM 51(2), 187\u2013230 (2004)","journal-title":"J. ACM"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-662-45611-8_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"H Hisil","year":"2014","unstructured":"Hisil, H., Costello, C.: Jacobian coordinates on genus 2 curves. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 338\u2013357. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-45611-8_18"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-77026-8_4","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"D Jao","year":"2007","unstructured":"Jao, D., Jetchev, D., Venkatesan, R.: On the bits of elliptic curve Diffie-Hellman keys. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 33\u201347. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-77026-8_4"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-85174-5_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D Jetchev","year":"2008","unstructured":"Jetchev, D., Venkatesan, R.: Bits security of the elliptic curve Diffie\u2013Hellman secret keys. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 75\u201392. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-85174-5_5"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-44669-9_39","volume-title":"Fundamentals of Computation Theory","author":"E Kiltz","year":"2001","unstructured":"Kiltz, E.: A primitive for proving the security of every bit and about universal hash functions and hard core bits. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 388\u2013391. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-44669-9_39"},{"key":"13_CR30","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptography. J. Crypt. 1, 139\u2013150 (1989)","journal-title":"J. Crypt."},{"issue":"5","key":"13_CR31","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s00200-004-0154-8","volume":"15","author":"T Lange","year":"2005","unstructured":"Lange, T.: Formulae for arithmetic on genus 2 hyperelliptic curves. Appl. Algebra Eng. Commun. Comput. 15(5), 295\u2013328 (2005)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-45708-9_28","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"W-CW Li","year":"2002","unstructured":"Li, W.-C.W., N\u00e4slund, M., Shparlinski, I.E.: Hidden number problem with the trace and bit security of XTR and LUC. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 433\u2013448. Springer, Heidelberg (2002). doi:\n10.1007\/3-540-45708-9_28"},{"key":"13_CR33","unstructured":"MAGMA Computational Algebra System. \nhttp:\/\/magma.maths.usyd.edu.au\/magma\/"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"UM Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271\u2013281. Springer, Heidelberg (1994). doi:\n10.1007\/3-540-48658-5_26"},{"issue":"5","key":"13_CR35","doi-asserted-by":"crossref","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"UM Maurer","year":"1999","unstructured":"Maurer, U.M., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM J. Comput. 28(5), 1689\u20131721 (1999)","journal-title":"SIAM J. Comput."},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-00468-1_2","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"P Morillo","year":"2009","unstructured":"Morillo, P., R\u00e0fols, C.: The security of all bits using list decoding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 15\u201333. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-00468-1_2"},{"key":"13_CR37","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"SC Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theor. 24, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-662-54365-8_15","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"B Shani","year":"2017","unstructured":"Shani, B.: On the bit security of elliptic curve Diffie\u2013Hellman. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 361\u2013387. Springer, Heidelberg (2017). doi:\n10.1007\/978-3-662-54365-8_15"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-319-31301-6_25","volume-title":"Selected Areas in Cryptography - SAC 2015","author":"M Wang","year":"2016","unstructured":"Wang, M., Zhan, T., Zhang, H.: Bit security of the CDH problems over finite fields. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 441\u2013461. Springer, Cham (2016). doi:\n10.1007\/978-3-319-31301-6_25"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68637-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T06:11:11Z","timestamp":1508134271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68637-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319686363","9783319686370"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68637-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}