{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:01Z","timestamp":1772283481083,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642007293","type":"print"},{"value":"9783642007309","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00730-9_3","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:22:23Z","timestamp":1237288943000},"page":"37-51","source":"Crossref","is-referenced-by-count":5,"title":["Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors"],"prefix":"10.1007","author":[{"given":"Santanu","family":"Sarkar","sequence":"first","affiliation":[]},{"given":"Subhamoy","family":"Maitra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","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)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45146-4_2","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Bl\u00f6mer","year":"2003","unstructured":"Bl\u00f6mer, J., May, A.: New partial key exposure attacks on RSA. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 27\u201343. Springer, Heidelberg (2003)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24632-9_1","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Bl\u00f6mer","year":"2004","unstructured":"Bl\u00f6mer, J., May, A.: A generalized wiener attack on RSA. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 1\u201313. Springer, Heidelberg (2004)"},{"issue":"2","key":"3_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 AMS\u00a046(2), 203\u2013213 (1999)","journal-title":"Notices of the AMS"},{"issue":"4","key":"3_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\n                  0.292. IEEE Trans. on Information Theory\u00a046(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. on Information Theory"},{"key":"3_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 98","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: Exposing an RSA Private Key Given a Small Fraction of its Bits. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 25\u201334. Springer, Heidelberg (1998)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R., Lipton, R.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 37\u201351. Springer, Heidelberg (1997)"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations and low exponent vulnerabilities. Journal of Cryptology\u00a010(4), 223\u2013260 (1997)","journal-title":"Journal of Cryptology"},{"key":"3_CR9","first-page":"101","volume":"29","author":"A. Duejella","year":"2004","unstructured":"Duejella, A.: Continued fractions and RSA with small secret exponent. Tatra Mt. Math. Publ.\u00a029, 101\u2013112 (2004)","journal-title":"Tatra Mt. Math. Publ."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Ernst","year":"2005","unstructured":"Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial key exposure attacks on RSA up to full size exponents. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 371\u2013386. Springer, Heidelberg (2005)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","first-page":"403","volume-title":"Advances in Cryplogy-CRYPTO 1985 Proceedings","author":"J. Hastad","year":"1985","unstructured":"Hastad, J.: On using RSA with low exponent in public key network. In: Advances in Cryplogy-CRYPTO 1985 Proceedings. LNCS, pp. 403\u2013408. Springer, Heidelberg (1985)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Cryptography and Coding","author":"N. Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"3_CR13","unstructured":"Jochemsz, E.: Cryptanalysis of RSA variants using small roots of polynomials. Ph. D. thesis, Technische Universiteit Eindhoven (2007)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74143-5_22","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"E. Jochemsz","year":"2007","unstructured":"Jochemsz, E., May, A.: A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N\n                  0.073. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 395\u2013411. Springer, Heidelberg (2007)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"P. Kocher","year":"1996","unstructured":"Kocher, P.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P. Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"3_CR18","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. of Combridge Philos. Soc.\u00a076, 521\u2013528 (1974)","journal-title":"Proc. of Combridge Philos. Soc."},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of ACM\u00a021(2), 158\u2013164 (1978)","journal-title":"Communications of ACM"},{"key":"3_CR20","volume-title":"Cryptography \u2013 Theory and Practice","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Cryptography \u2013 Theory and Practice, 2nd edn. Chapman & Hall\/CRC, Boca Raton (2002)","edition":"2"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-30580-4_13","volume-title":"Public Key Cryptography - PKC 2005","author":"R. Steinfeld","year":"2005","unstructured":"Steinfeld, R., Contini, S., Pieprzyk, J., Wang, H.: Converse results to the Wiener attack on RSA. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 184\u2013198. Springer, Heidelberg (2005)"},{"key":"3_CR22","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":"3_CR23","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 \u2018less short\u2019 RSA secret exponents. Applicable Algebra in Engineering, Communication and Computing\u00a08, 425\u2013435 (1997)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"3","key":"3_CR24","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"},{"issue":"159","key":"3_CR25","first-page":"225","volume":"39","author":"H.C. Williams","year":"1982","unstructured":"Williams, H.C.: A p\u2009+\u20091 method of factoring. Mathematics of Computation\u00a039(159), 225\u2013234 (1982)","journal-title":"Mathematics of Computation"},{"issue":"1","key":"3_CR26","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(1), 17\u201328 (2002)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00730-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T03:21:42Z","timestamp":1551928902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00730-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642007293","9783642007309"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00730-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}