{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T07:58:36Z","timestamp":1777103916738,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540744610","type":"print"},{"value":"9783540744627","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-74462-7_9","type":"book-chapter","created":{"date-parts":[[2007,9,13]],"date-time":"2007-09-13T02:37:28Z","timestamp":1189651048000},"page":"114-133","source":"Crossref","is-referenced-by-count":12,"title":["Extended Hidden Number Problem and Its Cryptanalytic Applications"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hlav\u00e1\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Rosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Digital signature standard. National Institute of Standards and Technology, Washington (Note: Federal Information Processing Standard 186-2) (2000), URL: \n                      \n                        http:\/\/csrc.nist.gov\/publications\/fips\/"},{"key":"9_CR2","unstructured":"Secure hash standard. National Institute of Standards and Technology, Washington (Note: Federal Information Processing Standard 180-2) (2002), URL: \n                      \n                        http:\/\/csrc.nist.gov\/publications\/fips\/"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0023990","volume-title":"STACS 1985","author":"L. Babai","year":"1984","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. In: Mehlhorn, K. (ed.) STACS 1985. LNCS, vol.\u00a0182, pp. 13\u201320. Springer, Heidelberg (1984)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BFb0052242","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Goldwasser, S., Micciancio, D.: \u201dPseudo-Random\u201d number generation within cryptographic algorithms: The DDS case. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 277\u2013291. Springer, Heidelberg (1997)"},{"key":"9_CR5","volume-title":"Computer Security: Art and Science","author":"M. Bishop","year":"2003","unstructured":"Bishop, M.: Computer Security: Art and Science. Addison-Wesley, Reading (2003)"},{"key":"9_CR6","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 - 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.\u00a02248, pp. 36\u201351. Springer, Heidelberg (2001)"},{"key":"9_CR7","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)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0217016","volume":"17","author":"A.M. Frieze","year":"1988","unstructured":"Frieze, A.M., Hastad, J., Kannan, R., Lagarias, J.C., Shamir, A.: Reconstructing truncated integer variables satisfying linear congruences. SIAM Journal of Computing\u00a017(2), 262\u2013280 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Groetschel","year":"1993","unstructured":"Groetschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N.-A. Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.-A., Smart, N.P.: Lattice attacks on digital signature schemes. Design, Codes and Cryptography\u00a023, 283\u2013290 (2001)","journal-title":"Design, Codes and Cryptography"},{"key":"9_CR11","unstructured":"Intel Corporation. Intel(R) Pentium(R) 4 Processor supporting Hyper-Threading Technology. URL: \n                      \n                        http:\/\/www.intel.com\/products\/processor\/pentium4\/index.htm"},{"key":"9_CR12","first-page":"513","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Ann.\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Ann."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: The dark side of the hidden number problem: Lattice attacks on DSA. In: CCNT 1999. Proc. of the Workshop on Cryptography and Computational Number Theory, Basel, CH, pp. 321\u2013330. Birkh\u00e4user (2001)","DOI":"10.1007\/978-3-0348-8295-8_23"},{"issue":"3","key":"9_CR14","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"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11605805_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"D.A. Osvik","year":"2006","unstructured":"Osvik, D.A., Shamir, A., Tromer, E.: Cache attacks and countermeasures: The case of AES. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"9_CR18","unstructured":"Percival, C.: Cache missing for fun and profit (2005), URL: \n                      \n                        http:\/\/www.daemonology.net\/papers\/htt.pdf"},{"key":"9_CR19","unstructured":"OpenBSD project members. OpenSSH Suite. URL: \n                      \n                        http:\/\/www.openssh.com\/"},{"key":"9_CR20","unstructured":"Shoup, V.: NTL: A Library for doing Number Theory. URL: \n                      \n                        http:\/\/www.shoup.net\/ntl\/"},{"issue":"252","key":"9_CR21","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. Mathematics of Computation\u00a074(252), 2073\u20132080 (2005)","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74462-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:43:58Z","timestamp":1558475038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74462-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744610","9783540744627"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74462-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}