{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:47:15Z","timestamp":1771339635167,"version":"3.50.1"},"reference-count":28,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862042"],"award-info":[{"award-number":["61862042"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,10,6]]},"abstract":"<jats:p>A new and improved method based on the number of iterations is proposed to reduce the dynamical degradation of the digital chaotic map in this study. We construct a control function by introducing iteration time instead of external systems, thereby replacing the control parameters in the original chaotic map. Experimental results show that the chaotic map based on the iteration-time combination method is more complicated and effective. The period is extended without completely destroying the phase space, which indicates that our method is effective and can compete with other proposed techniques. A type of pseudorandom bit generator based on the iteration-time combination method is proposed to demonstrate its simple application.<\/jats:p>","DOI":"10.1155\/2020\/5707983","type":"journal-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T22:35:18Z","timestamp":1602023718000},"page":"1-11","source":"Crossref","is-referenced-by-count":4,"title":["An Iteration-Time Combination Method to Reduce the Dynamic Degradation of Digital Chaotic Maps"],"prefix":"10.1155","volume":"2020","author":[{"given":"Yao","family":"Wu","sequence":"first","affiliation":[{"name":"School of Software, Nanchang University, Nanchang, Jiangxi 330031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0298-0191","authenticated-orcid":true,"given":"Lingfeng","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Software, Nanchang University, Nanchang, Jiangxi 330031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"crossref","first-page":"3119","DOI":"10.1142\/S0218127405014052","article-title":"On the dynamical degradation of digital piecewise linear chaotic maps","volume":"15","author":"S. Li","year":"2004","journal-title":"International Journal of Bifurcation and Chaos"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.02.031"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1080\/0161-119191865821"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1142\/s0218127418500591"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/tvlsi.2010.2103332"},{"key":"6","first-page":"339","article-title":"A new pseudorandom bit generator using compounded chaotic tent maps","author":"A. C. Dascalescu"},{"issue":"9","key":"7","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1109\/TCYB.2014.2363168","article-title":"Cascade chaotic systems with applications","volume":"45","author":"Y. Zhou","year":"2015","journal-title":"IEEE Trans Cybernet"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2008.07.031"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1140\/epjst\/e2008-00850-4"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2011.12.006"},{"key":"11","doi-asserted-by":"crossref","first-page":"5219","DOI":"10.1088\/1674-1056\/18\/12\/019","article-title":"Digital chaotic sequence generator based on coupled chaotic systems","volume":"18","author":"S. B. Liu","year":"2009","journal-title":"Chinese Physics B"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/s0375-9601(01)00612-0"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1049\/el:19981377"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.01.028"},{"issue":"4","key":"15","first-page":"703","article-title":"An analog-digital mixed method for solving the dynamical degradation of digital chaotic systems","volume":"32","author":"L. F. Liu","year":"2015","journal-title":"IMA Journal of Mathematical Control and Information"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1142\/s0218127405014052"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.88.6.2297"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2013.08.032"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2010.04.021"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2013.06.017"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/amm.311.99"},{"key":"22","article-title":"Statistical test suite for random and pseudo random number generators for cryptographic applications","author":"A. Runkin","year":"2001"},{"key":"23","article-title":"Corrections of the NIST statistical test suite for randomness","author":"S.-J. Kim","year":"2004"},{"key":"24","volume-title":"The Art of Computer Programming: Semiemperical Algorithms","author":"D. Knuth","year":"1998"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/0167-4048(94)90051-5"},{"key":"26","doi-asserted-by":"crossref","DOI":"10.1063\/1.168514","volume-title":"Some Portable Very\u2010long\u2010period Random Number Generators","author":"G. Marsaglia","year":"1994"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-015-2488-0"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/s0898-1221(97)00008-4"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/5707983.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/5707983.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/5707983.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T22:35:22Z","timestamp":1602023722000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/5707983\/"}},"subtitle":[],"editor":[{"given":"Peter","family":"Giesl","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":28,"alternative-id":["5707983","5707983"],"URL":"https:\/\/doi.org\/10.1155\/2020\/5707983","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"value":"1099-0526","type":"electronic"},{"value":"1076-2787","type":"print"}],"subject":[],"published":{"date-parts":[[2020,10,6]]}}}