{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T04:28:39Z","timestamp":1730348919266,"version":"3.28.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:00:00Z","timestamp":1730246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:00:00Z","timestamp":1730246400000},"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 Supercomput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11227-024-06478-y","type":"journal-article","created":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:54:09Z","timestamp":1730300049000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An optimal bound for factoring unbalanced RSA moduli by solving Generalized Implicit Factorization Problem"],"prefix":"10.1007","volume":"81","author":[{"given":"Ran","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingguo","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haipeng","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,30]]},"reference":[{"issue":"10","key":"6478_CR1","doi-asserted-by":"publisher","first-page":"442","DOI":"10.3390\/info13100442","volume":"13","author":"EA Adeniyi","year":"2022","unstructured":"Adeniyi EA, Falola PB, Maashi MS et al (2022) Secure sensitive data sharing using RSA and ElGamal cryptographic algorithms with hash functions. Information 13(10):442","journal-title":"Information"},{"key":"6478_CR2","doi-asserted-by":"crossref","unstructured":"Aono Y (2009) A New Lattice Construction for Partial Key Exposure Attack for RSA. Public Key Cryptography-PKC 2009: 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18-20, 2009. Proceedings 12. Springer Berlin Heidelberg: 34-53","DOI":"10.1007\/978-3-642-00468-1_3"},{"key":"6478_CR3","volume":"66","author":"A Barenghi","year":"2022","unstructured":"Barenghi A, Carrera D, Mella S et al (2022) Profiled side channel attacks against the RSA cryptosystem using neural networks. J Inf Secur Appl 66:103122","journal-title":"J Inf Secur Appl"},{"key":"6478_CR4","unstructured":"Bauer A, Jaulmes E, Lomn\u00e9 V (2014) Side-Channel Attack Against RSA Key Generation Algorithms. Cryptographic Hardware and Embedded Systems-CHES, et al (2014) 16th International Workshop, Busan, South Korea, September 23\u201326, 2014. Proceedings 16. Springer, Berlin Heidelberg:223\u2013241"},{"issue":"2","key":"6478_CR5","first-page":"203","volume":"46","author":"D Boneh","year":"1999","unstructured":"Boneh D (1999) Twenty years of attacks on the RSA cryptosystem. Not AMS 46(2):203\u2013213","journal-title":"Not AMS"},{"issue":"4","key":"6478_CR6","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D Boneh","year":"2000","unstructured":"Boneh D, Durfee G (2000) Cryptanalysis of RSA with private key d less than N\/sup 0.292. IEEE trans Inf Theory 46(4):1339\u20131349","journal-title":"IEEE trans Inf Theory"},{"issue":"5","key":"6478_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.comnet.2005.01.010","volume":"48","author":"D Brumley","year":"2005","unstructured":"Brumley D, Boneh D (2005) Remote timing attacks are practical. Comput Netw 48(5):701\u2013716","journal-title":"Comput Netw"},{"key":"6478_CR8","doi-asserted-by":"crossref","unstructured":"Carmon E, Seifert JP, Wool A (2017) Photonic Side Channel Attacks Against RSA. (2017) IEEE International Symposium on Hardware Oriented Security and Trust (HOST). IEEE:74\u201378","DOI":"10.1109\/HST.2017.7951801"},{"key":"6478_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2022.169676","volume":"267","author":"Z Chen","year":"2022","unstructured":"Chen Z, Ye G (2022) An asymmetric image encryption scheme based on hash SHA-3, RSA and compressive sensing. Optik 267:169676","journal-title":"Optik"},{"key":"6478_CR10","doi-asserted-by":"crossref","unstructured":"Coppersmith D (1996) Finding a Amall Root of a Bivariate Integer Equation; Factoring with High Bits Known. International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg: 178\u2013189","DOI":"10.1007\/3-540-68339-9_16"},{"key":"6478_CR11","doi-asserted-by":"crossref","unstructured":"Coppersmith D (1996) Finding a Small Root of a Univariate Modular Equation. International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg: 155\u2013165","DOI":"10.1007\/3-540-68339-9_14"},{"issue":"4","key":"6478_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith D (1997) Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J cryptol 10(4):233\u2013260","journal-title":"J cryptol"},{"key":"6478_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-006-0433-6","volume":"20","author":"JS Coron","year":"2007","unstructured":"Coron JS, May A (2007) Deterministic polynomial-time equivalence of computing the RSA secret key and factoring. J Cryptol 20:39\u201350","journal-title":"J Cryptol"},{"issue":"1","key":"6478_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2140\/obs.2013.1.271","volume":"1","author":"H Cohn","year":"2013","unstructured":"Cohn H, Heninger N (2013) Approximate common divisors via lattices. Open B Ser 1(1):271\u2013293","journal-title":"Open B Ser"},{"key":"6478_CR15","doi-asserted-by":"crossref","unstructured":"Ernst M, Jochemsz E, May A et al (2005) Partial Key Exposure Attacks on RSA Up to Full Size Exponents. Advances in Cryptology-EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005. Proceedings 24. Springer Berlin Heidelberg: 371\u2013386","DOI":"10.1007\/11426639_22"},{"key":"6478_CR16","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re JC, Marinier R, Renault G (2010) Implicit Factoring with Shared Most Significant and Middle Bits. Public Key Cryptography-PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings 13. Springer Berlin Heidelberg: 70\u201387","DOI":"10.1007\/978-3-642-13013-7_5"},{"key":"6478_CR17","doi-asserted-by":"crossref","unstructured":"Feng Y, Nitaj A, Pan Y (2023) Generalized Implicit Factorization Problem. International Conference on Selected Areas in Cryptography. Cham: Springer Nature Switzerland: 369\u2013384","DOI":"10.1007\/978-3-031-53368-6_18"},{"key":"6478_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114549","volume":"999","author":"Y Feng","year":"2024","unstructured":"Feng Y, Nitaj A, Pan Y (2024) Partial prime factor exposure attacks on some RSA variants. Theor Comput Sci 999:114549","journal-title":"Theor Comput Sci"},{"issue":"5","key":"6478_CR19","doi-asserted-by":"publisher","first-page":"1937","DOI":"10.1109\/JBHI.2021.3097237","volume":"26","author":"H Ghayvat","year":"2021","unstructured":"Ghayvat H, Pandya S, Bhattacharya P et al (2021) CP-BDHCA: Blockchain-based Confidentiality-Privacy preserving Big Data scheme for healthcare clouds and applications. IEEE J Biomed Health Inform 26(5):1937\u20131948","journal-title":"IEEE J Biomed Health Inform"},{"key":"6478_CR20","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham N (1997) Finding Small Roots of Univariate Modular Equations Revisited. IMA International Conference on Cryptography and Coding. Springer, Berlin, Heidelberg: 131\u2013142","DOI":"10.1007\/BFb0024458"},{"issue":"1","key":"6478_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3390\/cryptography3010002","volume":"3","author":"MR Kamel Ariffin","year":"2018","unstructured":"Kamel Ariffin MR, Abubakar SI, Yunos F et al (2018) New cryptanalytic attack on RSA modulus N= pq using small prime difference method. Cryptography 3(1):2","journal-title":"Cryptography"},{"key":"6478_CR22","unstructured":"Kota C M, Aissi C (2022) Implementation of the RSA algorithm and its cryptanalysis. 2002 GSW"},{"issue":"4","key":"6478_CR23","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1109\/JSSC.2021.3052146","volume":"56","author":"R Kumar","year":"2021","unstructured":"Kumar R, Liu X, Suresh V et al (2021) A time-\/frequency-domain side-channel attack resistant AES-128 and RSA-4K crypto-processor in 14-nm CMOS. IEEE J Solid-State Circuits 56(4):1141\u20131151","journal-title":"IEEE J Solid-State Circuits"},{"key":"6478_CR24","doi-asserted-by":"crossref","unstructured":"Lenstra AK, Lenstra Jr HW, Manasse MS, et al. (1990) The Number Field Sieve. Proceedings of the twenty-second annual ACM symposium on Theory of computing: 564\u2013572","DOI":"10.1145\/100216.100295"},{"key":"6478_CR25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math ann 261:515\u2013534","journal-title":"Math ann"},{"key":"6478_CR26","doi-asserted-by":"publisher","first-page":"243","DOI":"10.3934\/amc.2013.7.243","volume":"7","author":"Y Lu","year":"2013","unstructured":"Lu Y, Zhang R, Lin D (2013) Improved bounds for the implicit factorization problem. Adv Math Commun 7:243\u2013251","journal-title":"Adv Math Commun"},{"key":"6478_CR27","doi-asserted-by":"crossref","unstructured":"Lu Y, Peng L, Zhang R, (2016) Towards Optimal Bounds for Implicit Factorization Problem. Selected Areas in Cryptography-SAC (2015) 22nd International Conference, Sackville, NB, Canada, August 12\u201314, 2015, Revised Selected Papers 22. Springer International Publishing 2016:462\u2013476","DOI":"10.1007\/978-3-319-31301-6_26"},{"issue":"4","key":"6478_CR28","first-page":"609","volume":"52","author":"P Luo","year":"2009","unstructured":"Luo P, Zhou HJ, Wang DS et al (2009) Cryptanalysis of RSA for a special case with d> e. Sci China Ser F: Inf Sci 52(4):609\u2013616","journal-title":"Sci China Ser F: Inf Sci"},{"issue":"3","key":"6478_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3341729","volume":"16","author":"C Luo","year":"2019","unstructured":"Luo C, Fei Y, Kaeli D (2019) Side-channel timing attack of RSA on a GPU. ACM Trans Archit Code Optim (TACO) 16(3):1\u201318","journal-title":"ACM Trans Archit Code Optim (TACO)"},{"key":"6478_CR30","unstructured":"May A (2003) New RSA Vulnerabilities Using Lattice Reduction Methods. University of Paderborn. http:\/\/ubdata.uni-paderborn.de\/ediss\/17\/2003\/may\/disserta.pdf"},{"key":"6478_CR31","doi-asserted-by":"crossref","unstructured":"May A (2004) Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring. Advances in Cryptology-CRYPTO, (2004) 24th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15\u201319, 2004. Proceedings 24. Springer, Berlin Heidelberg :213\u2013219","DOI":"10.1007\/978-3-540-28628-8_13"},{"key":"6478_CR32","doi-asserted-by":"crossref","unstructured":"May A, Ritzenhofen M (2009) Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint. International Workshop on Public Key Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg: 1\u201314","DOI":"10.1007\/978-3-642-00468-1_1"},{"key":"6478_CR33","doi-asserted-by":"crossref","unstructured":"May A, Nowakowski J, Sarkar S (2022) Approximate Divisor Multiples-Factoring with Only a Third of the Secret CRT-Exponents. Annual International Conference on the Theory and Applications of Cryptographic Techniques. Cham: Springer International Publishing: 147\u2013167","DOI":"10.1007\/978-3-031-07082-2_6"},{"key":"6478_CR34","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s12190-014-0806-1","volume":"48","author":"A Nitaj","year":"2015","unstructured":"Nitaj A, Ariffin MRK (2015) Implicit factorization of unbalanced RSA moduli. J Appl Math Comput 48:349\u2013363","journal-title":"J Appl Math Comput"},{"key":"6478_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113898","volume":"960","author":"A Nitaj","year":"2023","unstructured":"Nitaj A, Susilo W, Tonien J (2023) A new attack on some RSA variants. Theor Comput Sci 960:113898","journal-title":"Theor Comput Sci"},{"key":"6478_CR36","doi-asserted-by":"crossref","unstructured":"Nitaj A, Adenan NNH, Ariffin MRK (2024) Cryptanalysis of a New Variant of the RSA Cryptosystem. International Conference on Cryptology in Africa. Cham: Springer Nature Switzerland: 327\u2013345","DOI":"10.1007\/978-3-031-64381-1_15"},{"key":"6478_CR37","doi-asserted-by":"crossref","unstructured":"Peng L, Hu L, Xu J, et al (2014) Further Improvement of Factoring RSA Moduli with Implicit Hint. International Conference on Cryptology in Africa. Cham: Springer International Publishing: 165\u2013177","DOI":"10.1007\/978-3-319-06734-6_11"},{"key":"6478_CR38","doi-asserted-by":"crossref","unstructured":"Peng L, Hu L, Lu Y, et al. (2015) Implicit factorization of RSA Moduli Revisited (short paper). Advances in Information and Computer Security: 10th International Workshop on Security, IWSEC 2015, Nara, Japan, August 26-28, 2015, Proceedings 10. Springer International Publishing: 67\u201376","DOI":"10.1007\/978-3-319-22425-1_5"},{"issue":"2","key":"6478_CR39","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"6478_CR40","doi-asserted-by":"crossref","unstructured":"Rivest RL, Shamir A (1986) Efficient Factoring Based on Partial Information. Advances in Cryptology\u00e2\u20ac\u201dEUROCRYPT\u201985: Proceedings of a Workshop on the Theory and Application of Cryptographic Techniques Linz, Austria, April 1985 4. Springer Berlin Heidelberg: 31\u201334","DOI":"10.1007\/3-540-39805-8_3"},{"key":"6478_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2021.103584","volume":"80","author":"WNAWM Ruzai","year":"2022","unstructured":"Ruzai WNAWM, Nitaj A, Ariffin MRK et al (2022) Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis. Comput Stand Interfaces 80:103584","journal-title":"Comput Stand Interfaces"},{"key":"6478_CR42","volume":"36","author":"WNA Ruzai","year":"2024","unstructured":"Ruzai WNA, Ariffin MRK, Asbullah MA et al (2024) New simultaneous Diophantine attacks on generalized RSA key equations. J K Saud Univ-Comput Inf Sci 36:102074","journal-title":"J K Saud Univ-Comput Inf Sci"},{"key":"6478_CR43","doi-asserted-by":"crossref","unstructured":"Sarkar S, Maitra S (2009) Further results on implicit factoring in polynomial time. Cryptology ePrint Archive https:\/\/eprint.iacr.org\/2009\/108","DOI":"10.3934\/amc.2009.3.205"},{"key":"6478_CR44","doi-asserted-by":"crossref","unstructured":"Sarkar S, Sen Gupta S, Maitra S (2010) Partial Key Exposure Attack on RSA-Improvements for Limited Lattice Dimensions. Progress in Cryptology-INDOCRYPT 2010: 11th International Conference on Cryptology in India, Hyderabad, India, December 12-15, 2010. Proceedings 11. Springer Berlin Heidelberg: 2\u201316","DOI":"10.1007\/978-3-642-17401-8_2"},{"key":"6478_CR45","doi-asserted-by":"crossref","unstructured":"Sarkar S (2011) Partial Key Exposure: Generalized Framework to Attack RSA. Progress in Cryptology-INDOCRYPT 2011: 12th International Conference on Cryptology in India, Chennai, India, December 11-14, 2011. Proceedings 12. Springer Berlin Heidelberg: 76\u201392","DOI":"10.1007\/978-3-642-25578-6_7"},{"issue":"6","key":"6478_CR46","doi-asserted-by":"publisher","first-page":"4002","DOI":"10.1109\/TIT.2011.2137270","volume":"57","author":"S Sarkar","year":"2011","unstructured":"Sarkar S, Maitra S (2011) Approximate integer common divisor problem relates to implicit factorization. IEEE Trans Inf Theory 57(6):4002\u20134013","journal-title":"IEEE Trans Inf Theory"},{"key":"6478_CR47","doi-asserted-by":"crossref","unstructured":"Sun Z, Zhang T, Zheng X, et al (2018) A Method for Solving Generalized Implicit Factorization Problem. International Conference On Signal And Information Processing, Networking And Computers. Singapore: Springer Singapore: 284\u2013290","DOI":"10.1007\/978-981-13-7123-3_34"},{"key":"6478_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2020.103470","volume":"74","author":"W Susilo","year":"2021","unstructured":"Susilo W, Tonien J, Yang G (2021) Divide and capture: an improved cryptanalysis of the encryption standard algorithm RSA. Comput Stand Interfaces 74:103470","journal-title":"Comput Stand Interfaces"},{"key":"6478_CR49","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.comcom.2019.12.015","volume":"150","author":"C Thirumalai","year":"2020","unstructured":"Thirumalai C, Mohan S, Srivastava G (2020) An efficient public key secure scheme for cloud and IoT security. Comput Commun 150:634\u2013643","journal-title":"Comput Commun"},{"key":"6478_CR50","first-page":"1","volume":"61","author":"S Wang","year":"2018","unstructured":"Wang S, Qu L, Li C et al (2018) A better bound for implicit factorization problem with shared middle bits. Sci China Inf Sci 61:1\u201310","journal-title":"Sci China Inf Sci"},{"issue":"3","key":"6478_CR51","doi-asserted-by":"publisher","first-page":"32108","DOI":"10.1007\/s11432-015-5325-7","volume":"59","author":"M Zheng","year":"2016","unstructured":"Zheng M, Hu H, Wang Z (2016) Generalized cryptanalysis of RSA with small public exponent. Sci China Inf Sci 59(3):32108","journal-title":"Sci China Inf Sci"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06478-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06478-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06478-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:56:20Z","timestamp":1730300180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06478-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,30]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6478"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06478-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,30]]},"assertion":[{"value":"2 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2024","order":2,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"102"}}