{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:34:03Z","timestamp":1777372443867,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642346002","type":"print"},{"value":"9783642346019","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34601-9_29","type":"book-chapter","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T02:04:18Z","timestamp":1353031458000},"page":"380-391","source":"Crossref","is-referenced-by-count":1,"title":["On the Improvement of Fermat Factorization"],"prefix":"10.1007","author":[{"given":"Mu-En","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raylin","family":"Tso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Min","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","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":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11745853_1","volume-title":"Public Key Cryptography - PKC 2006","author":"D. Bleichenbacher","year":"2006","unstructured":"Bleichenbacher, D., May, A.: New Attacks on RSA with Small Secret CRT-Exponents. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/3-540-44670-2_2","volume-title":"Cryptography and Lattices","author":"J. Bl\u00f6mer","year":"2001","unstructured":"Bl\u00f6mer, J., May, A.: Low Secret Exponent RSA Revisited. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 4\u201319. Springer, Heidelberg (2001)"},{"issue":"2","key":"29_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\u00a046(2), 203\u2013213 (1999)","journal-title":"Notices of the American Mathematical Society"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N 0.292. IEEE Trans. Inf. Theory\u00a046(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: An Attack on RSA Given a Small Fraction of the Private Key Bits. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 25\u201334. Springer, Heidelberg (1998)"},{"issue":"1","key":"29_CR7","first-page":"1","volume":"5","author":"D. Boneh","year":"2002","unstructured":"Boneh, D., Shacham, H.: Fast variants of RSA. CryptoBytes\u00a05(1), 1\u20139 (2002)","journal-title":"CryptoBytes"},{"key":"29_CR8","unstructured":"Bressoud, D.M.: Factorization and primality testing. Undergraduate Texts in Mathematics. Springer"},{"key":"29_CR9","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":"29_CR10","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 Univariate Modular Equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D., Franklin, M., Patarin, J., Reiter, M.: Low-Exponent RSA with Related Messages. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 1\u20139. Springer, Heidelberg (1996)"},{"key":"29_CR12","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":"G. Durfee","year":"2000","unstructured":"Durfee, G., Nguyen, P.Q.: Cryptanalysis of the RSA Schemes with Short Private Exponent form Asiacrypt 1999. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 1\u201311. Springer, Heidelberg (2000)"},{"key":"29_CR13","first-page":"101","volume":"29","author":"A. Dujella","year":"2004","unstructured":"Dujella, A.: Continued fractions and RSA with small private exponent. Tatra Mt. Math. Publ.\u00a029, 101\u2013112 (2004)","journal-title":"Tatra Mt. Math. Publ."},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11506157_24","volume-title":"Information Security and Privacy","author":"S.D. Galbraith","year":"2005","unstructured":"Galbraith, S.D., Heneghan, C., McKee, J.F.: Tunable Balancing of RSA. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol.\u00a03574, pp. 280\u2013292. Springer, Heidelberg (2005)"},{"key":"29_CR15","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1960","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 4th edn. Oxford Univ. Press, Cambridge (1960)","edition":"4"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11605805_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"M.J. Hinek","year":"2006","unstructured":"Hinek, M.J.: Another Look at Small RSA Exponents. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 82\u201398. Springer, Heidelberg (2006)"},{"key":"29_CR17","unstructured":"Galbraith, S.D., Heneghan, C., McKee, J.F.: Tunable balancing of RSA. Full version of [14]"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Ann. Math.\u00a0126, 649\u2013673 (1987)","journal-title":"Ann. Math."},{"key":"29_CR19","unstructured":"Lai, X.: Justified Security, speaking note. In: Proceeding of 17th Information Security Conference, Taiwan (June 2007)"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1090\/S0025-5718-99-01133-3","volume":"68","author":"J. McKee","year":"1999","unstructured":"McKee, J.: Speeding Fermat\u2019s Factoring Method. Math. Comput.\u00a068, 1729\u20131738 (1999)","journal-title":"Math. Comput."},{"key":"29_CR21","volume-title":"An Introduction to the Theory of Numbers","author":"I. Niven","year":"1991","unstructured":"Niven, I., Zuckerman, H.S.: An Introduction to the Theory of Numbers. Wiley, Chichester (1991)"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing. Proc. Cambriage Philosophical Soc.\u00a076, 521\u2013528 (1974)","journal-title":"Proc. Cambriage Philosophical Soc."},{"issue":"2","key":"29_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Aldeman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"29_CR24","unstructured":"Sun, H.-M., Hinek, M.J., Wu, M.-E.: On the design of Rebalanced-RSA. Technical Report CACR 2005-35, Centre for Applied Cryptographic Research, 2005-35"},{"key":"29_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-30580-4_14","volume-title":"Public Key Cryptography - PKC 2005","author":"H.-M. Sun","year":"2005","unstructured":"Sun, H.-M., Yang, C.-T.: RSA with Balanced Short Exponents and Its Application to Entity Authentication. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 199\u2013215. Springer, Heidelberg (2005)"},{"issue":"8","key":"29_CR26","doi-asserted-by":"publisher","first-page":"2922","DOI":"10.1109\/TIT.2007.901248","volume":"53","author":"H.-M. Sun","year":"2007","unstructured":"Sun, H.-M., Wu, M.-E., Ting, W.-C., Jason Hinek, M.: Dual RSA and Its Security Analysis. IEEE Trans. Inf. Theory\u00a053(8), 2922\u20132933 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-72738-5_8","volume-title":"Applied Cryptography and Network Security","author":"H.-M. Sun","year":"2007","unstructured":"Sun, H.-M., Wu, M.-E., Chen, Y.-H.: Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 116\u2013128. Springer, Heidelberg (2007)"},{"key":"29_CR28","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)"},{"key":"29_CR29","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":"2","key":"29_CR30","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. J. Cryptol.\u00a08(2), 101\u2013114 (1995)","journal-title":"J. Cryptol."},{"issue":"5","key":"29_CR31","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002000050082","volume":"8","author":"E.R. Verheul","year":"1997","unstructured":"Verheul, E.R., van Tilborg, H.C.A.: Cryptanalysis of RSA secret exponents. Appl. Algebra Eng. Commun. Comput.\u00a08(5), 425\u2013435 (1997)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3","key":"29_CR32","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M.J. Wiener","year":"1990","unstructured":"Wiener, M.J.: Cryptanalysis of short RSA private exponents. IEEE Trans. Inf. Theory\u00a036(3), 553\u2013559 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR33","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"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34601-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:00:27Z","timestamp":1620133227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34601-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346002","9783642346019"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34601-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}