A novel data encryption method using an interlaced chaotic transform

dc.authoridTora, Hakan/0000-0002-0427-483X
dc.authoridGokcay, Erhan/0000-0002-4220-199X
dc.authorscopusid7004217859
dc.authorscopusid6506642154
dc.authorwosidGokcay, Erhan/JOK-0734-2023
dc.contributor.authorGökçay, Erhan
dc.contributor.authorTora, Hakan
dc.contributor.authorTora, Hakan
dc.contributor.otherSoftware Engineering
dc.contributor.otherAirframe and Powerplant Maintenance
dc.date.accessioned2024-07-05T15:21:43Z
dc.date.available2024-07-05T15:21:43Z
dc.date.issued2024
dc.departmentAtılım Universityen_US
dc.department-temp[Gokcay, Erhan] Atilim Univ, Dept Software Engn, TR-06830 Ankara, Turkiye; [Tora, Hakan] Atilim Univ, Dept Avion, TR-06830 Ankara, Turkiyeen_US
dc.descriptionTora, Hakan/0000-0002-0427-483X; Gokcay, Erhan/0000-0002-4220-199Xen_US
dc.description.abstractWe present a novel data encryption approach that utilizes a cascaded chaotic map application. The chaotic map used in both permutation and diffusion is Arnold's Cat Map (ACM), where the transformation is periodic and the encrypted data can be recovered. The original format of ACM is a two-dimensional mapping, and therefore it is suitable to randomize the pixel locations in an image. Since the values of pixels stay intact during the transformation, the process cannot encrypt an image, and known-text attacks can be used to get back the transformation matrix. The proposed approach uses ACM to shuffle the positions and values of two-dimensional data in an interlaced and nested process. This combination extends the period of the transformation, which is significantly longer than the period of the initial transformation. Furthermore, the nested process's possible combinations vastly expand the key space. At the same time, the interlaced pixel and value transformation makes the encryption highly resistant to any known-text attacks. The encrypted data passes all random-data tests proposed by the National Institute of Standards and Technology. Any type of data, including ASCII text, can be encrypted so long as it can be rearranged into a two-dimensional format.en_US
dc.identifier.citation3
dc.identifier.doi10.1016/j.eswa.2023.121494
dc.identifier.issn0957-4174
dc.identifier.issn1873-6793
dc.identifier.scopus2-s2.0-85171752157
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2023.121494
dc.identifier.urihttps://hdl.handle.net/20.500.14411/2123
dc.identifier.volume237en_US
dc.identifier.wosWOS:001080403000001
dc.identifier.wosqualityQ1
dc.language.isoenen_US
dc.publisherPergamon-elsevier Science Ltden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectArnold 's cat mapen_US
dc.subjectEncryptionen_US
dc.subjectRandom-dataen_US
dc.subjectKnown-text attacken_US
dc.subjectInterlaced chaotic transformen_US
dc.titleA novel data encryption method using an interlaced chaotic transformen_US
dc.typeArticleen_US
dspace.entity.typePublication
relation.isAuthorOfPublication07b095f1-e384-448e-8662-cd924cb2139d
relation.isAuthorOfPublication3b369df4-6f40-4e7f-9021-94de8b562a0d
relation.isAuthorOfPublication.latestForDiscovery07b095f1-e384-448e-8662-cd924cb2139d
relation.isOrgUnitOfPublicationd86bbe4b-0f69-4303-a6de-c7ec0c515da5
relation.isOrgUnitOfPublication0ad0b148-c2aa-44e7-8f0a-53ab5c8406d5
relation.isOrgUnitOfPublication.latestForDiscoveryd86bbe4b-0f69-4303-a6de-c7ec0c515da5

Files

Collections