{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:40:29Z","timestamp":1794343229842,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540360759","type":"print"},{"value":"9783540360766","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11792086_19","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T09:48:35Z","timestamp":1159955315000},"page":"257-274","source":"Crossref","is-referenced-by-count":7,"title":["On the Randomness of Bits Generated by Sufficiently Smooth Functions"],"prefix":"10.1007","author":[{"given":"Damien","family":"Stehl\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1080\/10586458.2002.10504704","volume":"11","author":"D.H. Bailey","year":"2002","unstructured":"Bailey, D.H., Crandall, R.E.: Random generators and normal numbers. Experimental Mathematics\u00a011(4), 527\u2013546 (2002)","journal-title":"Experimental Mathematics"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/18.850673","volume":"46","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N\n                           0.292. IEEE Transactions on Information Theory\u00a046(4), 233\u2013260 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring n\u2009=\u2009pq\n                           \n                    r\n                   for large\u00a0r. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 326\u2013337. Springer, Heidelberg (1999)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF03019651","volume":"27","author":"\u00c9. Borel","year":"1909","unstructured":"Borel, \u00c9.: Les probabilit\u00e9s d\u00e9nombrables et leurs applications arithm\u00e9tiques. Rendiconti del Circolo Matematico di Palermo\u00a027, 247\u2013271 (1909)","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/321941.321944","volume":"23","author":"R. Brent","year":"1976","unstructured":"Brent, R.: Fast multiple precision zero-finding methods and the complexity of elementary function evaluation. Journal of the ACM\u00a023, 242\u2013251 (1976)","journal-title":"Journal of the ACM"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"Journal of Cryptology"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Ernst","year":"2005","unstructured":"Ernst, M., Jochens, E., May, A., de Weger, B.: Partial key exposure attacks on RSA up to full size exponents. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 371\u2013386. Springer, Heidelberg (2005)"},{"key":"19_CR9","unstructured":"Granlund, T.: The GNU MP Bignum Library, Available at: \n                    \n                      http:\/\/www.swox.com\/"},{"key":"19_CR10","first-page":"191","volume-title":"Proc. of STOC 1984","author":"R. Kannan","year":"1984","unstructured":"Kannan, R., Lenstra, A.K., Lov\u00e1sz, L.: Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. In: Proc. of STOC 1984, pp. 191\u2013200. ACM, New York (1984)"},{"key":"19_CR11","unstructured":"Lef\u00e8vre, V.: Moyens arithm\u00e9tiques pour un calcul fiable. PhD thesis, \u00c9NS Lyon (2000)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"19_CR13","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs and Convexity","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L.: An Algorithmic Theory of Numbers, Graphs and Convexity. CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM Publications, Philadelphia (1986)"},{"key":"19_CR14","unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. PhD thesis, University of Paderborn (2003)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-540-28628-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A. May","year":"2004","unstructured":"May, A.: Computing the RSA secret key is determinisitic polynomial time equivalent to factoring. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 213\u2013219. Springer, Heidelberg (2004)"},{"key":"19_CR16","unstructured":"Minkowski, H.: Geometrie der Zahlen. Teubner-Verlag (1896)"},{"key":"19_CR17","first-page":"23","volume":"2","author":"Y.V. Nesterenko","year":"1996","unstructured":"Nesterenko, Y.V., Waldschmidt, M.: On the approximation of the values of exponential function and logarithm by algebraic numbers. Matematicheskie Zapiski\u00a02, 23\u201342 (1996)","journal-title":"Matematicheskie Zapiski"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P. Nguyen","year":"2005","unstructured":"Nguyen, P., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"19_CR19","unstructured":"The\u00a0SPACES Project. MPFR, a LGPL-library for multiple-precision floating-point computations with exact rounding, Available at: \n                    \n                      http:\/\/www.mpfr.org\/"},{"key":"19_CR20","unstructured":"Stehl\u00e9, D.: Algorithmique de la r\u00e9duction de r\u00e9seaux et application \u00e0 la recherche de pires cas pour l\u2019arrondi de fonctions math\u00e9matiques. PhD thesis, Universit\u00e9 Nancy 1 (2005)"},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TC.2005.55","volume":"54","author":"D. Stehl\u00e9","year":"2005","unstructured":"Stehl\u00e9, D., Lef\u00e8vre, V., Zimmermann, P.: Searching worst cases of a one-variable function. IEEE Transactions on Computers\u00a054(3), 340\u2013346 (2005)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11792086_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:23:35Z","timestamp":1619493815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11792086_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540360759","9783540360766"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11792086_19","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11792086","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}