{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T10:20:10Z","timestamp":1772878810008,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T00:00:00Z","timestamp":1510185600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502488"],"award-info":[{"award-number":["61502488"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10623-017-0435-4","type":"journal-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T01:45:24Z","timestamp":1510191924000},"page":"1997-2033","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator"],"prefix":"10.1007","volume":"86","author":[{"given":"Jun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhangjie","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqiang","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,9]]},"reference":[{"key":"435_CR1","doi-asserted-by":"publisher","unstructured":"Akavia A.: Solving hidden number problem with one bit oracle and advice. In: Advances in Cryptology\u2014CRYPTO 2009: 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2009, pp. 337\u2013354. Springer, Berlin (2009). \n                        https:\/\/doi.org\/10.1007\/978-3-642-03356-8_20\n                        \n                    .","DOI":"10.1007\/978-3-642-03356-8_20"},{"key":"435_CR2","doi-asserted-by":"publisher","unstructured":"Bauer A., Vergnaud D., Zapalowicz J.C.: Inferring sequences produced by nonlinear pseudorandom number generators using coppersmiths methods. In: Fischlin M., Buchmann J., Manulis M. (eds.) Public Key Cryptography-PKC 2012. Lecture Notes in Computer Science, vol. 7293, pp. 609\u2013626. Springer, Berlin (2012). \n                        https:\/\/doi.org\/10.1007\/978-3-642-30057-8_36\n                        \n                    .","DOI":"10.1007\/978-3-642-30057-8_36"},{"key":"435_CR3","doi-asserted-by":"publisher","unstructured":"Blackburn S., Gomez-Perez D., Gutierrez J., Shparlinski I.: Predicting the inversive generator. In: Paterson K. (ed.) Cryptography and Coding. Lecture Notes in Computer Science, vol. 2898, pp. 264\u2013275. Springer, Berlin (2003). \n                        https:\/\/doi.org\/10.1007\/978-3-540-40974-8_21\n                        \n                    .","DOI":"10.1007\/978-3-540-40974-8_21"},{"key":"435_CR4","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1090\/S0025-5718-04-01698-9","volume":"74","author":"SR Blackburn","year":"2005","unstructured":"Blackburn S.R., Gomez-perez D., Gutierrez J., Shparlinski I.E.: Predicting nonlinear pseudorandom number generators. Math. Comput. 74, 1471\u20131494 (2005).","journal-title":"Math. Comput."},{"key":"435_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D., Venkatesan R.: Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In: CRYPTO 1996, pp. 129\u2013142. Springer, Berlin (1996).","DOI":"10.1007\/3-540-68697-5_11"},{"key":"435_CR6","doi-asserted-by":"crossref","unstructured":"Boneh D., Halevi S., Howgrave-Graham N.: The modular inversion hidden number problem. In: ASIACRYPT 2001, pp. 36\u201351. Springer, Berlin (2001).","DOI":"10.1007\/3-540-45682-1_3"},{"issue":"1","key":"435_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/58562.59305","volume":"36","author":"J Boyar","year":"1989","unstructured":"Boyar J.: Inferring sequences produced by pseudo-random number generators. J. ACM 36(1), 129\u2013141 (1989). \n                        https:\/\/doi.org\/10.1145\/58562.59305\n                        \n                    .","journal-title":"J. ACM"},{"key":"435_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-2196-8","volume-title":"Advanced Combinatorics.","author":"L Comtet","year":"1974","unstructured":"Comtet L.: Advanced Combinatorics. D. Reidel Publishing Company, Boston (1974)."},{"key":"435_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-35651-8","volume-title":"Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"DA Cox","year":"2007","unstructured":"Cox D.A.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, New York (2007)."},{"issue":"1","key":"435_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02932576","volume":"27","author":"J Eichenauer","year":"1986","unstructured":"Eichenauer J., Lehn J.: A non-linear congruential pseudo random number generator. Stat. Hefte 27(1), 315\u2013326 (1986). \n                        https:\/\/doi.org\/10.1007\/BF02932576\n                        \n                    .","journal-title":"Stat. Hefte"},{"key":"435_CR11","doi-asserted-by":"publisher","unstructured":"Eichenauer-Herrmann J., Herrmann E., Wegenkittl S.: A survey of quadratic and inversive congruential pseudorandom numbers, pp. 66\u201397. Springer, New York (1998). \n                        https:\/\/doi.org\/10.1007\/978-1-4612-1690-2_4\n                        \n                    .","DOI":"10.1007\/978-1-4612-1690-2_4"},{"key":"435_CR12","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham N.: Finding small roots of univariate modular equations revisited. In: Crytography and Coding, pp. 131\u2013142. Springer, New York (1997).","DOI":"10.1007\/BFb0024458"},{"issue":"3","key":"435_CR13","doi-asserted-by":"publisher","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. Des. Codes Crypt. 23(3), 283\u2013290 (2001). \n                        https:\/\/doi.org\/10.1023\/A:1011214926272\n                        \n                    .","journal-title":"Des. Codes Crypt."},{"issue":"4","key":"435_CR14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982).","journal-title":"Math. Ann."},{"issue":"4","key":"435_CR15","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. Symb. Comput. 47(4), 358\u2013367 (2012).","journal-title":"J. Symb. Comput."},{"key":"435_CR16","doi-asserted-by":"publisher","unstructured":"Niederreiter H.: Random Number Generation and Quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics, Philadelphia, RI (1992). \n                        https:\/\/doi.org\/10.1137\/1.9781611970081\n                        \n                    .","DOI":"10.1137\/1.9781611970081"},{"key":"435_CR17","doi-asserted-by":"publisher","unstructured":"Niederreiter H.: New developments in uniform pseudorandom number and vector generation. In: Niederreiter H., Shiue P.S. (eds.) Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statistics, vol. 106, pp. 87\u2013120. Springer, New York (1995). \n                        https:\/\/doi.org\/10.1007\/978-1-4612-2552-2_5\n                        \n                    .","DOI":"10.1007\/978-1-4612-2552-2_5"},{"issue":"3","key":"435_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00605-007-0503-3","volume":"153","author":"H Niederreiter","year":"2008","unstructured":"Niederreiter H., Rivat J.: On the correlation of pseudorandom numbers generated by inversive methods. Monatshefte Math. 153(3), 251\u2013264 (2008). \n                        https:\/\/doi.org\/10.1007\/s00605-007-0503-3\n                        \n                    .","journal-title":"Monatshefte Math."},{"key":"435_CR19","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-56046-0_6","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"H Niederreiter","year":"2000","unstructured":"Niederreiter H., Shparlinski I.: Recent advances in the theory of nonlinear pseudorandom number generators. In: Fang K.T., Niederreiter H., Hickernell F. (eds.) Monte Carlo and Quasi-Monte Carlo Methods, pp. 86\u2013102. Springer, Berlin (2000). \n                        https:\/\/doi.org\/10.1007\/978-3-642-56046-0_6\n                        \n                    ."},{"key":"435_CR20","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-77224-8_25","volume-title":"On the Structure of Inversive Pseudorandom Number Generators","author":"H Niederreiter","year":"2007","unstructured":"Niederreiter H., Winterhof A.: On the Structure of Inversive Pseudorandom Number Generators, pp. 208\u2013216. Springer, Berlin (2007). \n                        https:\/\/doi.org\/10.1007\/978-3-540-77224-8_25\n                        \n                    ."},{"key":"435_CR21","doi-asserted-by":"publisher","unstructured":"Pirsic G., Winterhof A.: On the structure of digital explicit nonlinear and inversive pseudorandom number generators. J. Complex. 26(1), 43\u201350 (2010). \n                        https:\/\/doi.org\/10.1016\/j.jco.2009.07.001\n                        \n                    .","DOI":"10.1016\/j.jco.2009.07.001"},{"key":"435_CR22","doi-asserted-by":"crossref","unstructured":"Shparlinski I.E.: Playing hide-and-seek with numbers: the hidden number problem, lattices, and exponential sums. In: Proceeding of Symposia in Applied Mathematics, vol.\u00a062, pp. 153\u2013177 (2005).","DOI":"10.1090\/psapm\/062\/2211876"},{"key":"435_CR23","doi-asserted-by":"publisher","unstructured":"Stern J.: Secret linear congruential generators are not cryptographically secure. In: 28th Annual Symposium on Foundations of Computer Science, 1987, pp. 421\u2013426 (1987). \n                        https:\/\/doi.org\/10.1109\/SFCS.1987.51\n                        \n                    .","DOI":"10.1109\/SFCS.1987.51"},{"issue":"4","key":"435_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00200-005-0181-0","volume":"16","author":"A Topuzo\u011flu","year":"2005","unstructured":"Topuzo\u011flu A., Winterhof A.: On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders. Appl. Algebr. Eng. Commun. Comput. 16(4), 219\u2013228 (2005). \n                        https:\/\/doi.org\/10.1007\/s00200-005-0181-0\n                        \n                    .","journal-title":"Appl. Algebr. Eng. Commun. Comput."},{"key":"435_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-15874-2_9","volume-title":"Recent Results on Recursive Nonlinear Pseudorandom Number Generators","author":"A Winterhof","year":"2010","unstructured":"Winterhof A.: Recent Results on Recursive Nonlinear Pseudorandom Number Generators, pp. 113\u2013124. Springer, Berlin (2010). \n                        https:\/\/doi.org\/10.1007\/978-3-642-15874-2_9\n                        \n                    ."},{"key":"435_CR26","doi-asserted-by":"crossref","unstructured":"Xu J., Hu L., Huang Z., Peng L.: Modular inversion hidden number problem revisited. In: Information Security Practice and Experience, pp. 537\u2013551. Springer, New York (2014).","DOI":"10.1007\/978-3-319-06320-1_39"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0435-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0435-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0435-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T12:58:52Z","timestamp":1529413132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0435-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,9]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["435"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0435-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,9]]}}}