{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T19:05:27Z","timestamp":1771614327160,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030882372","type":"print"},{"value":"9783030882389","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88238-9_8","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T08:17:47Z","timestamp":1632903467000},"page":"151-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Classical Attacks on a Variant of the RSA Cryptosystem"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[]},{"given":"Muhammad Rezal Bin Kamel","family":"Ariffin","sequence":"additional","affiliation":[]},{"given":"Nurul Nur Hanisah","family":"Adenan","sequence":"additional","affiliation":[]},{"given":"Nur Azman","family":"Abu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Adenan, N.N.H., Ariffin, M.R.K., Sapar, S.H., Ghafar, A.H.A., Asbullah, M.A.: New Jochemsz-May cryptanalytic bound for RSA system utilizing common modulus $$N=p^2q$$. Mathematics 9(4), 340 (2021). https:\/\/www.mdpi.com\/2227-7390\/9\/4\/340","DOI":"10.3390\/math9040340"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24632-9_1","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J Bl\u00f6mer","year":"2004","unstructured":"Bl\u00f6mer, J., May, A.: A generalized Wiener attack on RSA. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 1\u201313. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24632-9_1"},{"issue":"2","key":"8_CR3","first-page":"203","volume":"46","author":"D Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices Amer. Math. Soc. 46(2), 203\u2013213 (1999)","journal-title":"Notices Amer. Math. Soc."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 1998","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.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 25\u201334. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49649-1_3"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring $$N=p^rq$$ for large $$r$$. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 326\u2013337. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_21"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48910-X_1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 1\u201311. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_1"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Boudabra, M., Nitaj, A.: A new generalization of the KMOV cryptosystem. J. Appl. Math. Comput. 57(1-2), 229\u2013245 (2018)","DOI":"10.1007\/s12190-017-1103-6"},{"issue":"4","key":"8_CR8","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. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-48285-7_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1993","author":"N Demytko","year":"1994","unstructured":"Demytko, N.: A new elliptic curve based analogue of RSA. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 40\u201349. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_4"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Ernst","year":"2005","unstructured":"Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial key exposure attacks on RSA up to full size exponents. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 371\u2013386. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_22"},{"key":"8_CR12","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edition. The Clarendon Press, Oxford University Press, New York (1979)"},{"key":"8_CR13","series-title":"Cryptography and Network Security Series","doi-asserted-by":"publisher","DOI":"10.1201\/9781420075199","volume-title":"Cryptanalysis of RSA and its Variants","author":"M Hinek","year":"2009","unstructured":"Hinek, M.: Cryptanalysis of RSA and its Variants. Cryptography and Network Security Series, Chapman & Hall\/CRC, Boca Raton (2009)"},{"key":"8_CR14","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). https:\/\/doi.org\/10.1007\/BFb0024458"},{"key":"8_CR15","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). https:\/\/doi.org\/10.1007\/11935230_18"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-49264-X_27","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1995","author":"K Koyama","year":"1995","unstructured":"Koyama, K.: Fast RSA-type schemes based on singular cubic curves $$y^{2}+axy \\equiv x^{3}({\\rm mod}\\,\\mathit{n})$$. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 329\u2013340. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_27"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-46766-1_20","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"K Koyama","year":"1992","unstructured":"Koyama, K., Maurer, U.M., Okamoto, T., Vanstone, S.A.: New public-key schemes based on elliptic curves over the ring $$\\mathbb{Z}_n$$. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 252\u2013266. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_20"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Kuwakado H., Koyama K., Tsuruoka, Y.: A new RSA-type scheme based on singular cubic curves $$y^{2}\\equiv x^{3}+bx^{2}({\\rm mod}\\, \\mathit{n})$$. IEICE Trans. Fundamentals E78-A, 27\u201333 (1995)","DOI":"10.1007\/3-540-49264-X_27"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 513\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"AK Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1\u201319. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_1"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-76620-1_6","volume-title":"Number-Theoretic Methods in Cryptology","author":"N Murru","year":"2018","unstructured":"Murru, N., Saettone, F.M.: A novel RSA-like cryptosystem based on a generalization of the R\u00e9dei rational functions. In: Kaczorowski, J., Pieprzyk, J., Pomyka\u0142a, J. (eds.) NuTMiC 2017. LNCS, vol. 10737, pp. 91\u2013103. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76620-1_6"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-68164-9_12","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"A Nitaj","year":"2008","unstructured":"Nitaj, A.: Another generalization of Wiener\u2019s attack on RSA. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 174\u2013190. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_12"},{"issue":"2","key":"8_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","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 Cryptogr. 73(2), 383\u2013392 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR25","unstructured":"Takagi, T.: A fast RSA-type public-key primitive modulo $$p^kq$$ using Hensel lifting. IEICE Trans. 87-A, 94\u2013101 (2004)"},{"issue":"1","key":"8_CR26","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."},{"key":"8_CR27","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"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88238-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:57:23Z","timestamp":1710269843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88238-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030882372","9783030882389"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88238-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bogot\u00e1","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/urosario.edu.co\/Latin-Crypt\/inicio\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}