{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:16:42Z","timestamp":1773317802306,"version":"3.50.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319566139","type":"print"},{"value":"9783319566146","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-56614-6_5","type":"book-chapter","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T02:31:20Z","timestamp":1490927480000},"page":"130-159","source":"Crossref","is-referenced-by-count":13,"title":["Small CRT-Exponent RSA Revisited"],"prefix":"10.1007","author":[{"given":"Atsushi","family":"Takayasu","sequence":"first","affiliation":[]},{"given":"Yao","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Liqiang","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,1]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-30057-8_36","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"A Bauer","year":"2012","unstructured":"Bauer, A., Vergnaud, D., Zapalowicz, J.-C.: Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith\u2019s methods. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 609\u2013626. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-30057-8_36"},{"key":"5_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. 3958, pp. 1\u201313. Springer, Heidelberg (2006). doi: 10.1007\/11745853_1"},{"key":"5_CR3","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. 2729, pp. 27\u201343. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45146-4_2"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$ . IEEE Trans. Inf. Theor. 46(4), 1339\u20131349 (2000)","DOI":"10.1109\/18.850673"},{"issue":"3\/4","key":"5_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J.J., Playoust, C.: The magma algebra system I: the user language. J. Symb. Comput. 24(3\/4), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology \u2014 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. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 178\u2013189. Springer, Heidelberg (1996). doi: 10.1007\/3-540-68339-9_16"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155\u2013165. Springer, Heidelberg (1996). doi: 10.1007\/3-540-68339-9_14"},{"issue":"4","key":"5_CR8","doi-asserted-by":"crossref","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. J. Cryptology 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44670-2_3","volume-title":"Cryptography and Lattices","author":"D Coppersmith","year":"2001","unstructured":"Coppersmith, D.: Finding small solutions to small degree polynomials. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 20\u201331. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44670-2_3"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 3027, pp. 492\u2013505. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24676-3_29"},{"key":"5_CR11","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 \u2014 ASIACRYPT 2000","author":"G Durfee","year":"2000","unstructured":"Durfee, G., Nguyen, P.Q.: Cryptanalysis of the RSA schemes with short secret exponent from Asiacrypt \u201999. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 14\u201329. Springer, Heidelberg (2000). doi: 10.1007\/3-540-44448-3_2"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-23021-4_10","volume-title":"Algebraic Informatics","author":"MF Esgin","year":"2015","unstructured":"Esgin, M.F., Kiraz, M.S., Uzunkol, O.: A new partial key exposure attack on multi-power RSA. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 103\u2013114. Springer, Cham (2015). doi: 10.1007\/978-3-319-23021-4_10"},{"key":"5_CR13","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":"SD 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. 3574, pp. 280\u2013292. Springer, Heidelberg (2005). doi: 10.1007\/11506157_24"},{"key":"5_CR14","unstructured":"Herrmann, M.: Lattice-based cryptanalysis using unravelled linearization. Ph.D. thesis, der Ruhr-Universitat Bochum (2011)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-10366-7_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Herrmann","year":"2009","unstructured":"Herrmann, M., May, A.: Attacking power generators using unravelled linearization: when do we output too much? In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 487\u2013504. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-10366-7_29"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-13013-7_4","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"M Herrmann","year":"2010","unstructured":"Herrmann, M., May, A.: Maximizing small root bounds by linearization and applications to small secret exponent RSA. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 53\u201369. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13013-7_4"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Crytography and Coding","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 131\u2013142. Springer, Heidelberg (1997). doi: 10.1007\/BFb0024458"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-16745-9_12","volume-title":"Information Security and Cryptology","author":"Z Huang","year":"2015","unstructured":"Huang, Z., Hu, L., Xu, J.: Attacking RSA with a composed decryption exponent using unravelled linearization. In: Lin, D., Yung, M., Zhou, J. (eds.) Inscrypt 2014. LNCS, vol. 8957, pp. 207\u2013219. Springer, Cham (2015). doi: 10.1007\/978-3-319-16745-9_12"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-07536-5_9","volume-title":"Applied Cryptography and Network Security","author":"Z Huang","year":"2014","unstructured":"Huang, Z., Hu, L., Xu, J., Peng, L., Xie, Y.: Partial key exposure attacks on Takagi\u2019s variant of RSA. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 134\u2013150. Springer, Cham (2014). doi: 10.1007\/978-3-319-07536-5_9"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11935230_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"E Jochemsz","year":"2006","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 267\u2013282. Springer, Heidelberg (2006). doi: 10.1007\/11935230_18"},{"key":"5_CR21","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 0.073. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 395\u2013411. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74143-5_22"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-33383-5_4","volume-title":"Information Security","author":"N Kunihiro","year":"2012","unstructured":"Kunihiro, N.: On optimal bounds of small inverse problems and approximate GCD problems with higher degree. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol. 7483, pp. 55\u201369. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33383-5_4"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Kunihiro, N., Shinohara, N., Izu, T.: A unified framework for small secret exponent attack on RSA. IEICE Trans. 97-A(6), 1285\u20131295 (2014)","DOI":"10.1587\/transfun.E97.A.1285"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Lu, Y., Zhang, R., Lin, D.: Factoring multi-power RSA modulus $${N} = p^rq$$ with partial known bits. In: Boyd, C., Simpson, L. (eds.) Information Security and Privacy - 18th Australasian Conference, ACISP 2013. LNCS, vol. 7959, pp. 57\u201371. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-39059-3_5"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-07536-5_10","volume-title":"Applied Cryptography and Network Security","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Zhang, R., Lin, D.: New partial key exposure attacks on CRT-RSA with large public exponents. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 151\u2013162. Springer, Cham (2014). doi: 10.1007\/978-3-319-07536-5_10"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-48797-6_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Zhang, R., Peng, L., Lin, D.: Solving linear equations modulo unknown divisors: revisited. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 189\u2013213. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48797-6_9"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45708-9_16","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"A May","year":"2002","unstructured":"May, A.: Cryptanalysis of unbalanced RSA with small CRT-exponent. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 242\u2013256. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45708-9_16"},{"key":"5_CR29","unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. Ph.D. thesis, University of Paderborn (2003)"},{"key":"5_CR30","series-title":"Information Security and Cryptography","first-page":"315","volume-title":"The LLL Algorithm - Survey and Applications","author":"A May","year":"2010","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL Algorithm - Survey and Applications. Information Security and Cryptography, pp. 315\u2013348. Springer, Heidelberg (2010)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"PQ Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146\u2013180. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44670-2_12"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-17533-1_7","volume-title":"Information Security Practice and Experience","author":"L Peng","year":"2015","unstructured":"Peng, L., Hu, L., Huang, Z., Xu, J.: Partial prime factor exposure attacks on RSA and its Takagi\u2019s variant. In: Lopez, J., Wu, Y. (eds.) ISPEC 2015. LNCS, vol. 9065, pp. 96\u2013108. Springer, Cham (2015). doi: 10.1007\/978-3-319-17533-1_7"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-26617-6_6","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2015","author":"L Peng","year":"2015","unstructured":"Peng, L., Hu, L., Lu, Y., Sarkar, S., Xu, J., Huang, Z.: Cryptanalysis of variants of RSA with multiple small secret exponents. In: Biryukov, A., Goyal, V. (eds.) INDOCRYPT 2015. LNCS, vol. 9462, pp. 105\u2013123. Springer, Cham (2015). doi: 10.1007\/978-3-319-26617-6_6"},{"key":"5_CR34","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. Electron. Lett. 18, 905\u2013907 (1982)","journal-title":"Electron. Lett."},{"issue":"2","key":"5_CR35","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10623-014-9928-6","volume":"73","author":"S Sarkar","year":"2014","unstructured":"Sarkar, S.: Small secret exponent attack on RSA variant with modulus $${N}=p^rq$$ . Des. Codes Crypt. 73(2), 383\u2013392 (2014)","journal-title":"Des. Codes Crypt."},{"key":"5_CR36","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.dam.2015.10.003","volume":"203","author":"S Sarkar","year":"2016","unstructured":"Sarkar, S.: Revisiting prime power RSA. Discrete Appl. Math. 203, 127\u2013133 (2016)","journal-title":"Discrete Appl. Math."},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-01957-9_29","volume-title":"Applied Cryptography and Network Security","author":"S Sarkar","year":"2009","unstructured":"Sarkar, S., Maitra, S.: Partial key exposure attack on CRT-RSA. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 473\u2013484. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-01957-9_29"},{"issue":"1","key":"5_CR38","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1587\/transfun.E94.A.19","volume":"94\u2013A","author":"N Shinohara","year":"2011","unstructured":"Shinohara, N., Izu, T., Kunihiro, N.: Small secret CRT-exponent attacks on takagi\u2019s RSA. IEICE Trans. 94\u2013A(1), 19\u201327 (2011)","journal-title":"IEICE Trans."},{"key":"5_CR39","unstructured":"Sun, H., Wu, M.: An approach towards rebalanced RSA-CRT with short public exponent. IACR Cryptology ePrint Archive 2005, 53 (2005)"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Takayasu, A., Kunihiro, N.: Better lattice constructions for solving multivariate linear equations modulo unknown divisors. IEICE Trans. 97-A(6), 1259\u20131272 (2014)","DOI":"10.1587\/transfun.E97.A.1259"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-08344-5_12","volume-title":"Information Security and Privacy","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kunihiro, N.: Cryptanalysis of RSA with multiple small secret exponents. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol. 8544, pp. 176\u2013191. Springer, Cham (2014). doi: 10.1007\/978-3-319-08344-5_12"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-15943-0_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2014","author":"A Takayasu","year":"2015","unstructured":"Takayasu, A., Kunihiro, N.: General bounds for small inverse problems and its applications to multi-prime RSA. In: Lee, J., Kim, J. (eds.) ICISC 2014. LNCS, vol. 8949, pp. 3\u201317. Springer, Cham (2015). doi: 10.1007\/978-3-319-15943-0_1"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-13051-4_21","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 345\u2013362. Springer, Cham (2014). doi: 10.1007\/978-3-319-13051-4_21"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-319-28166-7_25","volume-title":"Applied Cryptography and Network Security","author":"A Takayasu","year":"2015","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 518\u2013537. Springer, Cham (2015). doi: 10.1007\/978-3-319-28166-7_25"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-662-49387-8_4","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"A Takayasu","year":"2016","unstructured":"Takayasu, A., Kunihiro, N.: How to generalize RSA cryptanalyses. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 67\u201397. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49387-8_4"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-45871-7_3","volume-title":"Information Security","author":"A Takayasu","year":"2016","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on CRT-RSA: general improvement for the exposed least significant bits. In: Bishop, M., Nascimento, A.C.A. (eds.) ISC 2016. LNCS, vol. 9866, pp. 35\u201347. Springer, Cham (2016). doi: 10.1007\/978-3-319-45871-7_3"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-40367-0_15","volume-title":"Information Security and Privacy","author":"A Takayasu","year":"2016","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA with multiple exponent pairs. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 243\u2013257. Springer, Cham (2016). doi: 10.1007\/978-3-319-40367-0_15"},{"key":"5_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-52153-4_4","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"A Takayasu","year":"2017","unstructured":"Takayasu, A., Kunihiro, N.: A tool kit for partial key exposure attacks on RSA. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 58\u201373. Springer, Cham (2017). doi: 10.1007\/978-3-319-52153-4_4"},{"issue":"3","key":"5_CR49","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener, M.J.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Theor. 36(3), 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56614-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T12:01:44Z","timestamp":1568980904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56614-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566139","9783319566146"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56614-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}