{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:50:37Z","timestamp":1742388637696},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540791034"},{"type":"electronic","value":"9783540791041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79104-1_9","type":"book-chapter","created":{"date-parts":[[2008,3,13]],"date-time":"2008-03-13T07:28:21Z","timestamp":1205393301000},"page":"116-130","source":"Crossref","is-referenced-by-count":15,"title":["RSA Moduli with a Predetermined Portion: Techniques and Applications"],"prefix":"10.1007","author":[{"given":"Marc","family":"Joye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"9_CR2","unstructured":"Bernstein, D.J.: Stop overestimating RSA bandwidth! Rump session of CRYPTO 2004, Santa Barbara, CA, USA (August\u00a017, 2004), http:\/\/cr.yp.to\/talks\/2004.08.17\/slides.pdf"},{"key":"9_CR3","unstructured":"Bernstein, D.J.: Compressing RSA\/Rabin keys. Invited talk, Number Theory Inspired By Cryptography (NTIBC 2005), Bannf Centre, Alberta, Canada, (November\u00a06, 2005), http:\/\/cr.yp.to\/talks\/2005.11.06\/slides.pdf"},{"issue":"2","key":"9_CR4","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices of the American Mathematical Society (AMS)\u00a046(2), 203\u2013213 (1999)","journal-title":"Notices of the American Mathematical Society (AMS)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 bivariate integer equation; factoring with high bits known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"issue":"4","key":"9_CR6","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":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1007\/978-3-540-24676-3_29","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"J.-S. Coron","year":"2004","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 492\u2013505. Springer, Heidelberg (2004)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74143-5_21","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J.-S. Coron","year":"2007","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations: A direct approach. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 379\u2013394. Springer, Heidelberg (2007)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-36563-X_28","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"C. Cr\u00e9peau","year":"2003","unstructured":"Cr\u00e9peau, C., Slakmon, A.: Simple backdoors for RSA key generation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 403\u2013416. Springer, Heidelberg (2003)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/0-387-34799-2_29","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y.: Abuses in cryptography and how to fight them. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 375\u2013389. Springer, Heidelberg (1990)"},{"issue":"6","key":"9_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR12","unstructured":"Gehrmann, C., N\u00e4slund, M., (eds.): ECRYPT yearly report on algorithms and keysizes. ECRYPT Report, D.SPA.16, Revision 1.0 (January 2006), http:\/\/www.ecrypt.eu.org\/documents\/D.SPA.16-1.0.pdf"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-69053-0_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Girault","year":"1997","unstructured":"Girault, M., Misarski, J.-F.: Selective forgery of RSA signatures using redundancy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 495\u2013507. Springer, Heidelberg (1997)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11894063_13","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"M. Joye","year":"2006","unstructured":"Joye, M., Paillier, P.: Fast generation of prime numbers on portable devices: An update. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 160\u2013173. Springer, Heidelberg (2006)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-44499-8_27","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"M. Joye","year":"2000","unstructured":"Joye, M., Paillier, P., Vaudenay, S.: Efficient generation of prime numbers. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 340\u2013354. Springer, Heidelberg (2000)"},{"key":"9_CR16","unstructured":"Juels, A.: Provable security: Some caveats. Panel discussion, 6th ACM Conference on Computer and Communications Security (ACM CCS 1999), Singapore (November 1\u20134, 1999)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-45961-8_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"H.-J. Knobloch","year":"1988","unstructured":"Knobloch, H.-J.: A smart card implementation of the Fiat-Shamir identification scheme. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 87\u201395. Springer, Heidelberg (1988)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49649-1_1","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"A.K. Lenstra","year":"1998","unstructured":"Lenstra, A.K.: Generating RSA moduli with a predetermined portion. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 1\u201310. Springer, Heidelberg (1998)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"515","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, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/3-540-46877-3_48","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"G. Meister","year":"1991","unstructured":"Meister, G.: On an implementation of the Mohan-Adiga algorithm. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 496\u2013500. Springer, Heidelberg (1991)"},{"issue":"7","key":"9_CR21","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1049\/el:19850536","volume":"21","author":"S.B. Mohan","year":"1985","unstructured":"Mohan, S.B., Adiga, B.S.: Fast algorithms for implementing RSA public key cryptosystems. Electronics Letters\u00a021(7), 761 (1985)","journal-title":"Electronics Letters"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0053426","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"D. Naccache","year":"1995","unstructured":"Naccache, D., M\u2019Ra\u00efhi, D., Vaudenay, S., Raphaeli, D.: Can D.S.A. be improved? Complexity trade-offs with the digital signature standard. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 77\u201385. Springer, Heidelberg (1995)"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/SP.1985.10026","volume-title":"1985 IEEE Symposium on Security and Privacy","author":"T. Okamoto","year":"1985","unstructured":"Okamoto, T., Shiraishi, A.: A fast signature scheme based on quadratic inequalities. In: 1985 IEEE Symposium on Security and Privacy, pp. 123\u2013133. IEEE Computer Society Press, Los Alamitos (1985)"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF00203816","volume":"6","author":"G. Orton","year":"1993","unstructured":"Orton, G., Peppard, L., Tavares, S.: A design of a fast pipelined modular multiplier based on a diminished-radix algorithm. Journal of Cryptology\u00a06(4), 183\u2013208 (1993)","journal-title":"Journal of Cryptology"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"9_CR27","unstructured":"RSA Laboratories. The RSA challenge numbers, http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2093"},{"key":"9_CR28","unstructured":"RSA Laboratories. RSA-200 is factored! (May 2005), http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2879"},{"issue":"1","key":"9_CR29","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10623-005-3137-2","volume":"39","author":"I.E. Shparlinski","year":"2006","unstructured":"Shparlinski, I.E.: On RSA moduli with prescribed bit patterns. Designs, Codes and Cryptography\u00a039(1), 113\u2013122 (2006)","journal-title":"Designs, Codes and Cryptography"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-39757-4_25","volume-title":"Advances in Cryptology","author":"G.J. Simmons","year":"1985","unstructured":"Simmons, G.J.: The subliminal channel and digital signatures. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol.\u00a0209, pp. 364\u2013368. Springer, Heidelberg (1985)"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T. Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo p k q. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 318\u2013326. Springer, Heidelberg (1998)"},{"issue":"25","key":"9_CR32","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.1049\/el:19941466","volume":"30","author":"S.A. Vanstone","year":"1994","unstructured":"Vanstone, S.A., Zuccherato, R.J.: Using four-prime RSA in which some of the bits are specified. Electronics Letters\u00a030(25), 2118\u20132119 (1994)","journal-title":"Electronics Letters"},{"issue":"2","key":"9_CR33","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00190758","volume":"8","author":"S.A. Vanstone","year":"1995","unstructured":"Vanstone, S.A., Zuccherato, R.J.: Short RSA keys and their generation. Journal of Cryptology\u00a08(2), 101\u2013114 (1995)","journal-title":"Journal of Cryptology"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-46766-1_26","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C.D. Walter","year":"1992","unstructured":"Walter, C.D.: Faster modular multiplication by operand scaling. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 313\u2013323. Springer, Heidelberg (1992)"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-68697-5_8","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"A. Young","year":"1996","unstructured":"Young, A., Yung, M.: The dark side of \u201cblack-box\u201d cryptography, or: Should we trust Capstone? In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 89\u2013103. Springer, Heidelberg (1996)"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-69053-0_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"A. Young","year":"1997","unstructured":"Young, A., Yung, M.: Kleptography: Using cryptography against cryptography. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 62\u201374. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79104-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:17:23Z","timestamp":1606184243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79104-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540791034","9783540791041"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79104-1_9","relation":{},"subject":[]}}