{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T05:00:19Z","timestamp":1764997219936,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030109691"},{"type":"electronic","value":"9783030109707"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10970-7_19","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T10:12:15Z","timestamp":1547287935000},"page":"421-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Generalized Attack on Some Variants of the RSA Cryptosystem"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"Tonien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"key":"19_CR1","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"},{"key":"19_CR2","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 N0.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"},{"issue":"2","key":"19_CR3","first-page":"203","volume":"46","author":"D Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices Am. Math. Soc. 46(2), 203\u2013213 (1999)","journal-title":"Notices Am. Math. Soc."},{"issue":"1","key":"19_CR4","first-page":"1","volume":"5","author":"D Boneh","year":"2002","unstructured":"Boneh, D., Shacham, H.: Fast variants of RSA. CryptoBytes 5(1), 1\u20139 (2002)","journal-title":"CryptoBytes"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-319-40367-0_16","volume-title":"Information Security and Privacy","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). https:\/\/doi.org\/10.1007\/978-3-319-40367-0_16"},{"key":"19_CR6","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. Theor. Comput. Sci. 704, 74\u201381 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"3\u201313","key":"19_CR7","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.ffa.2006.05.004","volume":"13","author":"G Castagnos","year":"2007","unstructured":"Castagnos, G.: An efficient probabilistic public-key cryptosystem over quadratic field quotients. Finite Fields Appl. 13(3\u201313), 563\u2013576 (2007)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"19_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":"19_CR9","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)"},{"key":"19_CR10","series-title":"Chapman & Hall\/CRC Cryptography and Network Security","volume-title":"Cryptanalysis of RSA and its Variants","author":"MJ Hinek","year":"2010","unstructured":"Hinek, M.J.: Cryptanalysis of RSA and its Variants. Chapman & Hall\/CRC Cryptography and Network Security. CRC Press, Boca Raton (2010)"},{"key":"19_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":"19_CR12","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":"19_CR13","first-page":"27","volume":"E78\u2013A","author":"H Kuwakado","year":"1995","unstructured":"Kuwakado, H., Koyama, K., Tsuruoka, Y.: A new RSA-type scheme based on singular cubic curves $$y^2=x^3+bx^2~(\\text{ mod } \\; n)$$. IEICE Trans. Fundam. E78\u2013A, 27\u201333 (1995)","journal-title":"IEICE Trans. Fundam."},{"key":"19_CR14","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":"19_CR15","unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. Ph.D. thesis. University of Paderborn (2003). http:\/\/www.cits.rub.de\/imperia\/md\/content\/may\/paper\/bp.ps"},{"key":"19_CR16","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-02295-1_10","volume-title":"The LLL Algorithm","author":"A May","year":"2007","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems. In: Nguyen, P., Vall\u00e9e, B. (eds.) The LLL Algorithm. Information Security and Cryptography, pp. 315\u2013348. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-642-02295-1_10"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-54705-3_9","volume-title":"Information Security and Cryptology","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). https:\/\/doi.org\/10.1007\/978-3-319-54705-3_9"},{"issue":"21","key":"19_CR18","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(21), 905\u2013907 (1982)","journal-title":"Electron. Lett."},{"issue":"2","key":"19_CR19","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":"19_CR20","unstructured":"Smith, P.J., Lennon, G.J.J.: LUC: a new public key cryptosystem. In: Ninth IFIP Symposium on Computer Science Security, pp. 103\u2013117. Elseviver Science Publishers (1993)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology \u2014 CRYPTO 1998","author":"T Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo pkq. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 318\u2013326. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055738"},{"key":"19_CR22","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":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-89339-6_15","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"M Zheng","year":"2018","unstructured":"Zheng, M., Kunihiro, N., Hu, H.: Cryptanalysis of RSA variants with modified Euler quotient. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 266\u2013281. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_15"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10970-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T01:05:46Z","timestamp":1673485546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10970-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030109691","9783030109707"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10970-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Calgary, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ucalgary.ca\/cpsc\/selected-areas-cryptography\/","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":"57","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":"39% - 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","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}