{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:19:46Z","timestamp":1725902386743},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811054204"},{"type":"electronic","value":"9789811054211"}],"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-981-10-5421-1_5","type":"book-chapter","created":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T08:30:04Z","timestamp":1498120204000},"page":"48-57","source":"Crossref","is-referenced-by-count":0,"title":["Rounding Technique\u2019s Application in Schnorr Signature Algorithm: Known Partially Most Significant Bits of Nonce"],"prefix":"10.1007","author":[{"given":"Wenjie","family":"Qin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kewei","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,23]]},"reference":[{"key":"5_CR1","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 96","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":"5_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On lovasz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lovasz, L.: Factoring polynomial with rational coefficients. Mathematiche Annalen 261, 515\u2013534 (1982)","journal-title":"Mathematiche Annalen"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Gonzalez Vasco, M.I., Shpailinski, I.E.: On the security of diffie-hellman bits. In: Proceedings of the Workshop on Cryptography and Computational Number Theory, Singapore, Birkhauser, pp. 257\u2013268 (2001)","DOI":"10.1007\/978-3-0348-8295-8_19"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Gonzalez Vasco, M.I., Shpailinski, I.E.: Security of the most signficant bits of the shamir message passing scheme. Math. Comp. 71, 333\u2013342 (2002)","DOI":"10.1090\/S0025-5718-01-01358-8"},{"key":"5_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511542930","volume-title":"Charater Sums with Exponential Functions and their Applications","author":"SV Konyagin","year":"1999","unstructured":"Konyagin, S.V., Shpailinski, I.E.: Charater Sums with Exponential Functions and their Applications. Cambridge University Press, Cambridge (1999)"},{"key":"5_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":"5_CR8","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":"5_CR9","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":"5_CR10","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:\n10.1007\/3-540-45682-1_3"},{"issue":"4","key":"5_CR11","doi-asserted-by":"crossref","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."},{"key":"5_CR12","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, 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":"5_CR13","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: IEEE Symposium on Foundations of Computer Science-FOCS, pp. 146\u2013157 (2003)","DOI":"10.1109\/SFCS.2003.1238189"},{"key":"5_CR14","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":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-17470-9_15","volume-title":"Information Theoretic Security","author":"SD Galbraith","year":"2015","unstructured":"Galbraith, S.D., Shani, B.: The multivariate hidden number problem. In: Lehmann, A., Wolf, S. (eds.) ICITS 2015. LNCS, vol. 9063, pp. 250\u2013268. Springer, Cham (2015). doi:\n10.1007\/978-3-319-17470-9_15"},{"issue":"2","key":"5_CR16","first-page":"193","volume":"8","author":"T Garefalakis","year":"2007","unstructured":"Garefalakis, T.: The hidden number problem with non-prime modulus. JP J. Algebra Number Theory Appl. 8(2), 193\u2013211 (2007)","journal-title":"JP J. Algebra Number Theory Appl."},{"issue":"6","key":"5_CR17","first-page":"1020","volume":"33","author":"S Dong","year":"2010","unstructured":"Dong, S., Wang, K., Kewei, L.: The bit security of two variants of paillier trapdoor function. Chin. J. Comput. 33(6), 1020\u20131059 (2010)","journal-title":"Chin. J. Comput."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BFb0052242","volume-title":"Advances in Cryptology \u2014 CRYPTO 97","author":"M Bellare","year":"1997","unstructured":"Bellare, M., Goldwasser, S., Micciancio, D.: \u201cPseudo-random\u201d number generation within cryptographic algorithms: the DDS case. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 277\u2013291. Springer, Heidelberg (1997). doi:\n10.1007\/BFb0052242"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"NA Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.A., Smart, N.P.: Lattice attacks on digital signature schemes. Design Codes Cryptog. 23, 283\u2013290 (2001)","journal-title":"Design Codes Cryptog."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q.: The dark side of the hidden number problem: lattice attacks on DSA. In: Lam, K.-Y., Shparlinski, I.E., Wang, H., Xing, C. (eds.) Proceedings of the Workshop on Cryptography and Computational Number Theory (CCNT 1999), Singapore, pp. 321\u2013330. Birkhauser, Basel (2001)","DOI":"10.1007\/978-3-0348-8295-8_23"},{"issue":"3","key":"5_CR21","doi-asserted-by":"crossref","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. Cryptology 15(3), 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"key":"5_CR22","unstructured":"Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 675\u2013681. ACM (1997)"},{"key":"5_CR23","unstructured":"Dong, S., Kewei, L.: Research on the security of generalized SRA intelligence poker protocol based on hidden number problem. In: National Conference on Information Confidentiality (2008)"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smarts cards. J. Cryptology 4, 161\u2013174 (1991)","journal-title":"J. Cryptology"}],"container-title":["Communications in Computer and Information Science","Applications and Techniques in Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-5421-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T08:32:38Z","timestamp":1498120358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-5421-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811054204","9789811054211"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-5421-1_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}