{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:56:20Z","timestamp":1781106980816,"version":"3.54.1"},"reference-count":23,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>This paper proposes a novel image block encryption algorithm based on three-dimensional Chen chaotic dynamical system. The algorithm works on 32-bit image blocks with a 192-bit secret key. The idea is that the key is employed to drive the Chen\u2019s system to generate a chaotic sequence that is inputted to a specially designed function G, in which we use new 8x8 S-boxes generated by chaotic maps (Tang, 2005). In order to improve the robustness against differental cryptanalysis and produce desirable avalanche effect, the function G is iteratively performed several times and its last outputs serve as the keystreams to encrypt the original image block. The design of the encryption algorithm is described along with security analyses. The results from key space analysis, differential attack analysis, and information entropy analysis, correlation analysis of two adjacent pixels prove that the proposed algorithm can resist cryptanalytic, statistical and brute force attacks, and achieve a higher level of security. The algorithm can be employed to realize the security cryptosystems over the Internet.<\/p>","DOI":"10.4018\/jcini.2011010104","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:07:54Z","timestamp":1319026074000},"page":"59-74","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Algorithm for Block Encryption of Digital Image Based on Chaos"],"prefix":"10.4018","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6800-0064","authenticated-orcid":true,"given":"Jun","family":"Peng","sequence":"first","affiliation":[{"name":"Chongqing University of Science and Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Du","family":"Zhang","sequence":"additional","affiliation":[{"name":"California State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaofeng","family":"Liao","sequence":"additional","affiliation":[{"name":"Chongqing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jcini.2011010104-0","doi-asserted-by":"crossref","unstructured":"Adams, C., & Tavares, S. (1989). Good S-boxes are easy to find. In G. Brassard (Ed.), Proceedings of Advances in Cryptology (LNCS 435, pp. 612-615).","DOI":"10.1007\/0-387-34805-0_56"},{"key":"jcini.2011010104-1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127406015970"},{"key":"jcini.2011010104-2","doi-asserted-by":"crossref","DOI":"10.1142\/3033","author":"G. R.Chen","year":"1998","journal-title":"From chaos to order methodologies, perspectives, and applications"},{"key":"jcini.2011010104-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2003.12.022"},{"key":"jcini.2011010104-4","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127499001024"},{"key":"jcini.2011010104-5","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0573-15"},{"key":"jcini.2011010104-6","doi-asserted-by":"publisher","DOI":"10.1142\/S021812749800098X"},{"key":"jcini.2011010104-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2005.08.006"},{"key":"jcini.2011010104-8","author":"B. L.Hao","year":"1993","journal-title":"Starting with parabolas: an introduction to chaotic dynamics"},{"key":"jcini.2011010104-9","doi-asserted-by":"publisher","DOI":"10.1109\/7384.963463"},{"key":"jcini.2011010104-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2004.09.077"},{"key":"jcini.2011010104-11","unstructured":"Li, S. J., & Zheng, X. (2002). Cryptanalysis of a chaotic image encryption method. In Proceeding of IEEE International Symposium on Circuits and Systems, Phoenix, AZ (Vol. 2, pp. 708-711). Washington, DC: IEEE Computer Society."},{"key":"jcini.2011010104-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2008.11.005"},{"key":"jcini.2011010104-13","doi-asserted-by":"crossref","DOI":"10.1201\/9781420011241","author":"R. A.Mollin","year":"2006","journal-title":"An introduction to cryptography"},{"key":"jcini.2011010104-14","unstructured":"Peng, J., Zhang, D., Liu, Y. G., & Liao, X. F. (2008). A double-piped iterated hash function based on a hybrid of chaotic maps. In Proceedings of the 7th IEEE International Conference on Cognitive Informatics (pp. 358-365). Washington, DC: IEEE Computer Society Press."},{"key":"jcini.2011010104-15","author":"B.Schneier","year":"1996","journal-title":"Applied cryptography"},{"issue":"4","key":"jcini.2011010104-16","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy system.","volume":"28","author":"C. E.Shannon","year":"1949","journal-title":"The Bell System Technical Journal"},{"key":"jcini.2011010104-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2004.04.023"},{"key":"jcini.2011010104-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2008.09.011"},{"key":"jcini.2011010104-19","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127400001183"},{"issue":"1","key":"jcini.2011010104-20","first-page":"81","article-title":"A survey of chaotic secure communication systems.","volume":"2","author":"T.Yang","year":"2004","journal-title":"International Journal of Computational Cognition"},{"key":"jcini.2011010104-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0960-0779(01)00251-X"},{"key":"jcini.2011010104-22","unstructured":"Yen, J. C., & Guo, J. I. (2000). A new chaotic key-based design for image encryption and decryption. In Proceedings of IEEE International Symposium on Circuits and Systems, Geneva, Switzerland (Vol. 4, pp. 49-52). Washington, DC: IEEE Computer Society."}],"container-title":["International Journal of Cognitive Informatics and Natural Intelligence"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=53147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T11:20:16Z","timestamp":1654082416000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jcini.2011010104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jcini.2011010104","relation":{},"ISSN":["1557-3958","1557-3966"],"issn-type":[{"value":"1557-3958","type":"print"},{"value":"1557-3966","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}