{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:10:34Z","timestamp":1767773434628,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T00:00:00Z","timestamp":1650672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T00:00:00Z","timestamp":1650672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Scientific Research Deanship, University of Hai\u2019l","award":["RG-21 124"],"award-info":[{"award-number":["RG-21 124"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11227-022-04470-y","type":"journal-article","created":{"date-parts":[[2022,4,23]],"date-time":"2022-04-23T02:02:35Z","timestamp":1650679355000},"page":"15730-15748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Speeding up wheel factoring method"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9448-6168","authenticated-orcid":false,"given":"Hazem M.","family":"Bahig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5550-3372","authenticated-orcid":false,"given":"Dieaa I.","family":"Nassr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0703-5826","authenticated-orcid":false,"given":"Mohammed A.","family":"Mahdi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0381-7441","authenticated-orcid":false,"given":"Mohamed A. G.","family":"Hazber","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3965-5018","authenticated-orcid":false,"given":"Khaled","family":"Al-Utaibi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8137-7939","authenticated-orcid":false,"given":"Hatem M.","family":"Bahig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,23]]},"reference":[{"issue":"3","key":"4470_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00200-017-0340-0","volume":"29","author":"O Akchiche","year":"2018","unstructured":"Akchiche O, Khadir O (2018) Factoring rsa moduli with primes sharing bits in the middle. Appl Algebra Eng. Commun. Comput. 29(3):245\u2013259","journal-title":"Appl Algebra Eng. Commun. Comput."},{"key":"4470_CR2","doi-asserted-by":"crossref","unstructured":"Atanassov E, Georgiev D, Manev N (2014) Number theory algorithms on gpu clusters. 2:131\u2013138","DOI":"10.1007\/978-3-319-01520-0_16"},{"key":"4470_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.18576\/amis\/110130","volume":"11","author":"HM Bahig","year":"2017","unstructured":"Bahig HM, Nassr DI, Bhery A (2017) Factoring rsa modulus with primes not necessarily sharing least significant bits. Appl Math Inform Sci 11:243\u2013249","journal-title":"Appl Math Inform Sci"},{"issue":"2","key":"4470_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1142\/S0129054120500045","volume":"31","author":"HM Bahig","year":"2020","unstructured":"Bahig HM, Nassr DI, Bhery A, Nitaj A (2020) A unified method for private exponent attacks on rsa using lattices. Int J Found Comput Sci 31(2):207\u2013231","journal-title":"Int J Found Comput Sci"},{"issue":"12","key":"4470_CR5","first-page":"340","volume":"11","author":"HM Bahig","year":"2020","unstructured":"Bahig HM, Mohammed A, Khaled A, AlGhadhban A, Bahig HM (2020) Performance analysis of fermat factorization algorithms. Int J Adv Comput Sci Appl 11(12):340\u2013350","journal-title":"Int J Adv Comput Sci Appl"},{"key":"4470_CR6","doi-asserted-by":"crossref","unstructured":"Bahig HM, Bahig HM, Kotb Y (2020) Fermat factorization using a multi-core system. Int J Adv Comput Sci Appl 11(4)","DOI":"10.14569\/IJACSA.2020.0110444"},{"key":"4470_CR7","doi-asserted-by":"crossref","unstructured":"Brent RP (1999) Some parallel algorithms for integer factorisation. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1685 LNCS, pages 1\u201322","DOI":"10.1007\/3-540-48311-X_1"},{"key":"4470_CR8","doi-asserted-by":"crossref","unstructured":"Durmu\u015f O, \u00c7abuk UC, Dalkili\u00e7 F(2020) A study on the performance of base-m polynomial selection algorithm using gpu","DOI":"10.1007\/978-3-030-36178-5_40"},{"key":"4470_CR9","doi-asserted-by":"crossref","unstructured":"Fathy K, Bahig H, Farag M (2018) Speeding up multi- exponentiation algorithm on a multicore system. J Egypt Math Soc 26","DOI":"10.21608\/joems.2018.2540.1008"},{"key":"4470_CR10","doi-asserted-by":"crossref","unstructured":"Fathy KA, Bahig HM, Ragab AA (2018) A fast parallel modular exponentiation algorithm. Arab J Sci Eng 43","DOI":"10.1007\/s13369-017-2797-3"},{"key":"4470_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10623-014-9972-2","volume":"76","author":"A Fujioka","year":"2015","unstructured":"Fujioka A, Suzuki K, Xagawa K, Yoneyama K (2015) Strongly secure authenticated key exchange from factoring, codes, and lattices. Design Codes Cryptogr 76:469\u2013504","journal-title":"Design Codes Cryptogr"},{"key":"4470_CR12","unstructured":"GMP. library, gnu multiple precision arithmetic library. https:\/\/gmplib.org\/"},{"key":"4470_CR13","first-page":"53","volume":"5","author":"KR Gulida","year":"2017","unstructured":"Gulida KR, Ultanov IR (2017) Comparative analysis of integer factorization algorithms using cpu and gpu. MANAS J Eng 5:53\u201363","journal-title":"MANAS J Eng"},{"key":"4470_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12095-018-0304-7","volume":"11","author":"S Varadharajan","year":"2019","unstructured":"Varadharajan S, Raddum H (2019) Factorization using binary decision diagrams. Cryptogr Commun 11:443\u2013460","journal-title":"Cryptogr Commun"},{"key":"4470_CR15","unstructured":"Koundinya AK, Harish G, Srinath\u00a0NK, Raghavendra\u00a0GE, Pramod\u00a0YV, Sandeep R, Punith\u00a0KG (2013) Performance analysis of parallel pollard\u2019s rho factoring algorithm. Int J Comput Sci Inform Technol 5"},{"key":"4470_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1008397921377","volume":"19","author":"AK Lenstra","year":"2000","unstructured":"Lenstra AK (2000) Integer factoring. Designs Codes Cryptogr 19:101\u2013128","journal-title":"Designs Codes Cryptogr"},{"key":"4470_CR17","unstructured":"Menezes AJ, Katz J, van Oorschot PC, Vanstone SA (1996) Handbook of Applied Cryptography. CRC Press"},{"key":"4470_CR18","first-page":"337","volume":"7","author":"PL Montgomery","year":"1994","unstructured":"Montgomery PL (1994) A survey of modern integer factorization algorithms. CWI Quart 7:337\u2013366","journal-title":"CWI Quart"},{"key":"4470_CR19","doi-asserted-by":"crossref","unstructured":"Nassr DI, Bahig HM, Bhery A, Daoud SS (2008) A new rsa vulnerability using continued fractions. In AICCSA 08 - 6th IEEE\/ACS International Conference on Computer Systems and Applications, pages 694\u2013701","DOI":"10.1109\/AICCSA.2008.4493604"},{"key":"4470_CR20","doi-asserted-by":"crossref","unstructured":"Nimbalkar AB (2018) The digital signature schemes based on two hard problems: factorization and discrete logarithm. In: In: Bokhari M, Agrawal N, Saini D (eds) Cyber Security, volume 729 of Advances in Intelligent Systems and Computing, pages 493\u2013498","DOI":"10.1007\/978-981-10-8536-9_47"},{"key":"4470_CR21","unstructured":"OpenMP. https:\/\/www.openmp.org\/"},{"key":"4470_CR22","doi-asserted-by":"publisher","first-page":"60311","DOI":"10.1007\/s11433-018-9307-1","volume":"62","author":"WC Peng","year":"2019","unstructured":"Peng WC, Wang BN, Hu F, Wang YJ, Fang XJ, Chen XY, Wang C (2019) Factoring larger integers with fewer qubits via quantum annealing with optimized parameters. Sci China Phys Mech Astron 62:60311","journal-title":"Sci China Phys Mech Astron"},{"key":"4470_CR23","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1080\/09720529.2009.10698270","volume":"12","author":"D Poulakis","year":"2009","unstructured":"Poulakis D (2009) A public key encryption scheme based on factoring and discrete logarithm. J Discrete Math Sci Cryptogr 12:745\u2013752","journal-title":"J Discrete Math Sci Cryptogr"},{"key":"4470_CR24","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF00264164","volume":"17","author":"P Pritchard","year":"1982","unstructured":"Pritchard P (1982) Explaining the wheel sieve. Acta Inform 17:477\u2013485","journal-title":"Acta Inform"},{"key":"4470_CR25","doi-asserted-by":"crossref","unstructured":"Rivest RL, Shamir A, Adleman LM (1978) A method for obtaining digital signatures and public key cryptosystems. Commun ACM, pp 120\u2013126","DOI":"10.1145\/359340.359342"},{"key":"4470_CR26","doi-asserted-by":"crossref","unstructured":"Rubinstein-Salzedo S (2018) Clever factorization algorithms and primality testing","DOI":"10.1007\/978-3-319-94818-8_13"},{"key":"4470_CR27","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26:1484\u20131509","journal-title":"SIAM J Comput"},{"key":"4470_CR28","doi-asserted-by":"crossref","unstructured":"Valenta L, Cohney S, Liao A, Fried J, Bodduluri S, Heninger N (2017) Factoring as a service. In: In: Grossklags J, Preneel B (eds) Financial cryptography and data security. FC 2016., volume LNCS 9603 of Lecture Notes in Computer Science, pp 321\u2013338","DOI":"10.1007\/978-3-662-54970-4_19"},{"key":"4470_CR29","doi-asserted-by":"publisher","first-page":"167250","DOI":"10.1109\/ACCESS.2019.2953755","volume":"7","author":"W Liangshun","year":"2019","unstructured":"Liangshun W, Cai HJ, Gong Z (2019) The integer factorization algorithm with pisano period. IEEE Access 7:167250\u2013167259","journal-title":"IEEE Access"},{"key":"4470_CR30","doi-asserted-by":"crossref","unstructured":"Yan SY (2009) Primality testing and integer factorization in public-key cryptography, volume\u00a011 of advances in information security. Springer","DOI":"10.1007\/978-0-387-77268-4"},{"key":"4470_CR31","doi-asserted-by":"crossref","unstructured":"Yan SY (2019) Factoring Based Cryptography, pages 217\u2013286","DOI":"10.1007\/978-3-319-72536-9_5"},{"key":"4470_CR32","doi-asserted-by":"crossref","unstructured":"Yan SY, James G (2006) Can integer factorization be in p? In: 2006 International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA\u201906), pp 266\u2013266","DOI":"10.1109\/CIMCA.2006.62"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04470-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04470-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04470-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T16:35:40Z","timestamp":1662654940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04470-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,23]]},"references-count":32,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["4470"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04470-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,4,23]]},"assertion":[{"value":"18 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}