{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T10:20:19Z","timestamp":1772878819394,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540851738","type":"print"},{"value":"9783540851745","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85174-5_5","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T12:32:02Z","timestamp":1219235522000},"page":"75-92","source":"Crossref","is-referenced-by-count":9,"title":["Bits Security of the Elliptic Curve Diffie\u2013Hellman Secret Keys"],"prefix":"10.1007","author":[{"given":"Dimitar","family":"Jetchev","sequence":"first","affiliation":[]},{"given":"Ramarathnam","family":"Venkatesan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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 - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Shparlinski, I.: On the unpredictability of bits of elliptic curve Diffie-Hellman scheme. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 201\u2013212. Springer, Heidelberg (2001)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology - 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.\u00a01109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of elliptic and hyperelliptic curve cryptography, Theory and Practice (2005)","DOI":"10.1201\/9781420034981"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Deuring, M.: Die Typen der Multiplikatorenringe elliptischer Funktionenk\u00f6rpen, vol.\u00a014, pp. 197\u2013272. Abh. Math. Sem. Hansischen Univ (1941)","DOI":"10.1007\/BF02940746"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-45455-1_23","volume-title":"Algorithmic Number Theory","author":"M. Fouquet","year":"2002","unstructured":"Fouquet, M., Morain, F.: Isogeny volcanoes and the SEA algorithm. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 276\u2013291. Springer, Heidelberg (2002)"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1112\/S1461157000000097","volume":"2","author":"S.D. Galbraith","year":"1999","unstructured":"Galbraith, S.D.: Constructing isogenies between elliptic curves over finite fields. LMS J. Comput. Math.\u00a02, 118\u2013138 (1999) (electronic)","journal-title":"LMS J. Comput. Math."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46035-7_3","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Hess, F., Smart, N.P.: Extending the GHS Weil descent attack. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 29\u201344. Springer, Heidelberg (2002)"},{"issue":"237","key":"5_CR8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1090\/S0025-5718-01-01358-8","volume":"71","author":"M.I. Gonzalez Vasco","year":"2002","unstructured":"Gonzalez Vasco, M.I., Shparlinski, I.: Security of the most significant bits of the Shamir message passing scheme. Math. Comput.\u00a071(237), 333\u2013342 (2002)","journal-title":"Math. Comput."},{"key":"5_CR9","first-page":"115","volume-title":"CMS Conf. Proc.","author":"B.H. Gross","year":"1987","unstructured":"Gross, B.H.: Heights and the special values of L-series, Number theory (Montreal, Que., 1985). In: CMS Conf. Proc., vol.\u00a07, pp. 115\u2013187. Amer. Math. Soc., Providence (1987)"},{"issue":"243","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1090\/S0025-5718-03-01495-9","volume":"72","author":"N. Howgrave-Graham","year":"2003","unstructured":"Howgrave-Graham, N., Nguyen, P.Q., Shparlinski, I.: Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. Math. Comput.\u00a072(243), 1473\u20131485 (2003)","journal-title":"Math. Comput."},{"key":"5_CR11","first-page":"272","volume-title":"Proc. Sympos. Pure Math., Boulder, Colo., 1965","author":"Y. Ihara","year":"1966","unstructured":"Ihara, Y.: Discrete subgroups of ${\\rm PL}(2,\\,k\\sb{\\wp })$ , Algebraic Groups and Discontinuous Subgroups. In: Proc. Sympos. Pure Math., Boulder, Colo., 1965, vol.\u00a0IX, pp. 272\u2013278. Amer. Math. Soc., Providence (1966)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 security of certain partial Diffie\u2013Hellman secrets. In: Srinathan, K., Pandu Rangan, C., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859. Springer, Heidelberg (2007)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11593447_2","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"D. Jao","year":"2005","unstructured":"Jao, D., Miller, S.D., Venkatesan, R.: Do all elliptic curves of the same order have the same difficulty of discrete log? In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 21\u201340. Springer, Heidelberg (2005)"},{"key":"5_CR14","unstructured":"Kohel, D.: Endomorphism rings of elliptic curves over finite fields. University of California, Berkeley, Ph.D. thesis (1996)"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Ann. of Math\u00a0126(2), 649\u2013673 (1987)","journal-title":"Ann. of Math"},{"key":"5_CR16","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","volume-title":"Handbook of applied cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Inc., Boca Raton (1996)"},{"key":"5_CR17","unstructured":"Mestre, J.-F.: La m\u00e9thode des graphes. Exemples et applications. In: Proceedings of the international conference on class numbers and fundamental units of algebraic number fields (Katata), pp. 217\u2013242 (1986)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: The dark side of the hidden number problem: Lattice attacks on DSA. In: Proc. Workshop on Cryptography and Computational Number Theory, pp. 321\u2013330 (2001)","DOI":"10.1007\/978-3-0348-8295-8_23"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptology\u00a015(3), 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1025436905711","volume":"30","author":"P.Q. Nguyen","year":"2003","unstructured":"Nguyen, P.Q., Shparlinski, I.: The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Des. Codes Cryptography\u00a030(2), 201\u2013217 (2003)","journal-title":"Des. Codes Cryptography"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1090\/S0273-0979-1990-15918-X","volume":"23","author":"A.K. Pizer","year":"1990","unstructured":"Pizer, A.K.: Ramanujan graphs and Hecke operators. Bull. Amer. Math. Soc (N.S.)\u00a023(1), 127\u2013137 (1990)","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"key":"5_CR22","first-page":"159","volume-title":"AMS\/IP Stud. Adv. Math.","author":"A.K. Pizer","year":"1998","unstructured":"Pizer, A.K.: Ramanujan graphs, Computational perspectives on number theory (Chicago, IL, 1995). In: AMS\/IP Stud. Adv. Math., vol.\u00a07, pp. 159\u2013178. Amer. Math. Soc., Providence (1998)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45624-4_28","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"I. Shparlinski","year":"2001","unstructured":"Shparlinski, I.: On the generalized hidden number problem and bit security of XTR. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol.\u00a02227, pp. 268\u2013277. Springer, Heidelberg (2001)"},{"key":"5_CR25","series-title":"PCS","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8037-4","volume-title":"Cryptographic applications of analytic number theory: Complexity lower bounds and pseudorandomness","author":"I. Shparlinski","year":"2003","unstructured":"Shparlinski, I.: Cryptographic applications of analytic number theory: Complexity lower bounds and pseudorandomness. PCS, vol.\u00a022. Birkh\u00e4user, Basel (2003)"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"2073","DOI":"10.1090\/S0025-5718-05-01797-7","volume":"74","author":"I. Shparlinski","year":"2005","unstructured":"Shparlinski, I., Winterhof, A.: A hidden number problem in small subgroups. Math. Comp.\u00a074, 2073\u20132080 (2005)","journal-title":"Math. Comp."},{"key":"5_CR27","volume-title":"The arithmetic of elliptic curves","author":"J.H. Silverman","year":"1992","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves. Springer, New York (1992)"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01404549","volume":"2","author":"J. Tate","year":"1966","unstructured":"Tate, J.: Endomorphisms of abelian varieties over finite fields. Invent. Math.\u00a02, 134\u2013144 (1966)","journal-title":"Invent. Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85174-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:22:32Z","timestamp":1606184552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85174-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}