{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:18Z","timestamp":1740169158903,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","award":["W911NF1910482"],"award-info":[{"award-number":["W911NF1910482"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008480","name":"Arkansas Research Alliance","doi-asserted-by":"publisher","award":["DN145250"],"award-info":[{"award-number":["DN145250"]}],"id":[{"id":"10.13039\/100008480","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2967396","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:06:26Z","timestamp":1579295186000},"page":"26433-26444","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Novel Generalized Chinese Remainder Algorithm for Extended Rabin Cryptosystem"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8991-5669","authenticated-orcid":false,"given":"Justin","family":"Zhan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1832-9002","authenticated-orcid":false,"given":"Peter J.","family":"Shiue","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3190-3758","authenticated-orcid":false,"given":"Shen C.","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Benjamin J.","family":"Lowe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"51","article-title":"Five number-theoretic algorithms","author":"shanks","year":"1973","journal-title":"Proc 2nd Manitoba Conf Numer Math"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1090\/crmp\/019\/21"},{"key":"ref12","first-page":"154","article-title":"Un metodo per la risolutione della congruenza di secondo grado","volume":"9","author":"cipolla","year":"1903","journal-title":"Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche"},{"year":"1996","author":"katz","journal-title":"Handbook of Applied Cryptography","key":"ref13"},{"year":"2000","author":"lopez","article-title":"An overview of elliptic curve cryptography","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/s10623-005-4017-5"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/BFb0052249"},{"key":"ref17","first-page":"1","article-title":"Design of rabin-like cryptosystem without decryption failure","volume":"10","author":"asbullah","year":"2016","journal-title":"Malays J Math Sci"},{"key":"ref18","first-page":"9","article-title":"Efficient methods to overcome rabin cryptosystem decryption failure","volume":"11","author":"mahad","year":"2017","journal-title":"Malays J Math Sci"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1088\/2040-8978\/18\/8\/083001"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TVT.2011.2167690"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TVT.2016.2550083"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TSP.2010.2066974"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/LSP.2014.2322200"},{"year":"1979","author":"rabin","article-title":"Digitalized signatures and public-key functions as intractable as factorization","key":"ref8"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1201\/9781420011241"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/ICC.2007.590"},{"key":"ref9","first-page":"344","article-title":"Bemerkung über die auflösung quadratischer congruenzen","author":"tonelli","year":"1891","journal-title":"Nachrichten von der Königlichen Gesellschaft der Wissenschaften und der Georg-Augusts-Universität zu Göttingen"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1142\/3254"},{"key":"ref20","article-title":"Optical image encryption using triplet of functions","volume":"57","author":"yatish","year":"2018","journal-title":"Opt Eng"},{"year":"1998","author":"kumanduri","journal-title":"Number Theory with Computer Applications","key":"ref22"},{"key":"ref21","volume":"1","author":"bach","year":"1996","journal-title":"Algorithmic Number Theory Efficient Algorithms"},{"year":"2011","author":"rosen","journal-title":"Elementary Number Theory","key":"ref24"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/978-94-011-3586-3_27"},{"year":"2010","author":"frank","journal-title":"UCI Machine Learning Repository","key":"ref26"},{"year":"2015","author":"granlund","journal-title":"GNU MP 6 0 Multiple Precision Arithmetic Library","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08962029.pdf?arnumber=8962029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:51:00Z","timestamp":1639770660000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8962029\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2967396","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}