{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:32:13Z","timestamp":1740133933669,"version":"3.37.3"},"reference-count":27,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p> Although for more than 20 years, Whiteman\u2019s generalized cyclotomic sequences have been thought of as the most important pseudo-random sequences, but, there are only a few papers in which their 2-adic complexities have been discussed. In this paper, we construct a class of binary sequences of order four with odd length (product of two distinct odd primes) from Whiteman\u2019s generalized cyclotomic classes. After that, we determine both 2-adic complexity and linear complexity of these sequences. Our results show that these complexities are greater than half of the period of the sequences, therefore, it may be good pseudo-random sequences. <\/jats:p>","DOI":"10.1142\/s0129054119500205","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T04:24:14Z","timestamp":1565670254000},"page":"759-779","source":"Crossref","is-referenced-by-count":2,"title":["2-Adic and Linear Complexities of a Class of Whiteman\u2019s Generalized Cyclotomic Sequences of Order Four"],"prefix":"10.1142","volume":"30","author":[{"given":"Priti","family":"Kumari","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Indian Institute of Technology, (Indian School of Mines), Dhanbad 826 004, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2483-0960","authenticated-orcid":false,"given":"Pramod Kumar","family":"Kewat","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Indian Institute of Technology, (Indian School of Mines), Dhanbad 826 004, India"}]}],"member":"219","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"S0129054119500205BIB001","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/E88-A.1.392"},{"key":"S0129054119500205BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2255114"},{"volume-title":"Stream Ciphers and Number Theory","year":"2003","author":"Cusik T.","key":"S0129054119500205BIB003"},{"key":"S0129054119500205BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2189549"},{"key":"S0129054119500205BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2176915"},{"key":"S0129054119500205BIB006","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.1998.0207"},{"key":"S0129054119500205BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/18.748996"},{"key":"S0129054119500205BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/18.796414"},{"key":"S0129054119500205BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-015-0130-0"},{"key":"S0129054119500205BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290694"},{"key":"S0129054119500205BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2336843"},{"key":"S0129054119500205BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9648-8"},{"key":"S0129054119500205BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196254"},{"key":"S0129054119500205BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-016-0191-8"},{"key":"S0129054119500205BIB015","first-page":"174","volume-title":"Fast Software Encryption, Cambridge Security Workshop, Cambridge, UK, December 9\u201311, 1993, Proceedings","author":"Klapper A.","year":"1993"},{"key":"S0129054119500205BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_21"},{"key":"S0129054119500205BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900024"},{"key":"S0129054119500205BIB019","volume-title":"Finite Fields","volume":"20","author":"Lidl R.","year":"1997"},{"key":"S0129054119500205BIB020","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"S0129054119500205BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034904"},{"key":"S0129054119500205BIB024","doi-asserted-by":"publisher","DOI":"10.1215\/ijm\/1255631810"},{"key":"S0129054119500205BIB025","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054116500350"},{"key":"S0129054119500205BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2304451"},{"key":"S0129054119500205BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2014.09.009"},{"key":"S0129054119500205BIB028","doi-asserted-by":"publisher","DOI":"10.1142\/S012905411650009X"},{"key":"S0129054119500205BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.11.006"},{"key":"S0129054119500205BIB030","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237754"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054119500205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T04:24:16Z","timestamp":1565670256000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054119500205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":27,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2019,8,13]]},"published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.1142\/S0129054119500205"],"URL":"https:\/\/doi.org\/10.1142\/s0129054119500205","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}