{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:19:43Z","timestamp":1776827983766,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429111","type":"print"},{"value":"9783540456247","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45624-4_28","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T23:23:35Z","timestamp":1180826615000},"page":"268-277","source":"Crossref","is-referenced-by-count":10,"title":["On the Generalised Hidden Number Problem and Bit Security of XTR"],"prefix":"10.1007","author":[{"given":"Igor E.","family":"Shparlinski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"28_CR1","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Hardness of computing the most significant bits of secret keys in Difie-Hellman and related schemes","author":"D. Boneh","year":"1996","unstructured":"D. Boneh and R. Venkatesan, Hardness of computing the most significant bits of secret keys in Difie-Hellman and related schemes, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 129\u2013142."},{"key":"28_CR2","unstructured":"D. Boneh and R. Venkatesan, Rounding in lattices and its cryptographic applications, Proc. 8th AnnualA CM-SIAM Symp. on Discr. Algorithms, ACM, NY, 1997, 675\u2013681."},{"key":"28_CR3","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-540-48000-6_26","volume-title":"Doing more with fewer bits","author":"A. E. Brouwer","year":"1999","unstructured":"A. E. Brouwer, R. Pellikaan and E. R. Verheul, Doing more with fewer bits, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1716(1999), 321\u2013332."},{"key":"28_CR4","first-page":"23","volume":"120","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, J. B. Friedlander, S. Konyagin, M. Larsen, D. Lieman and I. E. Shparlinski, On the statistical properties of Difie-Hellman distributions, IsraelJ. Math., 120 (2000), 23\u201346.","journal-title":"On the statistical properties of Difie-Hellman distributions"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"E. ElMahassni, P. Q. Nguyen and I. E. Shparlinski, The insecurity of Nyberg-Rueppel and other DSA-like signature schemes with partially known nonces, Proc. Workshop on Lattices and Cryptography, Boston, MA, 2001 (to appear).","DOI":"10.1007\/3-540-44670-2_9"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1023\/A:1008383811226","volume":"16","author":"J. B. Friedlander","year":"1999","unstructured":"J. B. Friedlander, M. Larsen, D. Lieman and I. E. Shparlinski, On correlation of binary M-sequences, Designs, Codes and Cryptography, 16(1999), 249\u2013256.","journal-title":"Designs, Codes and Cryptography"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"M. I. Gonz\u00e1lez Vasco and I. E. Shparlinski, On the security of Difie-Hellman bits, Proc. Workshop on Cryptography and ComputationalNum ber Theory, Singapore 1999, Birkh\u00e4user, 2001, 257\u2013268.","DOI":"10.1007\/978-3-0348-8295-8_19"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"M. I. Gonz\u00e1lez Vasco and I. E. Shparlinski, Security of the most significant bits of the Shamir message passing scheme, Math. Comp. (to appear).","DOI":"10.1090\/S0025-5718-01-01358-8"},{"key":"28_CR9","unstructured":"N. A. Howgrave-Graham and N. P. Smart, Lattice attacks on digital signature schemes, Designs, Codes and Cryptography, (to appear)."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1146\/annurev.cs.02.060187.001311","volume":"2","author":"R. Kannan","year":"1987","unstructured":"R. Kannan, Algorithmic geometry of numbers, AnnualReview of Comp. Sci., 2 (1987), 231\u2013267.","journal-title":"AnnualReview of Comp. Sci."},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"R. Kannan, Minkowski\u2019s convex body theorem and integer programming, Math. of Oper. Research, 12 (1987), 231\u2013267.","journal-title":"Math. of Oper. Research"},{"key":"28_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511542930","volume-title":"Character sums with exponential functions and their applications","author":"S. V. Konyagin","year":"1999","unstructured":"S. V. Konyagin and I. Shparlinski, Character sums with exponential functions and their applications, Cambridge Univ. Press, Cambridge, 1999."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra and L. Lov\u00e1sz, Factoring polynomials with rational coeficients, Mathematische Annalen, 261 (1982), 515\u2013534.","journal-title":"Mathematische Annalen"},{"key":"28_CR14","series-title":"Lect. Notes in Comp. Sci.","first-page":"1","volume-title":"The XTR public key system","author":"A. K. Lenstra","year":"2000","unstructured":"A. K. Lenstra and E. R. Verheul, The XTR public key system, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1880 (2000), 1\u201319."},{"key":"28_CR15","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/3-540-44448-3_17","volume-title":"Key improvements to XTR","author":"A. K. Lenstra","year":"2000","unstructured":"A. K. Lenstra and E. R. Verheul, Key improvements to XTR, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1976 (2000), 220\u2013233."},{"key":"28_CR16","volume-title":"Finite fields","author":"R. Lidland","year":"1997","unstructured":"R. Lidland H. Niederreiter, Finite fields, Cambridge University Press, Cambridge, 1997."},{"key":"28_CR17","unstructured":"D. Micciancio, On the hardness of the shortest vector problem, PhD Thesis, MIT,1998."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"P. Q. Nguyen, The dark side of the Hidden Number Problem: Lattice attacks on DSA, Proc. Workshop on Cryptography and ComputationalNum ber Theory, Singapore 1999, Birkh\u00e4user, 2001, 321\u2013330.","DOI":"10.1007\/978-3-0348-8295-8_23"},{"key":"28_CR19","unstructured":"P. Q. Nguyen and I. E. Shparlinski, The insecurity of the Digital Signature Algorithm with partially known nonces, Preprint, 2000, 1\u201326."},{"key":"28_CR20","unstructured":"P. Q. Nguyen and I. E. Shparlinski, The insecurity of the elliptic curve Digital Signature Algorithm with partially known nonces, Preprint, 2001, 1\u201316."},{"key":"28_CR21","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/10722028_4","volume-title":"Lattice reduction in cryptology: An update","author":"P. Q. Nguyen","year":"2000","unstructured":"P. Q. Nguyen and J. Stern, Lattice reduction in cryptology: An update, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1838(2000), 85\u2013112."},{"key":"28_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44670-2_12","volume-title":"The two faces of lattices in cryptology","author":"P. Q. Nguyen","year":"2001","unstructured":"P. Q. Nguyen and J. Stern, \u2018The two faces of lattices in cryptology\u2019, Proc. Workshop on Lattices and Cryptography, Boston, MA, 2001, Springer-Verlag, Berlin,(to appear)."},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C. P. Schnorr","year":"1987","unstructured":"C. P. Schnorr, A hierarchy of polynomial time basis reduction algorithms, Theor. Comp. Sci., 53 (1987), 201\u2013224.","journal-title":"Theor. Comp. Sci."},{"key":"28_CR24","unstructured":"I. E. Shparlinski, Security of polynomial transformations of the Difie-Hellman key, Preprint, 2000, 1\u20138."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"I. E. Shparlinski, Sparse polynomial approximation in finite fields, Proc. 33rd ACM Symp. on Theory of Comput., Crete, Greece, July 6\u20138, 2001, 209\u2013215.","DOI":"10.1145\/380752.380803"},{"key":"28_CR26","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-46588-1_18","volume-title":"Certificates of recoverability with scalable recovery agent security","author":"E. R. Verheul","year":"2000","unstructured":"E. R. Verheul, Certificates of recoverability with scalable recovery agent security, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1751(2000), 258\u2013275."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45624-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:30:46Z","timestamp":1556469046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45624-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429111","9783540456247"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45624-4_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}