{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T03:05:55Z","timestamp":1794539155917,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662543641","type":"print"},{"value":"9783662543658","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54365-8_15","type":"book-chapter","created":{"date-parts":[[2017,2,25]],"date-time":"2017-02-25T04:12:23Z","timestamp":1487995943000},"page":"361-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On the Bit Security of Elliptic Curve Diffie\u2013Hellman"],"prefix":"10.1007","author":[{"given":"Barak","family":"Shani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,2,26]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-40974-8_21","volume-title":"Cryptography and Coding","author":"SR Blackburn","year":"2003","unstructured":"Blackburn, S.R., Gomez-Perez, D., Gutierrez, J., Shparlinski, I.E.: Predicting the inversive generator. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 264\u2013275. Springer, Heidelberg (2003). doi:\n                      10.1007\/978-3-540-40974-8_21"},{"issue":"251","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1090\/S0025-5718-04-01698-9","volume":"74","author":"SR Blackburn","year":"2005","unstructured":"Blackburn, S.R., Gomez-Perez, D., Gutierrez, J., Shparlinski, I.E.: Predicting nonlinear pseudorandom number generators. Math. Comput. 74(251), 1471\u20131494 (2005)","journal-title":"Math. Comput."},{"issue":"2\u20133","key":"15_CR4","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.jco.2004.01.002","volume":"20","author":"IF Blake","year":"2004","unstructured":"Blake, I.F., Garefalakis, T.: On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complex. 20(2\u20133), 148\u2013170 (2004)","journal-title":"J. Complex."},{"issue":"6","key":"15_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00200-005-0184-x","volume":"16","author":"IF Blake","year":"2006","unstructured":"Blake, I.F., Garefalakis, T., Shparlinski, I.E.: On the bit security of the Diffie-Hellman key. Appl. Algebra Eng. Commun. Comput. 16(6), 397\u2013404 (2006)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D Boneh","year":"1998","unstructured":"Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48\u201363. Springer, Heidelberg (1998). doi:\n                      10.1007\/BFb0054851"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-45682-1_3","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Halevi, S., Howgrave-Graham, N.: The modular inversion hidden number problem. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 36\u201351. Springer, Heidelberg (2001). doi:\n                      10.1007\/3-540-45682-1_3"},{"key":"15_CR8","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:\n                      10.1007\/3-540-44647-8_12"},{"key":"15_CR9","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 \u201996","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:\n                      10.1007\/3-540-68697-5_11"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"15_CR11","series-title":"Progress in Computer Science and Applied Logic","first-page":"227","volume-title":"Proceedings of Workshop on Cryptography and Computational Number Theory 1999","author":"MI Gonz\u00e1lez Vasco","year":"2001","unstructured":"Gonz\u00e1lez Vasco, M.I., N\u00e4slund, M.: A survey of hard core functions. In: Lam, K.-Y., Shparlinski, I., Wang, H., Xing, C. (eds.) Proceedings of Workshop on Cryptography and Computational Number Theory 1999. Progress in Computer Science and Applied Logic, pp. 227\u2013255. Birkh\u00e4user, Basel (2001)"},{"key":"15_CR12","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 bits. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 159\u2013172. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-24632-9_12"},{"key":"15_CR13","series-title":"Progress in Computer Science and Applied Logic","first-page":"257","volume-title":"Proceedings of Workshop on Cryptography and Computational Number Theory 1999","author":"MI Gonz\u00e1lez Vasco","year":"2001","unstructured":"Gonz\u00e1lez Vasco, M.I., Shparlinski, I.E.: On the security of Diffie-Hellman bits. In: Lam, K.-Y., Shparlinski, I., Wang, H., Xing, C. (eds.) Proceedings of Workshop on Cryptography and Computational Number Theory 1999. Progress in Computer Science and Applied Logic, pp. 257\u2013268. Birkh\u00e4user, Basel (2001)"},{"key":"15_CR14","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:\n                      10.1007\/978-3-540-77026-8_4"},{"key":"15_CR15","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:\n                      10.1007\/978-3-540-85174-5_5"},{"key":"15_CR16","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:\n                      10.1007\/3-540-45708-9_28"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.jsc.2011.09.002","volume":"47","author":"S Ling","year":"2012","unstructured":"Ling, S., Shparlinski, I.E., Steinfeld, R., Wang, H.: On the modular inversion hidden number problem. J. Symbolic Comput. 47(4), 358\u2013367 (2012)","journal-title":"J. Symbolic Comput."},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/100811970","volume":"42","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. SIAM J. Comput. 42(3), 1364\u20131391 (2013)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"PQ Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptol. 15(3), 151\u2013176 (2002)","journal-title":"J. Cryptol."},{"issue":"2\u20133","key":"15_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53(2\u20133), 201\u2013224 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR21","unstructured":"Shani, B.: On the bit security of elliptic curve Diffie-Hellman. In: Cryptology ePrint Archive, Report 2016\/1189 (2016). \n                      http:\/\/eprint.iacr.org\/2016\/1189"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Shparlinski, I.E.: Sparse polynomial approximation in finite fields. In: Proceedings of 33rd ACM Symposium on Theory of Computing - STOC 2001, pp. 209\u2013215. ACM, New York (2001)","DOI":"10.1145\/380752.380803"},{"key":"15_CR23","unstructured":"Shparlinski, I.E.: Playing \u201cHide-and-Seek\u201d in finite fields: hidden number problem and its applications. In: Proceedings of 7th Spanish Meeting on Cryptology and Information Security, pp. 49\u201372 (2002)"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Shparlinski, I.E.: Playing \u201cHide-and-Seek\u201d with numbers: the hidden number problem, lattices and exponential sums. In: Garrett, P., Lieman, D. (eds.) Public-Key Cryptography; Proceedings of Symposia in Applied Mathematics, vol. 62, pp. 153\u2013177. AMS (2005)","DOI":"10.1090\/psapm\/062\/2211876"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-46588-1_18","volume-title":"Public Key Cryptography","author":"ER Verheul","year":"2000","unstructured":"Verheul, E.R.: Certificates of recoverability with scalable recovery agent security. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 258\u2013275. Springer, Heidelberg (2000). doi:\n                      10.1007\/978-3-540-46588-1_18"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54365-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,23]],"date-time":"2020-02-23T20:09:56Z","timestamp":1582488596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54365-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662543641","9783662543658"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54365-8_15","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-662-54365-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"26 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Workshop on Public Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iacr.org\/workshops\/pkc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}