{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T14:52:38Z","timestamp":1762095158897,"version":"build-2065373602"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"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-00507-9","type":"journal-article","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T15:02:57Z","timestamp":1699455777000},"page":"185-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Partial key exposure attack on RSA using some private key blocks"],"prefix":"10.1007","volume":"20","author":[{"given":"Santosh Kumar","family":"Ravva","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,11,8]]},"reference":[{"issue":"2","key":"507_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, M.: A Method for obtaining digital signatures and public key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"507_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"},{"issue":"4","key":"507_CR3","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^292. IEEE Trans. Inf. Theory 46(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"507_CR4","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 (2001)"},{"issue":"1","key":"507_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s002000100088","volume":"13","author":"B De Weger","year":"2002","unstructured":"De Weger, B.: Cryptanalysis of RSA with small prime difference. Appl. Algebra Eng. Commun. Comput. 13(1), 17\u201328 (2002)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3","key":"507_CR6","first-page":"14","volume":"61","author":"R Santosh Kumar","year":"2013","unstructured":"Santosh Kumar, R., Narasimham, C., Pallamsetty, S.: Cryptanalysis of RSA with a small prime difference by using Unravelled linearization. Int. J. Comput. Appl. 61(3), 14\u201316 (2013)","journal-title":"Int. J. Comput. Appl."},{"key":"507_CR7","doi-asserted-by":"crossref","unstructured":"Santosh Kumar, R., Krishna, S.R.M.: Cryptanalysis of RSA with small difference of primes and two decryption exponents: Jochemsz and May approach. Cryptologia (2022)","DOI":"10.1080\/01611194.2022.2109943"},{"key":"507_CR8","first-page":"176","volume-title":"ACISP, LNCS","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kuniharo, N.: Cryptanalysis of RSA with multiple secret exponents. In: Takayasu, A., Kunihiro, N. (eds.) ACISP, LNCS, vol. 8544, pp. 176\u2013191. Springer, NSW, Australia (2014)"},{"issue":"8\u20139","key":"507_CR9","first-page":"336","volume":"110","author":"S Sarkar","year":"2009","unstructured":"Sarkar, S., Maitra, S.: Cryptanalysis of RSA with more than one decryption exponent. Inf. Process. Lett. 110(8\u20139), 336\u2013340 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"507_CR10","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":"507_CR11","doi-asserted-by":"publisher","first-page":"103470","DOI":"10.1016\/j.csi.2020.103470","volume":"74","author":"W Susilo","year":"2021","unstructured":"Susilo, W., Tonien, J., Yang, G.: Divide and capture: an improved cryptanalysis of the encryption standard algorithm RSA. Comput. Stand. Interfaces 74, 103470 (2021)","journal-title":"Comput. Stand. Interfaces"},{"key":"507_CR12","first-page":"1","volume":"40","author":"A Nitaj","year":"2021","unstructured":"Nitaj, A., Ariffin, M.R.K., Adenan, N.N.H., Merenda, D.S., Ahmadian, A.: Exponential increment of RSA attack range via lattice-based cryptanalysis. Multimedia Tools Appl. 40, 1\u201316 (2021)","journal-title":"Multimedia Tools Appl."},{"issue":"4","key":"507_CR13","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s11432-009-0014-z","volume":"52","author":"P Luo","year":"2009","unstructured":"Luo, P., Zhou, H., Wang, D., Dai, Y.: Cryptanalysis of RSA for a special case with d > e. Sci. China Ser. F Inf. Sci. 52(4), 609\u2013616 (2009)","journal-title":"Sci. China Ser. F Inf. Sci."},{"issue":"2","key":"507_CR14","first-page":"102","volume":"14","author":"M Mumtaz","year":"2019","unstructured":"Mumtaz, M., Ping, L.: An improved cryptanalysis for large RSA decryption exponent with constrained secret key\u2019. Int. J. Inf. Comput. Secur. 14(2), 102\u2013117 (2019)","journal-title":"Int. J. Inf. Comput. Secur."},{"key":"507_CR15","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 (1986)"},{"key":"507_CR16","first-page":"155","volume-title":"EUROCRYPT, Lecture Notes in Computer Science","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small roots of a univariate modular equation. In: Maurer, U.M. (ed.) EUROCRYPT, Lecture Notes in Computer Science, vol. 1070, pp. 155\u2013165. Springer (1996)"},{"issue":"4","key":"507_CR17","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., Jr., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"507_CR18","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 (1996)"},{"key":"507_CR19","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 (1998)"},{"key":"507_CR20","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, New York (2003)"},{"key":"507_CR21","first-page":"371","volume-title":"EUROCRYPT, Lecture Notes in Computer Science","author":"M Ernst","year":"2005","unstructured":"Ernst, M., Jochemsz, E., May, A., deWeger, B.: Partial key exposure attacks on RSA up to full size exponents. In: Cramer, R. (ed.) EUROCRYPT, Lecture Notes in Computer Science, vol. 3494, pp. 371\u2013386. Springer (2005)"},{"issue":"4","key":"507_CR22","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 key exposure attacks on RSA and its variant by guessing a few bits of one of the prime factors. Bull. Korean Math. Soc. 46(4), 721\u2013741 (2009)","journal-title":"Bull. Korean Math. Soc."},{"key":"507_CR23","first-page":"34","volume-title":"Public Key Cryptography, 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, Lecture Notes in Computer Science, vol. 5443, pp. 34\u201353. Springer (2009)"},{"key":"507_CR24","first-page":"345","volume-title":"Selected Areas in Cryptography\u2014SAC 2014\u201421st International Conference Lecture Notes in Computer Science","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.M. (eds.) Selected Areas in Cryptography\u2014SAC 2014\u201421st International Conference Lecture Notes in Computer Science, vol. 8781, pp. 345\u2013362. Springer (2014)"},{"key":"507_CR25","doi-asserted-by":"crossref","unstructured":"Joye, M., Le Point, L.: Partial Key Exposure on RSA with private exponents larger than N. In: Proceedings of the 8th International Conference on Information Security Practice and Experience, vol. 7232, pp. 369\u2013380 (2012)","DOI":"10.1007\/978-3-642-29101-2_25"},{"key":"507_CR26","first-page":"58","volume-title":"Topics in Cryptology\u2014CT-RSA 2017\u2014The Cryptographers\u2019 Track at the RSA Conference 2017, Lecture Notes in Computer Science","author":"A Takayasu","year":"2017","unstructured":"Takayasu, A., Kunihiro, N.: A tool kit for partial key exposure attacks on RSA. In: Handschuh, H. (ed.) Topics in Cryptology\u2014CT-RSA 2017\u2014The Cryptographers\u2019 Track at the RSA Conference 2017, Lecture Notes in Computer Science, vol. 10159, pp. 58\u201373. Springer (2017)"},{"key":"507_CR27","doi-asserted-by":"crossref","unstructured":"Alex Halderman, J., Schoen, D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J., Feldman, J., Appelbaum, J., Felten, W.: Lest we remember: cold boot attacks on encryption keys. In: 17th USENIX Security Symposium, San Jose, CA (2008)","DOI":"10.1145\/1506409.1506429"},{"key":"507_CR28","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., Chattarjee, S. (eds.) INDOCRYPT, Lecture Notes in Computer Science, vol. 7107, pp. 76\u201392. Springer (2011)"},{"issue":"2","key":"507_CR29","first-page":"203","volume":"46","author":"D Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Not. Am. Math. Soc. 46(2), 203\u2013213 (1999)","journal-title":"Not. Am. Math. Soc."},{"issue":"1","key":"507_CR30","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/09720529.2018.1564201","volume":"22","author":"M Mumtaz","year":"2019","unstructured":"Mumtaz, M., Ping, L.: Forty years of attacks on the RSA cryptosystem: a brief survey. J. Discrete Math. Sci. Cryptogr. 22(1), 9\u201329 (2019)","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"issue":"2","key":"507_CR31","first-page":"102","volume":"14","author":"M Mumtaz","year":"2019","unstructured":"Mumtaz, M., Ping, L.: An improved cryptanalysis for large RSA decryption exponent with constrained secret key. Int. J. Inf. Comput. Secur. 14(2), 102\u2013117 (2019)","journal-title":"Int. J. Inf. Comput. Secur."},{"key":"507_CR32","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2013. ASIACRYPT 2013. Lecture Notes in Computer Science","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., et al.: Factoring RSA keys from certified smart cards: coppersmith in the wild. In: Sako, K., Sarkar, P. (eds.) Advances in Cryptology\u2014ASIACRYPT 2013. ASIACRYPT 2013. Lecture Notes in Computer Science, vol. 8270. Springer (2013)"},{"key":"507_CR33","unstructured":"Proos, J.A.: Imperfect Decryption and Partial Information Attacks in Cryptography. Ph.D. thesis, University of Waterloo (2003)"},{"key":"507_CR34","first-page":"131","volume-title":"IMA International Conference, Volume 1355 of Lecture Notes in Computer Science","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M. (ed.) IMA International Conference, Volume 1355 of Lecture Notes in Computer Science, pp. 131\u2013142. Springer (1997)"},{"key":"507_CR35","first-page":"492","volume-title":"EUROCRYPT, Volume 3027 of Lecture Notes in Computer Science","author":"J-S Coron","year":"2004","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations revisited. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT, Volume 3027 of Lecture Notes in Computer Science, pp. 492\u2013505. Springer (2004)"},{"key":"507_CR36","unstructured":"Jochemsz, E.: Cryptanalysis of RSA Variants Using Small roots of Polynomials. Ph.D. thesis, Technische Universiteit Eindhoven (2007)"},{"key":"507_CR37","first-page":"267","volume-title":"ASIACRYPT, Lecture Notes in Computer Science","author":"E Jochmesz","year":"2007","unstructured":"Jochmesz, E., deWeger, B.: A Strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: Lai, X., Chen, K. (eds.) ASIACRYPT, Lecture Notes in Computer Science, vol. 4284, pp. 267\u2013282. Springer (2007)"},{"key":"507_CR38","unstructured":"Hermann, M., May, A.: On factoring arbitrary integers with known bits. Cryptology ePrint Archive, report 374 (2007)"},{"key":"507_CR39","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. Theoret. Comput. Sci. 841, 62\u201383 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"507_CR40","unstructured":"Developers, T.S., Stein, W., Joyner, D., Kohel, D., Cremona, J., Er\u00f6cal, B.: SageMath. 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-00507-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-023-00507-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-023-00507-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T11:25:13Z","timestamp":1708687513000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-023-00507-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,8]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["507"],"URL":"https:\/\/doi.org\/10.1007\/s11416-023-00507-9","relation":{},"ISSN":["2263-8733"],"issn-type":[{"type":"electronic","value":"2263-8733"}],"subject":[],"published":{"date-parts":[[2023,11,8]]},"assertion":[{"value":"10 August 2022","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":"8 November 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"}}]}}