{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T02:36:52Z","timestamp":1793068612493,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540244547","type":"print"},{"value":"9783540305804","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30580-4_14","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T19:51:09Z","timestamp":1278359469000},"page":"199-215","source":"Crossref","is-referenced-by-count":15,"title":["RSA with Balanced Short Exponents and Its Application to Entity Authentication"],"prefix":"10.1007","author":[{"given":"Hung-Min","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng-Ta","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N\n                  0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 1\u201311. Springer, Heidelberg (1999)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45539-6_1","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"S. Cavallar","year":"2000","unstructured":"Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W., Montgomery, P.L., Murphy, B., te Riele, H., Aardal, K., Gilchrist, J., Guillerm, G., Leyland, P., Marchand, J., Morain, F., Muffett, A., Putnam, C., Putnam, C., Zimmermann, P.: Factorization of 512-bit RSA key using the number field sieve. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 1\u201318. Springer, Heidelberg (2000)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-44448-3_2","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"G. Durfee","year":"2000","unstructured":"Durfee, G., Nguy\u00ean, P.Q.: Cryptanalysis of the RSA schemes with short secret exponent from asiacrypt \u201999. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 14\u201329. Springer, Heidelberg (2000)"},{"key":"14_CR6","unstructured":"Herstein, I.N.: Topics in Algebra. Xerox Corporation (1975)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0096-3003(02)00198-4","volume":"139","author":"H.S. Hong","year":"2003","unstructured":"Hong, H.S., Lee, H.K., Lee, H.S., Lee, H.J.: The better bound of private key in RSA with unbalanced primes. Applied Mathematics and Computation\u00a0139, 351\u2013362 (2003)","journal-title":"Applied Mathematics and Computation"},{"key":"14_CR8","unstructured":"http:\/\/www.alpertron.com.ar\/ECM.HTM"},{"key":"14_CR9","unstructured":"Joye, M., Quisquater, J.J., Yen, S.M., Yung, M.: Security paradoxes: how improving a cryptosystem may weaken it. In: Proceedings of the Ninth National Conference on Information Security, pp. 27\u201332 (1999)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lovasz, L.: Factoring polynomial with rational coefficients. Mathematiche Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematiche Annalen"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annuals of Mathematics\u00a0126, 649\u2013673 (1987)","journal-title":"Annuals of Mathematics"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1049\/el:19951199","volume":"31","author":"R. Pinch","year":"1995","unstructured":"Pinch, R.: Extending the Wiener attack to RSA-type cryptosystems. Electronics Letters\u00a031, 1736\u20131738 (1995)","journal-title":"Electronics Letters"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J. Pollard","year":"1974","unstructured":"Pollard, J.: Theorems of factorization and primality testing. Proc. Cambridge Philos. Soc.\u00a076, 521\u2013528 (1974)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1987","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM\u00a021, 120\u2013126 (1987)","journal-title":"Comm. ACM"},{"key":"14_CR15","unstructured":"Rivest, R., Silverman, R.D.: Are strong primes needed for RSA? The 1997 RSA Laboratories Seminar series, Seminar Proceedings (1997)"},{"key":"14_CR16","unstructured":"Sakai, R., Morii, M., Kasahara, M.: New key generation algorithm for RSA cryptosystem. IEICE Transactions on Fundamentals\u00a0E77-A, 89\u201397 (1994)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-48000-6_13","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"H.-M. Sun","year":"1999","unstructured":"Sun, H.-M., Yang, W.-C., Laih, C.-S.: On the design of RSA with short secret exponent. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 150\u2013164. Springer, Heidelberg (1999)"},{"issue":"1","key":"14_CR18","first-page":"1","volume":"18","author":"H.M. Sun","year":"2002","unstructured":"Sun, H.M., Yang, W.C., Laih, C.S.: On the design of RSA with short secretexponent. Journal of Inforamtion Science and Engineering\u00a018(1), 1\u201318 (2002)","journal-title":"Journal of Inforamtion Science and Engineering"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002000050082","volume":"8","author":"E. Verheul","year":"1997","unstructured":"Verheul, E., van Tilborg, H.: Cryptanalysis of less short RSA secret exponents. Applicable Algebra in Engineering, Communication and Computing\u00a08, 425\u2013435 (1997)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s002000100088","volume":"13","author":"B. Weger de","year":"2002","unstructured":"de Weger, B.: Cryptanalysis of RSA with small prime difference. Applicable Algebra in Engineering, Communication and Computing\u00a013, 17\u201328 (2002)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M. Wiener","year":"1990","unstructured":"Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory\u00a036(3), 553\u2013558 (1990)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30580-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:31:27Z","timestamp":1620012687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30580-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244547","9783540305804"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30580-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}