{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:37:19Z","timestamp":1765960639454},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642103650"},{"type":"electronic","value":"9783642103667"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-10366-7_29","type":"book-chapter","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T22:08:44Z","timestamp":1259618924000},"page":"487-504","source":"Crossref","is-referenced-by-count":33,"title":["Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Herrmann","sequence":"first","affiliation":[]},{"given":"Alexander","family":"May","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","first-page":"421","volume-title":"STOC","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M., Chor, B., Shamir, A.: On the cryptographic security of single rsa bits. In: STOC, pp. 421\u2013430. ACM, New York (1983)"},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jalgor.2004.07.002","volume":"61","author":"S.R. Blackburn","year":"2006","unstructured":"Blackburn, S.R., Gomez-Perez, D., Gutierrez, J., Shparlinski, I.: Reconstructing noisy polynomial evaluation in residue rings. J. Algorithms\u00a061(2), 47\u201359 (2006)","journal-title":"J. Algorithms"},{"issue":"2","key":"29_CR3","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 J. Comput.\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput.\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer [11], pp. 178\u2013189","DOI":"10.1007\/3-540-68339-9_16"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer [11], pp. 155\u2013165","DOI":"10.1007\/3-540-68339-9_14"},{"issue":"4","key":"29_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. J. Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"Fischlin, R., Schnorr, C.-P.: Stronger security proofs for rsa and rabin bits. J. Cryptology\u00a013(2), 221\u2013244 (2000)","journal-title":"J. Cryptology"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/BFb0054124","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"C.S. Jutla","year":"1998","unstructured":"Jutla, C.S.: On finding small solutions of modular multivariate polynomial equations. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 158\u2013170. Springer, Heidelberg (1998)"},{"issue":"4","key":"29_CR10","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(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","year":"1996","unstructured":"Maurer, U.M. (ed.): EUROCRYPT 1996. LNCS, vol.\u00a01070. Springer, Heidelberg (1996)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point lll revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"29_CR13","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. Nguy\u00ean","year":"2001","unstructured":"Nguy\u00ean, 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":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11935230_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"R. Steinfeld","year":"2006","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: On the provable security of an efficient rsa-based pseudorandom generator. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 194\u2013209. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10366-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:54:06Z","timestamp":1558270446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10366-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642103650","9783642103667"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10366-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}