{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:03:22Z","timestamp":1764997402668,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030913557"},{"type":"electronic","value":"9783030913564"}],"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-91356-4_3","type":"book-chapter","created":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T06:01:25Z","timestamp":1637906485000},"page":"42-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cryptanalysis of RSA Variants with Primes Sharing Most Significant Bits"],"prefix":"10.1007","author":[{"given":"Meryem","family":"Cherkaoui-Semmouni","sequence":"first","affiliation":[]},{"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"Tonien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$. In: Advances in Cryptology-Eurocrypt 1999, Lecture Notes in Computer Science, vol. 1592, Springer-Verlag, pp. 1\u201311 (1999)","DOI":"10.1007\/3-540-48910-X_1"},{"issue":"2","key":"3_CR2","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":"3_CR3","series-title":"LNCS","first-page":"258","volume-title":"ACISP 2016","author":"M Bunder","year":"2016","unstructured":"Bunder, M., Nitaj, A., Susilo, W., Tonien, J.: A new attack on three variants of the RSA cryptosystem. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9723, pp. 258\u2013268. Springer, Cham (2016)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2017.09.009","volume":"704","author":"M Bunder","year":"2017","unstructured":"Bunder, M., Nitaj, A., Susilo, W., Tonien, J.: A generalized attack on RSA type cryptosystems. Theoretical Comput. Sci. 704, 74\u201381 (2017)","journal-title":"Theoretical Comput. Sci."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Castagnos, G.: An efficient probabilistic public-key cryptosystem over quadratic field quotients, 2007, Finite Fields and Their Applications, 13(3\u201313), p. 563\u2013576 (2007). http:\/\/www.math.u-bordeaux1.fr\/~gcastagn\/publi\/crypto_quad.pdf","DOI":"10.1016\/j.ffa.2006.05.004"},{"key":"3_CR6","unstructured":"Collins, T., Hopkins, D., Langford, S., Sabin, M.: Public key cryptographic apparatus and Method. US Patent 5,848,159, Jan 1997"},{"issue":"4","key":"3_CR7","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. Crypt. 10(4), 233\u2013260 (1997)","journal-title":"J. Crypt."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Elkamchouchi, H., Elshenawy, K., Shaban, H.: Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers. In: Proceedings of the 8th International Conference on Communication Systems, pp. 91\u201395 (2002)","DOI":"10.1109\/ICCS.2002.1182444"},{"key":"3_CR9","volume-title":"An Introduction to Theory of Numbers","author":"GH Hardy","year":"1979","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to Theory of Numbers, 5th edn. The Clarendon Press, Oxford University Press, New York (1979)","edition":"5"},{"key":"3_CR10","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. Chapman & Hall\/CRC, Cryptography and Network Security Series, Boca Raton (2009)"},{"key":"3_CR11","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":"3_CR12","unstructured":"Kuwakado, H., Koyama, K. Tsuruoka, Y.: A new RSA-type scheme based on singular cubic curves $$y^2=x^3+bx^2~({\\rm mod}\\; n)$$. IEICE Transactions on Fundamentals, vol. E78-A, pp. 27\u201333 (1995)"},{"key":"3_CR13","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. Math. Ann. 261, 513\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"3_CR14","unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods, PhD Thesis, University of Paderborn (2003)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-10970-7_19","volume-title":"Selected Areas in Cryptography","author":"A Nitaj","year":"2018","unstructured":"Nitaj, A., Pan, Y., Tonien, J.: A generalized attack on some variants of the RSA cryptosystem. In: Cid, C., Jacobson, M., Jr. (eds.) SAC 2018. LNCS, vol. 11349, pp. 421\u2013433. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_19"},{"issue":"2","key":"3_CR16","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"},{"key":"3_CR17","first-page":"103","volume-title":"LUC: A New Public-Key Cryptosystem","author":"PJ Smith","year":"1993","unstructured":"Smith, P.J., Lennon, G.J.J.: LUC: A New Public-Key Cryptosystem, pp. 103\u2013117. Elsevier Science Publishers, Ninth IFIP Symposium on Computer Science Security (1993)"},{"key":"3_CR18","series-title":"LNCS","first-page":"140","volume-title":"Inscrypt 2016","author":"L Peng","year":"2017","unstructured":"Peng, L., Hu, L., Lu, Y., Wei, H.: An improved analysis on three variants of the RSA cryptosystem. In: Chen, K., Lin, D., Yung, M. (eds.) Inscrypt 2016. LNCS, vol. 10143, pp. 140\u2013149. Springer, Cham (2017)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public key cryptosystem. Electron. Lett. 18, 905\u2013907 (1982)","journal-title":"Electron. Lett."},{"issue":"1","key":"3_CR20","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":"3_CR21","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":"3_CR22","doi-asserted-by":"crossref","unstructured":"Zheng, M., Kunihiro, N., Hu, H.: Cryptanalysis of RSA Variants with Modified Euler Quotient. In: Joux A., Nitaj A., Rachidi T. (eds.) Progress in Cryptology-AFRICACRYPT 2018. AFRICACRYPT 2018. Lecture Notes in Computer Science, vol. 10831. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-89339-6_15"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91356-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T01:20:39Z","timestamp":1726190439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91356-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030913557","9783030913564"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91356-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isw2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isc2021.petra.ac.id\/","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":"87","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":"24% - 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 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)"}}]}}