{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:50Z","timestamp":1725484670546},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45995-2_14","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"105-117","source":"Crossref","is-referenced-by-count":4,"title":["The Hidden Number Problem in Extension Fields and Its Applications"],"prefix":"10.1007","author":[{"given":"Mar\u00eda Isabel","family":"Gonz\u00e1lez Vasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mats","family":"N\u00e4slund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor E.","family":"Shparlinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"D. Bleichenbacher and P. Q. Nguyen, \u2018Noisy polynomial interpolation and noisy Chinese remaindering\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1807 (2000), 53\u201369.","DOI":"10.1007\/3-540-45539-6_4"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, \u2018How to generate cryptographically strong sequences of pseudo-random bits\u2019, SIAM J. Comp., 13 (1984), 850\u2013864.","journal-title":"SIAM J. Comp."},{"key":"14_CR3","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Algorithms for Black-Box Fields and their Application to Cryptography","author":"D. Boneh","year":"1996","unstructured":"D. Boneh and R. J. Lipton, \u2018Algorithms for Black-Box Fields and their Application to Cryptography\u2019, in Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 283\u2013297."},{"key":"14_CR4","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 Diffie-Hellman and related schemes","author":"D. Boneh","year":"1996","unstructured":"D. Boneh and R. Venkatesan, \u2018Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 129\u2013142."},{"key":"14_CR5","unstructured":"D. Boneh and R. Venkatesan, \u2018Rounding in lattices and its cryptographic applications\u2019, Proc. 8th Annual ACM-SIAM Symp. on Discr. Algorithms, ACM, NY, 1997, 675\u2013681."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(87)90117-8","volume":"66","author":"R. P. Brent","year":"1987","unstructured":"R. P. Brent and B. D. McKay \u2018Determinants and ranks of random matrices over \u2124m\u2019, Discr. Math., 66 (1987), 123\u2013137.","journal-title":"Discr. Math."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"E. El Mahassni, P. Q. Nguyen and I. E. Shparlinski, \u2018The insecurity of some DSAlike signature schemes with partially known nonces\u2019, Proc. Workshop on Lattices and Cryptography, Boston, MA, 2001, Springer-Verlag, Berlin, (to appear).","DOI":"10.1007\/3-540-44670-2_9"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/ffta.1999.0263","volume":"6","author":"G. S. Frandsen","year":"2000","unstructured":"G. S. Frandsen, \u2018On the density of normal bases in finite fields\u2019, Finite Fields and Their Appl., 6 (2000), 23\u201338.","journal-title":"Finite Fields and Their Appl."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/ffta.1996.0177","volume":"3","author":"S. Gao","year":"1997","unstructured":"S. Gao and D. Panario, \u2018Density of normal elements\u2019, Finite Fields and Their Appl., 3 (1997), 141\u2013150.","journal-title":"Finite Fields and Their Appl."},{"key":"14_CR10","volume-title":"Modern computer algebra","author":"J. Gathen von zur","year":"1999","unstructured":"J. von zur Gathen and J. Gerhard, Modern computer algebra, Cambridge University Press, Cambridge, 1999."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/S0747-7171(08)80158-7","volume":"10","author":"J. Gathen von zur","year":"1990","unstructured":"J. von zur Gathen and M, Giesbrecht, \u2018Constructing normal bases in finite fields\u2019, J. Symbol. Comp., 10 (1990), 547\u2013570.","journal-title":"J. Symbol. Comp."},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12521-2","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudo-randomness","author":"O. Goldreich","year":"1999","unstructured":"O. Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudo-randomness, Springer-Verlag, Berlin, 1999."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin, \u2018A Hard Core Predicate for any One Way Function\u2019, in Proc., 21st ACM STOC, 1989, 25\u201332.","DOI":"10.1145\/73007.73010"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich and R. Rubinfeld and M. Sudan, \u2018Learning polynomials with queries: the highly noisy case\u2019, Proc. of the 36th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, 294\u2013303.","DOI":"10.1109\/SFCS.1995.492485"},{"key":"14_CR15","series-title":"Lect. Notes in Comp. Sci.","first-page":"1","volume-title":"The complexity of computing hard core predicates","author":"M. Goldmann","year":"1997","unstructured":"M. Goldmann and M. N\u00e4slund, \u2018The complexity of computing hard core predicates\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1294 (1997), 1\u201315."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0007-6","volume":"14","author":"M. Goldman","year":"2001","unstructured":"M. Goldman, M. N\u00e4slund and A. Russell \u2018Complexity bounds on general hard-core predicates\u2019, J. Cryptology, 14 (2001), 177\u2013195.","journal-title":"J. Cryptology"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"M. I. Gonz\u00e1lez Vasco and M. N\u00e4slund, \u2018A survey of hard core functions\u2019, Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkh\u00e4user, 2001, 227\u2013256.","DOI":"10.1007\/978-3-0348-8295-8_18"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"M. I. Gonz\u00e1lez Vasco and I. E. Shparlinski, \u2018On the security of Diffie-Hellman bits\u2019, Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkh\u00e4user, 2001, 257\u2013268.","DOI":"10.1007\/978-3-0348-8295-8_19"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1090\/S0025-5718-01-01358-8","volume":"71","author":"M. I. Gonz\u00e1lez Vasco","year":"2002","unstructured":"M. I. Gonz\u00e1lez Vasco and I. E. Shparlinski, \u2018Security of the most significant bits of the Shamir message passing scheme\u2019, Math. Comp., 71 (2002), 333\u2013342.","journal-title":"Math. Comp."},{"key":"14_CR20","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-68697-5_3","volume-title":"Universal hash functions from exponential sums over finite fields and Galois rings","author":"T. Helleseth","year":"1996","unstructured":"T. Helleseth and T. Johansson, \u2018Universal hash functions from exponential sums over finite fields and Galois rings\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 921 (1996), 31\u201344."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N. A. Howgrave-Graham","year":"2001","unstructured":"N. A. Howgrave-Graham and N. P. Smart, \u2018Lattice attacks on digital signature schemes\u2019, Designs, Codes and Cryptography, 23 (2001), 283\u2013290.","journal-title":"Designs, Codes and Cryptography"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1017\/S096354830100462X","volume":"10","author":"J. Kahn","year":"2001","unstructured":"J. Kahn and J. Koml\u00f3s, \u2018Singularity probabilities for random matrices over finite fields\u2019, Combinatorics, Probability and Computing, 10 (2001), 137\u2013157.","journal-title":"Combinatorics, Probability and Computing"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0304-3975(95)00162-X","volume":"157","author":"M. Karpinski","year":"1996","unstructured":"M. Karpinski and I. E. Shparlinski, \u2018On some approximation problems concerning sparse polynomials over finite fields\u2019, Theor. Comp. Sci., 157 (1996), 259\u2013266.","journal-title":"Theor. Comp. Sci."},{"key":"14_CR24","volume-title":"Algebra","author":"S. Lang","year":"1965","unstructured":"S. Lang, Algebra, Addison-Wesley, MA, 1965."},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1109\/TIT.1982.1056592","volume":"IT-28","author":"A. Lempel","year":"1982","unstructured":"A. Lempel, G. Seroussi and J. Ziv, \u2018On the power of straight-line algorithms over finite fields\u2019, IEEE Trans. on Information Theory, IT-28 (1982), 875\u2013880.","journal-title":"IEEE Trans. on Information Theory"},{"key":"14_CR26","volume-title":"Finite fields","author":"R. Lidl","year":"1997","unstructured":"R. Lidl and H. Niederreiter, Finite fields, Cambridge University Press, Cambridge, 1997."},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00196909","volume":"3","author":"S. Micali","year":"1991","unstructured":"S. Micali and C. P. Schnorr, \u2018Efficient, perfect polynomial random number generators\u2019, J. Cryptology, 3 (1991), 157\u2013172.","journal-title":"J. Cryptology"},{"key":"14_CR28","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-49264-X_29","volume-title":"Universal hash functions & hard core bits","author":"M. N\u00e4slund","year":"1995","unstructured":"M. N\u00e4slund, \u2018Universal hash functions & hard core bits\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 921 (1995), 356\u2013366."},{"key":"14_CR29","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-68697-5_10","volume-title":"All bits in ax+b are hard","author":"M. N\u00e4slund","year":"1996","unstructured":"M. N\u00e4slund, \u2018All bits in ax+b are hard\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 114\u2013128."},{"key":"14_CR30","unstructured":"M. N\u00e4slund and A. Russell, \u2018Hard core functions: Survey and new results\u2019, Proc. of NordSec\u201999, 1999, 305\u2013322."},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"P. Nguyen, \u2018The dark side of the Hidden Number Problem: Lattice attacks on DSA\u2019, Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkh\u00e4user, 2001, 321\u2013330.","DOI":"10.1007\/978-3-0348-8295-8_23"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"P. Nguyen and I. E. Shparlinski, \u2018The insecurity of the Digital Signature Algorithm with partially known nonces\u2019, J. Cryptology, (to appear).","DOI":"10.1007\/s00145-002-0021-3"},{"key":"14_CR33","unstructured":"P. Nguyen and I. E. Shparlinski, \u2018The insecurity of the elliptic curve Digital Signature Algorithm with partially known nonces\u2019, Preprint, 2000, 1\u201324."},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1137\/0222045","volume":"13","author":"H. Niederreiter","year":"1993","unstructured":"H. Niederreiter and C. P. Schnorr, \u2018Local randomness in polynomial random number and random function generators\u2019, SIAM J. Comp., 13 (1993), 684\u2013694.","journal-title":"SIAM J. Comp."},{"key":"14_CR35","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Lower bounds for discrete logarithms and related problems","author":"V. Shoup","year":"1997","unstructured":"V. Shoup, \u2018Lower bounds for discrete logarithms and related problems\u2019, in Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1233 (1997), 256\u2013266."},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"I. E. Shparlinski, \u2018Sparse polynomial approximation in finite fields\u2019, Proc. 33rd ACM Symp. on Theory of Comput., Crete, Greece, July 6\u20138, 2001, 209\u2013215.","DOI":"10.1145\/380752.380803"},{"key":"14_CR37","series-title":"Lect. Notes in Comp. Sci.","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-45624-4_28","volume-title":"On the generalised hidden number problem and bit security of XTR","author":"I. E. Shparlinski","year":"2001","unstructured":"I. E. Shparlinski, \u2018On the generalised hidden number problem and bit security of XTR\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2227 (2001), 268\u2013277."},{"key":"14_CR38","unstructured":"I. E. Shparlinski, \u2018Security of polynomial transformations of the Diffie-Hellman key\u2019, Preprint, 2000, 1\u20138."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:30:33Z","timestamp":1556454633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}