{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:14:42Z","timestamp":1767626082161},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T00:00:00Z","timestamp":1697760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T00:00:00Z","timestamp":1697760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-023-00508-8","type":"journal-article","created":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T14:01:46Z","timestamp":1697810506000},"page":"195-202","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Cryptanalysis of RSA with composed decryption exponent with few most significant bits of one of the primes"],"prefix":"10.1007","volume":"20","author":[{"given":"R.","family":"Santosh Kumar","sequence":"first","affiliation":[]},{"given":"K. L. N. C.","family":"Prakash","sequence":"additional","affiliation":[]},{"given":"S. R. M.","family":"Krishna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,20]]},"reference":[{"issue":"2","key":"508_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM. ACM"},{"key":"508_CR2","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 Trans. Inf. Theory 36, 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"508_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with Private Key d Less than N^{0:292}. Advances in Cryptology\u2014Proceedings of Eurocrypt '99, Lecture Notes in Computer Science 1952, pp. 1\u201311 (1999)","DOI":"10.1007\/3-540-48910-X_1"},{"issue":"4","key":"508_CR4","doi-asserted-by":"publisher","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. Cryptol.Cryptol. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol.Cryptol."},{"issue":"4","key":"508_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"508_CR6","volume-title":"A Course in Computational Algebraic Number","author":"H Cohen","year":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number, 2nd edn. Springer-Verlag, Berlin (1995)","edition":"2"},{"issue":"1","key":"508_CR7","first-page":"17","volume":"13","author":"B de Weger","year":"2002","unstructured":"de Weger, B.: Cryptanalysis of RSA with a small prime difference. Appl. Algebra Eng. Commun. Comput.Commun. Comput. 13(1), 17\u201328 (2002)","journal-title":"Appl. Algebra Eng. Commun. Comput.Commun. Comput."},{"key":"508_CR8","doi-asserted-by":"crossref","unstructured":"Luo, P., Zhou, H., Wang, D., Dai, Y.: Cryptanalysis of RSA for a special case with $$d>e$$. Science in China Press, Springer, vol. 52(4), pp. 609\u2013616 (2008)","DOI":"10.1007\/s11432-009-0014-z"},{"issue":"2","key":"508_CR9","first-page":"102","volume":"14","author":"M Mumtaj","year":"2021","unstructured":"Mumtaj, M., Ping, L.: An Improved Cryptanalysis of Large decryption exponent with constrained secret key. Int. J. Inf. Comput. Secur.Comput. Secur. 14(2), 102\u2013117 (2021)","journal-title":"Int. J. Inf. Comput. Secur.Comput. Secur."},{"key":"508_CR10","volume-title":"Information Security. ISC 2021. Lecture Notes in Computer Science","author":"M Cherkaoui-Semmouni","year":"2021","unstructured":"Cherkaoui-Semmouni, M., Nitaj, A., Susilo, W., Tonien, J.: Cryptanalysis of RSA variants with primes sharing most significant bits. In: Liu, J.K., Katsikas, S., Meng, W., Susilo, W., Intan, R. (eds.) Information Security. ISC 2021. Lecture Notes in Computer Science, vol. 13118. Springer, Cham (2021)"},{"key":"508_CR11","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.3390\/sym14081498","volume":"14","author":"Z Mahad","year":"2022","unstructured":"Mahad, Z., Ariffin, M.R.K., Ghafar, A.H.A., Salim, N.R.: Cryptanalysis of RSA-variant cryptosystem generated by potential rogue CA methodology. Symmetry 14, 1498 (2022)","journal-title":"Symmetry"},{"key":"508_CR12","doi-asserted-by":"publisher","first-page":"103584","DOI":"10.1016\/j.csi.2021.103584","volume":"80","author":"WNAWM Ruzai","year":"2022","unstructured":"Ruzai, W.N.A.W.M., et al.: Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis. Comput. Stand Interfaces 80, 103584 (2022)","journal-title":"Comput. Stand Interfaces"},{"key":"508_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: Exposing an RSA private key given a small fraction of its bits. In: Asiacrypt\u201998, LNCS 1514, pp. 25\u201334. Springer-Verlag (1998)","DOI":"10.1007\/3-540-49649-1_3"},{"key":"508_CR14","first-page":"27","volume-title":"CRYPTO, Lecture Notes in Computer Science","author":"J Blomer","year":"2003","unstructured":"Blomer, J., May, A.: New partial key exposure attacks on RSA. In: Boneh, D. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 2729, pp. 27\u201343. Springer, Heidelberg (2003)"},{"key":"508_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in Cryptology Eurocrypt 2005. Lecture Notes in Computer Science","author":"M Ernst","year":"2005","unstructured":"Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial exposure attacks on RSA up to full-size exponents. In: Cramer, R. (ed.) Advances in Cryptology Eurocrypt 2005. Lecture Notes in Computer Science, vol. 3494, pp. 371\u2013386. Springer-Verlag, Berlin (2005)"},{"key":"508_CR16","first-page":"34","volume-title":"Public Key Cryptography, Volume 5443 of Lecture Notes in Computer Science","author":"Y Aono","year":"2009","unstructured":"Aono, Y.: A new lattice construction for partial key exposure attack for RSA. In: Jarecki, S., Tsudik, G. (eds.) Public Key Cryptography, Volume 5443 of Lecture Notes in Computer Science, pp. 34\u201353. Springer, Berlin (2009)"},{"issue":"4","key":"508_CR17","doi-asserted-by":"publisher","first-page":"721","DOI":"10.4134\/BKMS.2009.46.4.721","volume":"46","author":"S Sarkar","year":"2009","unstructured":"Sarkar, S., Maitra, S.: Partial exposure attacks on RSA and its variants by considering a few bits of one of the prime factors. Bull. Korean Math. Soc.. Korean Math. Soc. 46(4), 721\u2013741 (2009)","journal-title":"Bull. Korean Math. Soc.. Korean Math. Soc."},{"key":"508_CR18","first-page":"76","volume-title":"INDOCRYPT, Lecture Notes in Computer Science","author":"S Sarkar","year":"2011","unstructured":"Sarkar, S.: Partial key exposure: generalized framework to attack RSA. In: Berstein, J., Chatterjee, S. (eds.) INDOCRYPT, Lecture Notes in Computer Science, vol. 7107, pp. 76\u201392. Springer, Berlin (2011)"},{"key":"508_CR19","unstructured":"Huang, Z., Hu, L., Xu, J.: Attacking RSA with a composed decryption exponent using unravelled linearization. In: 10th International Conference on Information Security and Cryptology, In Scrypt 2014, Dec 13\u201315, (2014)"},{"key":"508_CR20","volume-title":"Information Security and Cryptology. Inscrypt 2014. Lecture Notes in Computer Science","author":"Z Huang","year":"2012","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.) Information Security and Cryptology. Inscrypt 2014. Lecture Notes in Computer Science, vol. 8957. Springer, Cham (2012)"},{"issue":"5","key":"508_CR21","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ipl.2009.11.016","volume":"110","author":"S Sarkar","year":"2010","unstructured":"Sarkar, S., Maitra, S.: Cryptanalysis of RSA with two decryption exponents. Inf. Process. Lett. 110(5), 178\u2013181 (2010)","journal-title":"Inf. Process. Lett."},{"key":"508_CR22","doi-asserted-by":"publisher","DOI":"10.1080\/01611194.2022.2109943","author":"R Santosh Kumar","year":"2022","unstructured":"Santosh Kumar, R., Krishna, S.R.M.: Cryptanalysis of RSA with the small difference of primes and two decryption exponents: Jochemsz and May approach. Cryptologia (2022). https:\/\/doi.org\/10.1080\/01611194.2022.2109943","journal-title":"Cryptologia"},{"key":"508_CR23","doi-asserted-by":"crossref","unstructured":"Hinek, M.J., Yam, C.C.Y.: Common modulus attacks on small private exponent RSA and some fast variants (in practice), Cryptology ePrint Archive, Report 2009\/037 (2009)","DOI":"10.1515\/jmc.2010.003"},{"key":"508_CR24","first-page":"31","volume-title":"EUROCRYPT, Lecture Notes in Computer Science","author":"RL Rivest","year":"1986","unstructured":"Rivest, R.L., Shamir, A.: Efficient Factoring based on partial information. In: Pichler, F. (ed.) EUROCRYPT, Lecture Notes in Computer Science, vol. 219, pp. 31\u201334. Springer, Berlin (1986)"},{"key":"508_CR25","first-page":"178","volume-title":"EUROCRYPT, Lecture Notes in Computer Science","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, Lecture Notes in Computer Science, vol. 1070, pp. 178\u2013189. Springer, Berlin (1996)"},{"key":"508_CR26","first-page":"25","volume-title":"ASIA-CRYPT, Lecture Notes in Computer Science","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.) ASIA-CRYPT, Lecture Notes in Computer Science, vol. 1514, pp. 25\u201334. Springer, Berlin (1998)"},{"key":"508_CR27","unstructured":"Hermann, M, May A.: On factoring arbitrary integers with known bits. Cryptology ePrint Archive, Report 374 (2007)"},{"key":"508_CR28","first-page":"4","volume-title":"CaLC, volume 2146 of Lecture Notes in Computer Science","author":"J Blomer","year":"2001","unstructured":"Blomer, J., May, A.: Low secret exponent RSA revisited. In: Silverman, J.H. (ed.) CaLC, volume 2146 of Lecture Notes in Computer Science, pp. 4\u201319. Springer, Heidelberg (2001)"},{"issue":"4","key":"508_CR29","first-page":"1121","volume":"3","author":"A Nitaj","year":"2013","unstructured":"Nitaj, A.: A new attack on RSA with a composed decryption exponent. Int. J. Cryptogr. Inf. Secur. 3(4), 1121 (2013)","journal-title":"Int. J. Cryptogr. Inf. Secur."},{"key":"508_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2018.08.021","volume":"761","author":"A Takayasu","year":"2019","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA: achieving the Boneh\u2013Durfee bound. Theor. Comput. Sci.. Comput. Sci. 761, 51\u201377 (2019)","journal-title":"Theor. Comput. Sci.. Comput. Sci."},{"key":"508_CR31","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2020.07.004","volume":"841","author":"K Suzuki","year":"2020","unstructured":"Suzuki, K., Takayasu, A., Kunihiro, N.: Extended partial key exposure attacks on RSA: improvement up to full-size decryption exponents. Theor. Comput. Sci.. Comput. Sci. 841, 62\u201383 (2020)","journal-title":"Theor. Comput. Sci.. Comput. Sci."},{"key":"508_CR32","unstructured":"Proos , J.A.: Imperfect Decryption and Partial Information Attacks in Cryptography. PhD thesis, University of Waterloo (2003)"},{"key":"508_CR33","doi-asserted-by":"crossref","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: ASIACRYPT 2006, LNCS, vol. 4284, pp. 267\u2013282. Springer-Verlag (2006)","DOI":"10.1007\/11935230_18"},{"key":"508_CR34","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham, N.: Finding small roots univariate modular equations revisited. In: cryptography and coding, LNCS 1355, pp. 131\u2013142. Springer-Verlag (1997)","DOI":"10.1007\/BFb0024458"},{"key":"508_CR35","unstructured":"Stein, W.A., et al.: Sage Mathematical Software. The Sage Development Team (2011), http:\/\/www.sagemath.org"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-023-00508-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-023-00508-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-023-00508-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T11:24:52Z","timestamp":1708687492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-023-00508-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,20]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s11416-023-00508-8","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,20]]},"assertion":[{"value":"21 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}