{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:23:35Z","timestamp":1769315015606,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T00:00:00Z","timestamp":1519257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00145-018-9282-3","type":"journal-article","created":{"date-parts":[[2018,2,22]],"date-time":"2018-02-22T21:12:04Z","timestamp":1519333924000},"page":"1337-1382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Small CRT-Exponent RSA Revisited"],"prefix":"10.1007","volume":"32","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":[[2018,2,22]]},"reference":[{"key":"9282_CR1","doi-asserted-by":"crossref","unstructured":"Y. Aono, Minkowski sum based lattice construction for multivariate simultaneous Coppersmith\u2019s technique and applications to RSA. in Colin Boyd and Leonie Simpson, editors, Information Security and Privacy\u201418th Australasian Conference, ACISP 2013, Volume 7959 of Lecture Notes in Computer Science (Springer, 2013), pp. 88\u2013103","DOI":"10.1007\/978-3-642-39059-3_7"},{"issue":"3\/4","key":"9282_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"W. Bosma, J.J. Cannon, Catherine Playoust, The magma algebra system I: the user language. J. Symb. Comput., 24(3\/4), 235\u2013265, 1997.","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9282_CR3","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D Boneh","year":"2000","unstructured":"D. Boneh, G. Durfee, Cryptanalysis of RSA with private key \n                    \n                      \n                    \n                    $$d$$\n                    \n                      \n                        d\n                      \n                    \n                   less than \n                    \n                      \n                    \n                    $$N^{0.292}$$\n                    \n                      \n                        \n                          N\n                          \n                            0.292\n                          \n                        \n                      \n                    \n                  . IEEE Trans. Information Theory, 46(4), 1339\u20131349 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9282_CR4","doi-asserted-by":"crossref","unstructured":"J. Bl\u00f6mer, A. May, New partial key exposure attacks on RSA, in Dan Boneh, editor, Advances in Cryptology\u2014CRYPTO 2003, 23rd Annual International Cryptology Conference, Volume 2729 of Lecture Notes in Computer Science (Springer, 2003), pp. 27\u201343","DOI":"10.1007\/978-3-540-45146-4_2"},{"key":"9282_CR5","doi-asserted-by":"crossref","unstructured":"D. Bleichenbacher, A. May, New attacks on RSA with small secret CRT-exponents, in Moti Yung, Yevgeniy Dodis, Aggelos Kiayias, and Tal Malkin, editors, Public Key Cryptography\u2014PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography, volume 3958 of Lecture Notes in Computer Science (Springer, 2006), pp. 1\u201313","DOI":"10.1007\/11745853_1"},{"key":"9282_CR6","doi-asserted-by":"crossref","unstructured":"A. Bauer, D. Vergnaud, J.-C. Zapalowicz, Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith\u2019s methods, in Marc Fischlin, Johannes A. Buchmann, and Mark Manulis, editors, Public Key Cryptography-PKC 2012\u201415th International Conference on Practice and Theory in Public Key Cryptography, volume 7293 of Lecture Notes in Computer Science (Springer, 2012), pp. 609\u2013626","DOI":"10.1007\/978-3-642-30057-8_36"},{"key":"9282_CR7","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, Finding a small root of a bivariate integer equation; factoring with high bits known, in Ueli M. Maurer, editor, Advances in Cryptology\u2014EUROCRYPT \u201996, International Conference on the Theory and Application of Cryptographic Techniques, volume 1070 of Lecture Notes in Computer Science (Springer, 1996), pp. 178\u2013189","DOI":"10.1007\/3-540-68339-9_16"},{"key":"9282_CR8","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, Finding a small root of a univariate modular equation, in Ueli M. Maurer, editor, Advances in Cryptology\u2014EUROCRYPT \u201996, International Conference on the Theory and Application of Cryptographic Techniques, Volume 1070 of Lecture Notes in Computer Science (Springer, 1996), pp. 155\u2013165","DOI":"10.1007\/3-540-68339-9_14"},{"issue":"4","key":"9282_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology, 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"9282_CR10","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, Finding small solutions to small degree polynomials, in Joseph H. Silverman, editor, Cryptography and Lattices, International Conference, CaLC 2001, Volume 2146 of Lecture Notes in Computer Science (Springer, 2001), pp. 20\u201331","DOI":"10.1007\/3-540-44670-2_3"},{"key":"9282_CR11","doi-asserted-by":"crossref","unstructured":"J. Coron, Finding small roots of bivariate integer polynomial equations revisited, in Christian Cachin and Jan Camenisch, editors, Advances in Cryptology\u2014EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Volume 3027 of Lecture Notes in Computer Science (Springer, 2004), pp. 492\u2013505","DOI":"10.1007\/978-3-540-24676-3_29"},{"key":"9282_CR12","doi-asserted-by":"crossref","unstructured":"G. Durfee, P.Q. Nguyen, Cryptanalysis of the RSA schemes with short secret exponent from Asiacrypt \u201999, in Tatsuaki Okamoto, editor, Advances in Cryptology\u2014ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Volume 1976 of Lecture Notes in Computer Science (Springer, 2000), pp. 14\u201329","DOI":"10.1007\/3-540-44448-3_2"},{"key":"9282_CR13","doi-asserted-by":"crossref","unstructured":"M.F. Esgin, M.S. Kiraz, O. Uzunkol, A new partial key exposure attack on multi-power RSA, in Andreas Maletti, editor, Algebraic Informatics\u20146th International Conference, CAI 2015, Volume 9270 of Lecture Notes in Computer Science (Springer, 2015), pp. 103\u2013114","DOI":"10.1007\/978-3-319-23021-4_10"},{"key":"9282_CR14","doi-asserted-by":"crossref","unstructured":"S.D. Galbraith, C. Heneghan, J.F. McKee, Tunable balancing of RSA, in Colin Boyd and Juan Manuel\u00a0Gonz\u00e1lez Nieto, editors, Information Security and Privacy, 10th Australasian Conference, ACISP 2005, Volume 3574 of Lecture Notes in Computer Science (Springer, 2005), pp. 280\u2013292","DOI":"10.1007\/11506157_24"},{"key":"9282_CR15","unstructured":"M. Herrmann, Lattice-Based Cryptanalysis Using Unravelled Linearization. Ph.D. thesis, der Ruhr-University Bochum (2011)"},{"key":"9282_CR16","doi-asserted-by":"crossref","unstructured":"Z. Huang, L. Hu, J. Xu, Attacking RSA with a composed decryption exponent using unravelled linearization, in Dongdai Lin, Moti Yung, and Jianying Zhou, editors, Information Security and Cryptology\u201410th International Conference, Inscrypt 2014, Volume 8957 of Lecture Notes in Computer Science (Springer, 2014), pp. 207\u2013219","DOI":"10.1007\/978-3-319-16745-9_12"},{"key":"9282_CR17","doi-asserted-by":"crossref","unstructured":"Z. Huang, L. Hu, J. Xu, L. Peng, Y. Xie, Partial key exposure attacks on Takagi\u2019s variant of RSA, in Ioana Boureanu, Philippe Owesarski, and Serge Vaudenay, editors, Applied Cryptography and Network Security\u201412th International Conference, ACNS 2014, Volume 8479 of Lecture Notes in Computer Science (Springer, 2014), pp. 134\u2013150","DOI":"10.1007\/978-3-319-07536-5_9"},{"key":"9282_CR18","doi-asserted-by":"crossref","unstructured":"M. Herrmann, A. May, Attacking power generators using unravelled linearization: when do we output too much? in Mitsuru Matsui, editor, Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Volume 5912 of Lecture Notes in Computer Science (Springer, 2009), pp. 487\u2013504","DOI":"10.1007\/978-3-642-10366-7_29"},{"key":"9282_CR19","doi-asserted-by":"crossref","unstructured":"M. Herrmann, A. May, Maximizing small root bounds by linearization and applications to small secret exponent RSA, in Phong\u00a0Q. Nguyen and David Pointcheval, editors, Public Key Cryptography\u2014PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Volume 6056 of Lecture Notes in Computer Science (Springer, 2010), pp. 53\u201369","DOI":"10.1007\/978-3-642-13013-7_4"},{"key":"9282_CR20","doi-asserted-by":"crossref","unstructured":"N. Howgrave-Graham, Finding small roots of univariate modular equations revisited, in Michael Darnell, editor, Cryptography and Coding, 6th IMA International Conference, Volume 1355 of Lecture Notes in Computer Science (Springer, 1997), pp. 131\u2013142","DOI":"10.1007\/BFb0024458"},{"key":"9282_CR21","doi-asserted-by":"crossref","unstructured":"E. Jochemsz, A. May, A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants, in Xuejia Lai and Kefei Chen, editors, Advances in Cryptology\u2014ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Volume 4284 of Lecture Notes in Computer Science (Springer, 2006), pp. 267\u2013282","DOI":"10.1007\/11935230_18"},{"key":"9282_CR22","doi-asserted-by":"crossref","unstructured":"E. Jochemsz, A. May, A polynomial time attack on RSA with private CRT-exponents smaller than \n                    \n                      \n                    \n                    $$N^{0.073}$$\n                    \n                      \n                        \n                          N\n                          \n                            0.073\n                          \n                        \n                      \n                    \n                  , in Alfred Menezes, editor, Advances in Cryptology\u2014CRYPTO 2007, 27th Annual International Cryptology Conference, Volume 4622 of Lecture Notes in Computer Science (Springer, 2007), pp. 395\u2013411","DOI":"10.1007\/978-3-540-74143-5_22"},{"issue":"6","key":"9282_CR23","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1587\/transfun.E97.A.1285","volume":"97\u2013A","author":"N Kunihiro","year":"2014","unstructured":"N. Kunihiro, N. Shinohara, T. Izu, A unified framework for small secret exponent attack on RSA. IEICE Transactions\n                           97-A(6), 1285\u20131295 (2014)","journal-title":"IEICE Transactions"},{"key":"9282_CR24","doi-asserted-by":"crossref","unstructured":"N. Kunihiro, On optimal bounds of small inverse problems and approximate GCD problems with higher degree, in Dieter Gollmann and Felix\u00a0C. Freiling, editors, Information Security\u201415th International Conference, ISC 2012, Volume 7483 of Lecture Notes in Computer Science (Springer, 2012), pp. 55\u201369","DOI":"10.1007\/978-3-642-33383-5_4"},{"key":"9282_CR25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W.jun. Lenstra, L\u00e1szlo Lov\u00e1sz, Factoring polynomials with rational coefficients. Math. Ann., 261, 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"9282_CR26","doi-asserted-by":"crossref","unstructured":"Y. Lu, R. Zhang, D. Lin, Factoring multi-power RSA modulus \n                    \n                      \n                    \n                    $${N} = p^rq$$\n                    \n                      \n                        \n                          N\n                          =\n                          \n                            p\n                            r\n                          \n                          q\n                        \n                      \n                    \n                   with partial known bits, in Colin Boyd and Leonie Simpson, editors, Information Security and Privacy\u201418th Australasian Conference, ACISP 2013, Volume 7959 of Lecture Notes in Computer Science (Springer, 2013), pp. 57\u201371","DOI":"10.1007\/978-3-642-39059-3_5"},{"key":"9282_CR27","doi-asserted-by":"crossref","unstructured":"Y. Lu, R. Zhang, D. Lin, New partial key exposure attacks on CRT-RSA with large public exponents, in Ioana Boureanu, Philippe Owesarski, and Serge Vaudenay, editors, Applied Cryptography and Network Security\u201412th International Conference, ACNS 2014, Volume 8479 of Lecture Notes in Computer Science (Springer, 2014), pp. 151\u2013162","DOI":"10.1007\/978-3-319-07536-5_10"},{"key":"9282_CR28","doi-asserted-by":"crossref","unstructured":"Y. Lu, R. Zhang, L. Peng, D. Lin, Solving linear equations modulo unknown divisors: Revisited, in Tetsu Iwata and Jung\u00a0Hee Cheon, editors, Advances in Cryptology\u2014ASIACRYPT 2015\u201421st International Conference on the Theory and Application of Cryptology and Information Security, Volume 9452 of Lecture Notes in Computer Science (Springer, 2015), pp. 189\u2013213","DOI":"10.1007\/978-3-662-48797-6_9"},{"key":"9282_CR29","doi-asserted-by":"crossref","unstructured":"A. May, Cryptanalysis of unbalanced RSA with small CRT-exponent, in Moti Yung, editor, Advances in Cryptology\u2014CRYPTO 2002, 22nd Annual International Cryptology Conference, Volume 2442 of Lecture Notes in Computer Science (Springer, 2002), pp. 242\u2013256","DOI":"10.1007\/3-540-45708-9_16"},{"key":"9282_CR30","unstructured":"A. May, New RSA vulnerabilities using lattice reduction methods. Ph.D. thesis, University of Paderborn (2003)"},{"key":"9282_CR31","doi-asserted-by":"crossref","unstructured":"A. May, Using LLL-reduction for solving RSA and factorization problems, in Phong\u00a0Q. Nguyen and Brigitte Vall\u00e9e, editors, The LLL Algorithm-Survey and Applications, Information Security and Cryptography (Springer, 2010), pp. 315\u2013348","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"9282_CR32","doi-asserted-by":"crossref","unstructured":"P.Q. Nguyen, J. Stern, The two faces of lattices in cryptology, in Joseph\u00a0H. Silverman, editor, Cryptography and Lattices, International Conference, CaLC 2001, Volume 2146 of Lecture Notes in Computer Science (Springer, 2001), pp. 146\u2013180","DOI":"10.1007\/3-540-44670-2_12"},{"issue":"3","key":"9282_CR33","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/070705702","volume":"39","author":"PQ Nguyen","year":"2009","unstructured":"Phong\u00a0Q. Nguyen, Damien Stehl\u00e9, An LLL algorithm with quadratic complexity. SIAM J. Comput., 39(3), 874\u2013903 (2009).","journal-title":"SIAM J. Comput."},{"key":"9282_CR34","doi-asserted-by":"crossref","unstructured":"L. Peng, L. Hu, Z. Huang, J. Xu, Partial prime factor exposure attacks on RSA and its Takagi\u2019s variant, in Javier Lopez and Yongdong Wu, editors, Information Security Practice and Experience\u201411th International Conference, ISPEC 2015, Volume 9065 of Lecture Notes in Computer Science (Springer, 2015), pp. 96\u2013108","DOI":"10.1007\/978-3-319-17533-1_7"},{"key":"9282_CR35","doi-asserted-by":"crossref","unstructured":"L. Peng, L. Hu, Y. Lu, S. Sarkar, J. Xu, Z. Huang, Cryptanalysis of variants of RSA with multiple small secret exponents, in Alex Biryukov and Vipul Goyal, editors, Progress in Cryptology-INDOCRYPT 2015\u201416th International Conference on Cryptology in India, Volume 9462 of Lecture Notes in Computer Science (Springer, 2015), pp. 105\u2013123","DOI":"10.1007\/978-3-319-26617-6_6"},{"key":"9282_CR36","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-53177-9_15","volume-title":"Information Security and Cryptology \u2013 ICISC 2016","author":"Liqiang Peng","year":"2017","unstructured":"L. Peng, L. Hu, Y. Lu, Improved results on cryptanalysis of prime power RSA, in Seokhie Hong and Jong\u00a0Hwan Park, editors, Information Security and Cryptology-ICISC 2016\u201419th International Conference, Volume 10157 of Lecture Notes in Computer Science (2016), pp. 287\u2013303"},{"key":"9282_CR37","doi-asserted-by":"crossref","unstructured":"L. Peng, L. Hu, Y. Lu, H. Wei, An improved analysis on three variants of the RSA cryptosystem, in Kefei Chen, Dongdai Lin, and Moti Yung, editors, Information Security and Cryptology\u201412th International Conference, Inscrypt 2016, Volume 10143 of Lecture Notes in Computer Science (Springer, 2016), pp. 140\u2013149","DOI":"10.1007\/978-3-319-54705-3_9"},{"issue":"1","key":"9282_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-016-0196-5","volume":"83","author":"L Peng","year":"2017","unstructured":"L. Peng, L. Hu, Y. Lu, J. Xu, Z. Huang, Cryptanalysis of dual RSA. Des. Codes Cryptography\n                           83(1), 1\u201321 (2017).","journal-title":"Des. Codes Cryptography"},{"key":"9282_CR39","unstructured":"PKCS#1, RSA cryptography specifications version 2.0. \n                    http:\/\/www.ietf.org\/rfc\/rfc2437.txt"},{"issue":"2","key":"9282_CR40","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J-J Quisquater","year":"1982","unstructured":"J.-J. Quisquater, C.\u00a0Couvreur, Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters, 18(2), 905\u2013907 (1982)","journal-title":"Electronics Letters"},{"issue":"2","key":"9282_CR41","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10623-014-9928-6","volume":"73","author":"S Sarkar","year":"2014","unstructured":"S. Sarkar, Small secret exponent attack on RSA variant with modulus \n                    \n                      \n                    \n                    $${N}=p^rq$$\n                    \n                      \n                        \n                          N\n                          =\n                          \n                            p\n                            r\n                          \n                          q\n                        \n                      \n                    \n                  . Des. Codes Cryptography, 73(2), 383\u2013392 (2014)","journal-title":"Des. Codes Cryptography"},{"key":"9282_CR42","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.dam.2015.10.003","volume":"203","author":"S Sarkar","year":"2016","unstructured":"S. Sarkar, Revisiting prime power RSA. Discrete Applied Mathematics, 203, 127\u2013133 (2016)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"9282_CR43","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1587\/transfun.E94.A.19","volume":"94\u2013A","author":"N Shinohara","year":"2011","unstructured":"N. Shinohara, T. Izu, N. Kunihiro, Small secret CRT-exponent attacks on Takagi\u2019s RSA. IEICE Transactions, 94-A(1), 19\u201327 (2011)","journal-title":"IEICE Transactions"},{"key":"9282_CR44","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-01957-9_29","volume-title":"Applied Cryptography and Network Security","author":"Santanu Sarkar","year":"2009","unstructured":"S. Sarkar, S. Maitra, Partial key exposure attack on CRT-RSA, in Michel Abdalla, David Pointcheval, Pierre-Alain Fouque, and Damien Vergnaud, editors, Applied Cryptography and Network Security, 7th International Conference, ACNS 2009, Volume 5536 of Lecture Notes in Computer Science (2009), pp. 473\u2013484"},{"key":"9282_CR45","first-page":"53","volume":"2005","author":"H-M Sun","year":"2005","unstructured":"H.-M. Sun, M.-E. Wu, An approach towards rebalanced RSA-CRT with short public exponent. IACR Cryptology ePrint Archive, 2005, 53 (2005)","journal-title":"IACR Cryptology ePrint Archive"},{"issue":"6","key":"9282_CR46","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1587\/transfun.E97.A.1259","volume":"97\u2013A","author":"A Takayasu","year":"2014","unstructured":"A. Takayasu, N. Kunihiro, Better lattice constructions for solving multivariate linear equations modulo unknown divisors. IEICE Transactions, 97-A(6), 1259\u20131272 (2014).","journal-title":"IEICE Transactions"},{"key":"9282_CR47","doi-asserted-by":"crossref","unstructured":"A. Takayasu, N. Kunihiro, Cryptanalysis of RSA with multiple small secret exponents, in Willy Susilo and Yi\u00a0Mu, editors, Information Security and Privacy\u201419th Australasian Conference, ACISP 2014, Volume 8544 of Lecture Notes in Computer Science (Springer, 2014), pp. 176\u2013191","DOI":"10.1007\/978-3-319-08344-5_12"},{"key":"9282_CR48","doi-asserted-by":"crossref","unstructured":"A. Takayasu, N. Kunihiro, Partial key exposure attacks on RSA: achieving the boneh-durfee bound, in Antoine Joux and Amr\u00a0M. Youssef, editors, Selected Areas in Cryptography-SAC 2014\u201421st International Conference, Volume 8781 of Lecture Notes in Computer Science (Springer, 2014), pp. 345\u2013362","DOI":"10.1007\/978-3-319-13051-4_21"},{"key":"9282_CR49","doi-asserted-by":"crossref","unstructured":"A. Takayasu, N. Kunihiro, Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents, in Tal Malkin, Vladimir Kolesnikov, Allison\u00a0Bishop Lewko, and Michalis Polychronakis, editors, Applied Cryptography and Network Security\u201413th International Conference, ACNS 2015, Volume 9092 of Lecture Notes in Computer Science (Springer, 2015), pp. 518\u2013537","DOI":"10.1007\/978-3-319-28166-7_25"},{"key":"9282_CR50","doi-asserted-by":"crossref","unstructured":"A. Takayasu, N. Kunihiro, How to generalize RSA cryptanalyses, in Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, and Bo-Yin Yang, editors, Public-Key Cryptography-PKC 2016\u201419th IACR International Conference on Practice and Theory in Public-Key Cryptography, Volume 9615 of Lecture Notes in Computer Science (Springer, 2016), pp. 67\u201397","DOI":"10.1007\/978-3-662-49387-8_4"},{"key":"9282_CR51","doi-asserted-by":"crossref","unstructured":"A. Takayasu, N. Kunihiro, Partial key exposure attacks on CRT-RSA: general improvement for the exposed least significant bits, in Matt Bishop and Anderson C.\u00a0A. Nascimento, editors, Information Security\u201419th International Conference, ISC 2016, Volume 9866 of Lecture Notes in Computer Science, (Springer, 2016), pp. 35\u201347","DOI":"10.1007\/978-3-319-45871-7_3"},{"key":"9282_CR52","doi-asserted-by":"crossref","unstructured":"A. Takayasu, N. Kunihiro, Partial key exposure attacks on RSA with multiple exponent pairs, in Joseph\u00a0K. Liu and Ron Steinfeld, editors, Information Security and Privacy\u201421st Australasian Conference, ACISP 2016, Volume 9723 of Lecture Notes in Computer Science (Springer, 2016), pp. 243\u2013257","DOI":"10.1007\/978-3-319-40367-0_15"},{"key":"9282_CR53","unstructured":"A. Takayasu, N. Kunihiro, Small secret exponent attacks on RSA with unbalanced prime factors, in 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (IEEE, 2016), pp. 236\u2013240"},{"issue":"1","key":"9282_CR54","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1587\/transfun.E100.A.50","volume":"100\u2013A","author":"A Takayasu","year":"2017","unstructured":"A. Takayasu, N. Kunihiro, General bounds for small inverse problems and its applications to multi-prime RSA. IEICE Transactions, 100-A(1), 50\u201361 (2017)","journal-title":"IEICE Transactions"},{"key":"9282_CR55","doi-asserted-by":"crossref","unstructured":"A. Takayasu, N. Kunihiro, A tool kit for partial key exposure attacks on RSA, in Helena Handschuh, editor, Topics in Cryptology-CT-RSA 2017\u2014The Cryptographers\u2019 Track at the RSA Conference 2017, Volume 10159 of Lecture Notes in Computer Science (Springer, 2017), pp. 58\u201373","DOI":"10.1007\/978-3-319-52153-4_4"},{"key":"9282_CR56","first-page":"130","volume-title":"Lecture Notes in Computer Science","author":"Atsushi Takayasu","year":"2017","unstructured":"A. Takayasu, Y. Lu, L. Peng, Small CRT-exponent RSA revisited, in Jean-S\u00e9bastien Coron and Jesper\u00a0Buus Nielsen, editors, Advances in Cryptology-EUROCRYPT 2017\u201436th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Volume 10211 of Lecture Notes in Computer Science (2017), pp. 130\u2013159"},{"issue":"3","key":"9282_CR57","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"M.J. Wiener, Cryptanalysis of short RSA secret exponents. IEEE Trans. Information Theory, 36(3), 553\u2013558 (1990)","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-9282-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9282-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9282-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:16:14Z","timestamp":1586333774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-9282-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,22]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9282"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-9282-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,22]]},"assertion":[{"value":"29 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}