{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T11:54:28Z","timestamp":1791114868179,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387678","type":"print"},{"value":"9783642387685","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_57","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"651-662","source":"Crossref","is-referenced-by-count":4,"title":["Time\/Memory\/Data Tradeoffs for Variants of the RSA Problem"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Vergnaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Christophe","family":"Zapalowicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"57_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi, W., Chor, B., Goldreich, O., Schnorr, C.-P.: RSA and Rabin functions: Certain parts are as hard as the whole. SIAM J. Comput.\u00a017(2), 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Babbage, S.: A space\/time tradeoff in exhaustive search attacks on stream ciphers. IEE Conference Publication - European Convention on Security and Detection, vol.\u00a0408 (1995)","DOI":"10.1049\/cp:19950490"},{"key":"57_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11818175_1","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"E. Barkan","year":"2006","unstructured":"Barkan, E., Biham, E., Shamir, A.: Rigorous bounds on cryptanalytic time\/Memory tradeoffs. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 1\u201321. Springer, Heidelberg (2006)"},{"key":"57_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"Biryukov, A., Shamir, A.: Cryptanalytic time\/memory\/data tradeoffs for stream ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 1\u201313. Springer, Heidelberg (2000)"},{"issue":"2","key":"57_CR5","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":"57_CR6","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":"57_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-44448-3_3","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Joux, A., Nguy\u00ean, P.Q.: Why textbook ElGamal and RSA encryption are insecure. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 30\u201343. Springer, Heidelberg (2000)"},{"issue":"6","key":"57_CR8","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1137\/S0097539704443793","volume":"36","author":"A. Bostan","year":"2007","unstructured":"Bostan, A., Gaudry, P., Schost, \u00c9.: Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator. SIAM J. Comput.\u00a036(6), 1777\u20131806 (2007)","journal-title":"SIAM J. Comput."},{"key":"57_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-29011-4_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y. Chen","year":"2012","unstructured":"Chen, Y., Nguyen, P.Q.: Faster algorithms for approximate common divisors: Breaking fully-homomorphic-encryption challenges over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 502\u2013519. Springer, Heidelberg (2012)"},{"key":"57_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 178\u2013189. Springer, Heidelberg (1996)"},{"key":"57_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"key":"57_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-19379-8_9","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"J.-S. Coron","year":"2011","unstructured":"Coron, J.-S., Joux, A., Mandal, A., Naccache, D., Tibouchi, M.: Cryptanalysis of the RSA subgroup assumption from TCC 2005. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 147\u2013155. Springer, Heidelberg (2011)"},{"issue":"3","key":"57_CR13","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1137\/S0097539795280512","volume":"29","author":"A. Fiat","year":"1999","unstructured":"Fiat, A., Naor, M.: Rigorous time\/space trade-offs for inverting functions. SIAM J. Comput.\u00a029(3), 790\u2013803 (1999)","journal-title":"SIAM J. Comput."},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.: Polynomial evaluation via the division algorithm: The Fast Fourier Transform revisited. In: Fischer, P., Zeiger, H.P., Ullman, J., Rosenberg, A. (eds.) 4th Annual ACM Symposium on Theory of Computing, pp. 88\u201393. ACM (1972)","DOI":"10.1145\/800152.804900"},{"issue":"2","key":"57_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00145-004-0215-y","volume":"18","author":"R. Gennaro","year":"2005","unstructured":"Gennaro, R.: An improved pseudo-random generator based on the discrete logarithm problem. Journal of Cryptology\u00a018(2), 91\u2013110 (2005)","journal-title":"Journal of Cryptology"},{"key":"57_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-69053-0_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"J.D.. Goli\u0107","year":"1997","unstructured":"Goli\u0107, J.D.: Cryptanalysis of alleged A5 stream cipher. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 239\u2013255. Springer, Heidelberg (1997)"},{"issue":"4","key":"57_CR17","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"57_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/972639.972642","volume":"51","author":"J. H\u00e5stad","year":"2004","unstructured":"H\u00e5stad, J., N\u00e4slund, M.: The security of all RSA and discrete log bits. J. ACM\u00a051(2), 187\u2013230 (2004)","journal-title":"J. ACM"},{"issue":"4","key":"57_CR19","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TIT.1980.1056220","volume":"26","author":"M.E. Hellman","year":"1980","unstructured":"Hellman, M.E.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory\u00a026(4), 401\u2013406 (1980)","journal-title":"IEEE Transactions on Information Theory"},{"key":"57_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-10366-7_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Herrmann","year":"2009","unstructured":"Herrmann, M., May, A.: Attacking power generators using unravelled linearization: When do we output too much? In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 487\u2013504. Springer, Heidelberg (2009)"},{"issue":"3","key":"57_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00196909","volume":"3","author":"S. Micali","year":"1991","unstructured":"Micali, S., Schnorr, C.-P.: Efficient, perfect polynomial random number generators. Journal of Cryptology\u00a03(3), 157\u2013172 (1991)","journal-title":"Journal of Cryptology"},{"key":"57_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-540-45146-4_36","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"P. Oechslin","year":"2003","unstructured":"Oechslin, P.: Making a faster cryptanalytic time-memory trade-off. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 617\u2013630. Springer, Heidelberg (2003)"},{"issue":"3","key":"57_CR23","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R. Schroeppel","year":"1981","unstructured":"Schroeppel, R., Shamir, A.: A T\u2009=\u2009O(2n\/2), S\u2009=\u2009O(2n\/4) algorithm for certain NP-complete problems. SIAM J. Comput.\u00a010(3), 456\u2013464 (1981)","journal-title":"SIAM J. Comput."},{"key":"57_CR24","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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T02:40:33Z","timestamp":1557715233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}