{"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":1776827983768,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210184","type":"print"},{"value":"9783540246329","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24632-9_30","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:12:48Z","timestamp":1280747568000},"page":"416-424","source":"Crossref","is-referenced-by-count":5,"title":["A Nonuniform Algorithm for the Hidden Number Problem in Subgroups"],"prefix":"10.1007","author":[{"given":"Igor E.","family":"Shparlinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Winterhof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest vector problem. In: Proc. 33rd ACM Symp. on Theory of Comput., Crete, Greece, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: \u2019On Lovasz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica\u00a06, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"30_CR3","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\u2013Hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"key":"30_CR4","first-page":"675","volume-title":"Proc. 8th Annual ACM-SIAM Symp. on Discr. Algorithms","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: Proc. 8th Annual ACM-SIAM Symp. on Discr. Algorithms, pp. 675\u2013681. SIAM, Philadelphia (1997)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S1631-073X(03)00281-4","volume":"337","author":"J. Bourgain","year":"2003","unstructured":"Bourgain, J., Konyagin, S.V.: \u2018Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order\u2019. Comptes Rendus Mathematique\u00a0337, 75\u201380 (2003)","journal-title":"Comptes Rendus Mathematique"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Cochrane, T., Pinner, C., Rosenhouse, J.: Bounds on exponential sums and the polynomial Waring\u2019s problem mod p. In: Proc. Lond. Math. Soc., vol.\u00a067, pp. 319\u2013336 (2003)","DOI":"10.1112\/S0024610702004040"},{"key":"30_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9316-0","volume-title":"Prime numbers: A Computational perspective","author":"R. Crandall","year":"2001","unstructured":"Crandall, R., Pomerance, C.: Prime numbers: A Computational perspective. Springer, Berlin (2001)"},{"key":"30_CR8","first-page":"257","volume-title":"Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999","author":"M.I. Gonz\u00e1lez Vasco","year":"2001","unstructured":"Gonz\u00e1lez Vasco, M.I., Shparlinski, I.E.: On the security of Diffie\u2013Hellman bits. In: Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, pp. 257\u2013268. Birkh\u00e4user, Basel (2001)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1093\/qjmath\/51.2.221","volume":"51","author":"D.R. Heath-Brown","year":"2000","unstructured":"Heath-Brown, D.R., Konyagin, S.V.: New bounds for Gauss sums derived from kth powers, and for Heilbronn\u2019s exponential sum. Quart. J. Math.\u00a051, 221\u2013235 (2000)","journal-title":"Quart. J. Math."},{"key":"30_CR10","unstructured":"Konyagin, S.V.: On estimates of Gaussian sums and the Waring problem modulo a prime. In: Trudy Matem. Inst. Acad. Nauk USSR, Moscow, vol.\u00a0198, pp. 111\u2013124 (1992) (in Russian); translation in Proc. Steklov Inst. Math., 1, 105\u2013117 (1994)"},{"key":"30_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542930","volume-title":"Character sums with exponential functions and their applications","author":"S.V. Konyagin","year":"1999","unstructured":"Konyagin, S.V., Shparlinski, I.: Character sums with exponential functions and their applications. Cambridge Univ. Press, Cambridge (1999)"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"30_CR13","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 - CRYPTO 2002","author":"W.-C.W. Li","year":"2002","unstructured":"Li, W.-C.W., N\u00e4slund, M., Shparlinski, I.E.: The hidden number problem with the trace and bit security of XTR and LUC. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 433\u2013448. Springer, Heidelberg (2002)"},{"key":"30_CR14","volume-title":"Finite fields","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. Cambridge University Press, Cambridge (1997)"},{"key":"30_CR15","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of applied cryptography","author":"J. Menezes","year":"1996","unstructured":"Menezes, J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton (1996)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/10722028_4","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguyen","year":"2000","unstructured":"Nguyen, P.Q., Stern, J.: Lattice reduction in cryptology: An update. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 85\u2013112. Springer, Heidelberg (2000)"},{"key":"30_CR17","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":"30_CR18","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O. Schirokauer","year":"1993","unstructured":"Schirokauer, O.: Discrete logarithms and local units. Philos. Trans. Roy. Soc. London, Ser. A\u00a0345, 409\u2013423 (1993)","journal-title":"Philos. Trans. Roy. Soc. London, Ser. A"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-61581-4_66","volume-title":"Algorithmic Number Theory","author":"O. Schirokauer","year":"1996","unstructured":"Schirokauer, O., Weber, D., Denny, T.: Discrete logarithms: The effectiveness of the index calculus method. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 337\u2013362. Springer, Heidelberg (1996)"},{"key":"30_CR20","unstructured":"Shparlinski, E.: Playing \u201cHide-and-Seek\u201d in finite fields: Hidden number problem and its applications. In: Proc. 7th Spanish Meeting on Cryptology and Information Security, vol.\u00a01, pp. 49\u201372. Univ. of Oviedo (2002)"},{"key":"30_CR21","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/978-3-642-59435-9_23","volume-title":"Finite Fields with Applications to Coding Theory, Cryptography and Related Areas","author":"I.E. Shparlinski","year":"2002","unstructured":"Shparlinski, I.E.: Exponential sums and lattice reduction: Applications to cryptography. In: Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, pp. 286\u2013298. Springer, Heidelberg (2002)"},{"key":"30_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8037-4","volume-title":"Cryptographic applications of analytic number theory","author":"I.E. Shparlinski","year":"2003","unstructured":"Shparlinski, I.E.: Cryptographic applications of analytic number theory. Birkh\u00e4user, Basel (2003)"},{"key":"30_CR23","unstructured":"Shparlinski, I.E., Winterhof, A.: Hidden number problem in small subgroups (Preprint) (2003)"},{"key":"30_CR24","volume-title":"Cryptography: Theory and practice","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Cryptography: Theory and practice. CRC Press, Boca Raton (2002)"},{"key":"30_CR25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.4064\/aa-87-2-171-177","volume":"87","author":"Winterhof","year":"1998","unstructured":"Winterhof: On Waring\u2019s problem in finite fields. Acta Arith.\u00a087, 171\u2013177 (1998)","journal-title":"Acta Arith."}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24632-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:27:04Z","timestamp":1559345224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24632-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210184","9783540246329"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24632-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}