{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T11:54:44Z","timestamp":1791114884965,"version":"4.1.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319087825","type":"print"},{"value":"9783319087832","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_45","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"525-536","source":"Crossref","is-referenced-by-count":2,"title":["Statistical Properties of Short RSA Distribution and Their Cryptographic Applications"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Christophe","family":"Zapalowicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13708-2_1","volume-title":"Applied Cryptography and Network Security","author":"A. Bauer","year":"2010","unstructured":"Bauer, A., Coron, J.-S., Naccache, D., Tibouchi, M., Vergnaud, D.: On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol.\u00a06123, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"45_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055716","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen Ciphertext Attacks against Protocols Based on the RSA Encryption Standard PKCS #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"issue":"2","key":"45_CR6","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."},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Venkatesan, R.: Breaking RSA May Not Be Equivalent to Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 59\u201371. Springer, Heidelberg (1998)"},{"key":"45_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-68339-9_1","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D., Franklin, M.K., Patarin, J., Reiter, M.K.: Low-Exponent RSA with Related Messages. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 1\u20139. Springer, Heidelberg (1996)"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-642-38768-5_57","volume-title":"Computing and Combinatorics","author":"P.-A. Fouque","year":"2013","unstructured":"Fouque, P.-A., Vergnaud, D., Zapalowicz, J.-C.: Time\/Memory\/Data Tradeoffs for Variants of the RSA Problem. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 651\u2013662. Springer, Heidelberg (2013)"},{"issue":"236","key":"45_CR10","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1090\/S0025-5718-00-01283-7","volume":"70","author":"J. Friedlander","year":"2001","unstructured":"Friedlander, J., Shparlinski, I.: On the distribution of the power generator. Math. Comput.\u00a070(236), 1575\u20131589 (2001)","journal-title":"Math. Comput."},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP Is Secure under the RSA Assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 260\u2013274. Springer, Heidelberg (2001)"},{"issue":"2","key":"45_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. H\u00e5stad","year":"1988","unstructured":"H\u00e5stad, J.: Solving Simultaneous Modular Equations of Low Degree. SIAM J. Comput.\u00a017(2), 336\u2013341 (1988)","journal-title":"SIAM J. Comput."},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press (1996)","DOI":"10.1017\/CBO9780511525926"},{"issue":"3","key":"45_CR14","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. J. Cryptology\u00a03(3), 157\u2013172 (1991)","journal-title":"J. Cryptology"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Shoup, V.: A computational introduction to number theory and algebra. Cambridge University Press (2006)","DOI":"10.1017\/CBO9781139165464"},{"key":"45_CR16","unstructured":"Vinogradov, I.M.: Elements of number theory. Dover (1954)"},{"issue":"3","key":"45_CR17","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.4007\/annals.2012.175.3.12","volume":"175","author":"T.D. Wooley","year":"2012","unstructured":"Wooley, T.D.: Vinogradov\u2019s mean value theorem via efficient congruencing. Annals of Mathematics\u00a0175(3), 1575\u20131627 (2012)","journal-title":"Annals of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T21:01:53Z","timestamp":1598043713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}