{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:20:04Z","timestamp":1743157204256,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030519377"},{"type":"electronic","value":"9783030519384"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51938-4_19","type":"book-chapter","created":{"date-parts":[[2020,7,4]],"date-time":"2020-07-04T11:02:54Z","timestamp":1593860574000},"page":"382-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Attacking RSA Using an Arbitrary Parameter"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5000-354X","authenticated-orcid":false,"given":"Muhammad Rezal Kamel","family":"Ariffin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3293-1160","authenticated-orcid":false,"given":"Amir Hamzah Abd","family":"Ghafar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0778-4456","authenticated-orcid":false,"given":"Muhammad Asyraf","family":"Asbullah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,5]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3390\/cryptography3010002","volume":"3","author":"MRK Ariffin","year":"2019","unstructured":"Ariffin, M.R.K., Abubakar, S.I., Yunos, F., Asbullah, M.A.: New cryptanalytic attack on RSA modulus $$N= pq$$ using small prime difference method. Cryptography 3(1), 2 (2019)","journal-title":"Cryptography"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"012019","DOI":"10.1088\/1742-6596\/622\/1\/012019","volume":"622","author":"M Asbullah","year":"2015","unstructured":"Asbullah, M., Ariffin, M.: New attacks on RSA with modulus $$N= p^2q$$ using continued fractions. J. Phy. Conf. Ser. 622, 012019 (2015)","journal-title":"J. Phy. Conf. Ser."},{"key":"19_CR3","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24632-9_1"},{"key":"19_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0091539","volume-title":"The Development of the Number Field Sieve","author":"JP Buhler","year":"1993","unstructured":"Buhler, J.P., Lenstra, H.W., Pomerance, C.: Factoring integers with the number field sieve. In: Lenstra, A.K., Lenstra, H.W. (eds.) The Development of the Number Field Sieve. LNM, vol. 1554, pp. 50\u201394. Springer, Heidelberg (1993). \nhttps:\/\/doi.org\/10.1007\/BFb0091539"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","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. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 178\u2013189. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-68339-9_16"},{"issue":"4","key":"19_CR6","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":"19_CR7","volume-title":"An Introduction to the Theory of Numbers","author":"GH Hardy","year":"1979","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. Oxford University Press, Oxford (1979)"},{"key":"19_CR8","unstructured":"Hinek, M.J.: On the security of some variants of RSA. Ph.D. thesis, University of Waterloo (2007)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra Jr","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. Math. 126, 649\u2013673 (1987)","journal-title":"Ann. Math."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-85886-7_16","volume-title":"Information Security","author":"S Maitra","year":"2008","unstructured":"Maitra, S., Santanu, S.: Revisiting Wiener\u2019s attack - new weak keys in RSA. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 228\u2013243. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85886-7_16"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-02384-2_7","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"A Nitaj","year":"2009","unstructured":"Nitaj, A.: Cryptanalysis of RSA using the ratio of the primes. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 98\u2013115. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02384-2_7"},{"issue":"2","key":"19_CR12","first-page":"203","volume":"21","author":"A Nitaj","year":"2011","unstructured":"Nitaj, A.: A new vulnerable class of exponents in RSA. JP J. Algebra Number Theory Appl. 21(2), 203\u2013220 (2011)","journal-title":"JP J. Algebra Number Theory Appl."},{"issue":"2","key":"19_CR13","first-page":"131","volume":"23","author":"A Nitaj","year":"2011","unstructured":"Nitaj, A.: New weak RSA keys. JP J. Algebra Number Theory Appl. 23(2), 131\u2013148 (2011)","journal-title":"JP J. Algebra Number Theory Appl."},{"key":"19_CR14","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-29694-9_7","volume-title":"Artificial Intelligence, Evolutionary Computing and Metaheuristics","author":"A Nitaj","year":"2013","unstructured":"Nitaj, A.: Diophantine and lattice cryptanalysis of the RSA cryptosystem. In: Yang, X.S. (ed.) Artificial Intelligence, Evolutionary Computing and Metaheuristics. Studies in Computational Intelligence, vol. 427, pp. 139\u2013168. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29694-9_7"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-06734-6_12","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"A Nitaj","year":"2014","unstructured":"Nitaj, A., Ariffin, M.R.K., Nassr, D.I., Bahig, H.M.: New attacks on the RSA cryptosystem. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT 2014. LNCS, vol. 8469, pp. 178\u2013198. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-06734-6_12"},{"issue":"2","key":"19_CR16","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.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener, M.J.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Theory 36(3), 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51938-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T23:12:58Z","timestamp":1594249978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51938-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030519377","9783030519384"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51938-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cairo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egypt","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/africacrypt2020.org\/index.html","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"21","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":"43% - 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":"4.2","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":"No","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 was held 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}