A New Data Coding Algorithm for Secure Communication of Image

This paper proposes a new entropy-sensitive based data coding algorithm for the secure communication of image information between transceiver systems. The proposed algorithm utilizes chaos theory and the image information content of the reference image to create sensitivity on the decoding side for...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Chaos theory and applications Ročník 6; číslo 4; s. 284 - 293
Hlavný autor: Oğraş, Hidayet
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Akif AKGUL 30.11.2024
Predmet:
chaos
data coding
image entropy
logistic map
ISSN:2687-4539, 2687-4539
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract This paper proposes a new entropy-sensitive based data coding algorithm for the secure communication of image information between transceiver systems. The proposed algorithm utilizes chaos theory and the image information content of the reference image to create sensitivity on the decoding side for a high level of secrecy. It successfully recovers secret images at the receiver’s side using secret code series derived from both the secret and reference images, instead of direct transmission of secret image. The image information can be retrieved only through the same reference image, the same system parameters and identical code series using the proper decoding technique at the receiver. Quantitative results indicate that the average coding time for 128x128 images is approximately 0.27 seconds, while the extraction time averages 0.19 seconds, yielding impressive rates of 0.487 Mbps and 0.677 Mbps, respectively. Moreover, according to qualitative results, even a single-bit change in the reference image leads to a complete inability to decode the secret image, highlighting the robustness and security of the algorithm. Experimental results on various images show that the proposed algorithm is reliable, fast and effective in securing confidential image information.
AbstractList This paper proposes a new entropy-sensitive based data coding algorithm for the secure communication of image information between transceiver systems. The proposed algorithm utilizes chaos theory and the image information content of the reference image to create sensitivity on the decoding side for a high level of secrecy. It successfully recovers secret images at the receiver’s side using secret code series derived from both the secret and reference images, instead of direct transmission of secret image. The image information can be retrieved only through the same reference image, the same system parameters and identical code series using the proper decoding technique at the receiver. Quantitative results indicate that the average coding time for 128x128 images is approximately 0.27 seconds, while the extraction time averages 0.19 seconds, yielding impressive rates of 0.487 Mbps and 0.677 Mbps, respectively. Moreover, according to qualitative results, even a single-bit change in the reference image leads to a complete inability to decode the secret image, highlighting the robustness and security of the algorithm. Experimental results on various images show that the proposed algorithm is reliable, fast and effective in securing confidential image information.
Author Oğraş, Hidayet
Author_xml – sequence: 1
  givenname: Hidayet
  orcidid: 0000-0001-9624-7400
  surname: Oğraş
  fullname: Oğraş, Hidayet
BookMark eNpNkEtLw0AUhQepYK3dup4_kDrvmSxclPoKFF2o6-FmHmlKk5FJivjvLW0RV_dwD3xwvms06VMfELqlZCGp5PrObSANCyqpVsZcoClTRhdC8nLyL1-h-TBsCSGsLKlieorul_g1fOMHGAGvkm_7Bi93TcrtuOlwTBm_B7fP4dB13b5vHYxt6nGKuOqgCTfoMsJuCPPznaHPp8eP1UuxfnuuVst14ZgUppDSeOC0pDIaVmtWE-8DIS4YE3lUHGQtqJbBs0gNOMqBHHYw4inTUUDNZ6g6cX2Crf3KbQf5xyZo7fGRcmMhj63bBWsEZRCYVIoJwT2UZVBSO8OpMgFEOLAWJ5bLaRhyiH88SuzRpT26tGeX_BfH22dC
Cites_doi 10.5755/j01.eie.26.1.25310
10.3390/math11112585
10.1016/j.image.2021.116418
10.7227/IJEEE.50.1.2
10.1155/2021/6679284
10.1002/sec.1676
10.3390/asi7060107
10.1007/s11042-019-7471-1
10.1109/ICACEA.2015.7164679
10.1016/j.jksuci.2023.101595
10.1109/AICCSA.2013.6616431
10.1016/j.fraope.2024.100158
10.1007/s11042-021-10839-7
10.3934/math.20241323
10.1155/2018/4847098
10.1016/j.procs.2017.12.109
10.1016/j.matpr.2021.04.583
10.1016/j.isci.2024.110717
10.1016/j.ijleo.2020.165492
10.1080/1206212X.2019.1692511
10.1155/2018/1505896
10.1016/j.aeue.2020.153367
10.1016/j.jisa.2023.103607
10.1088/1742-6596/1341/6/062023
10.1007/s11042-016-4169-5
10.1007/s11042-024-18628-8
10.1155/2018/1808953
10.5815/ijcnis.2019.02.03
10.1155/2018/1804953
10.1155/2020/6612390
10.1109/TCSI.2022.3175713
10.1016/j.image.2019.115632
10.1016/j.chaos.2021.111315
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.51537/chaos.1517688
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2687-4539
EndPage 293
ExternalDocumentID oai_doaj_org_article_8412ae25662443da99e657c83168ea4e
10_51537_chaos_1517688
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
IAO
ITC
ID FETCH-LOGICAL-c2548-558da31915f82b72b0dde00ce88f3f63a5b4175ed2f18ac13a051720d127f4ab3
IEDL.DBID DOA
ISSN 2687-4539
IngestDate Fri Oct 03 12:53:22 EDT 2025
Sat Nov 29 03:40:14 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2548-558da31915f82b72b0dde00ce88f3f63a5b4175ed2f18ac13a051720d127f4ab3
ORCID 0000-0001-9624-7400
OpenAccessLink https://doaj.org/article/8412ae25662443da99e657c83168ea4e
PageCount 10
ParticipantIDs doaj_primary_oai_doaj_org_article_8412ae25662443da99e657c83168ea4e
crossref_primary_10_51537_chaos_1517688
PublicationCentury 2000
PublicationDate 2024-11-30
PublicationDateYYYYMMDD 2024-11-30
PublicationDate_xml – month: 11
  year: 2024
  text: 2024-11-30
  day: 30
PublicationDecade 2020
PublicationTitle Chaos theory and applications
PublicationYear 2024
Publisher Akif AKGUL
Publisher_xml – name: Akif AKGUL
References ref13
ref35
ref12
ref34
ref15
ref14
ref36
ref31
ref30
ref11
ref33
ref10
ref32
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref27
  doi: 10.5755/j01.eie.26.1.25310
– ident: ref36
  doi: 10.3390/math11112585
– ident: ref2
  doi: 10.1016/j.image.2021.116418
– ident: ref26
  doi: 10.7227/IJEEE.50.1.2
– ident: ref18
  doi: 10.1155/2021/6679284
– ident: ref13
  doi: 10.1002/sec.1676
– ident: ref7
  doi: 10.3390/asi7060107
– ident: ref11
  doi: 10.1007/s11042-019-7471-1
– ident: ref24
  doi: 10.1109/ICACEA.2015.7164679
– ident: ref3
  doi: 10.1016/j.jksuci.2023.101595
– ident: ref9
– ident: ref6
  doi: 10.1109/AICCSA.2013.6616431
– ident: ref12
  doi: 10.1016/j.fraope.2024.100158
– ident: ref30
  doi: 10.1007/s11042-021-10839-7
– ident: ref15
– ident: ref20
  doi: 10.3934/math.20241323
– ident: ref33
  doi: 10.1155/2018/4847098
– ident: ref5
  doi: 10.1016/j.procs.2017.12.109
– ident: ref32
  doi: 10.1016/j.matpr.2021.04.583
– ident: ref19
  doi: 10.1016/j.isci.2024.110717
– ident: ref31
  doi: 10.1016/j.ijleo.2020.165492
– ident: ref21
  doi: 10.1080/1206212X.2019.1692511
– ident: ref34
  doi: 10.1155/2018/1505896
– ident: ref17
  doi: 10.1016/j.aeue.2020.153367
– ident: ref29
  doi: 10.1016/j.jisa.2023.103607
– ident: ref16
  doi: 10.1088/1742-6596/1341/6/062023
– ident: ref4
  doi: 10.1007/s11042-016-4169-5
– ident: ref1
  doi: 10.1007/s11042-024-18628-8
– ident: ref8
  doi: 10.1155/2018/1808953
– ident: ref25
  doi: 10.5815/ijcnis.2019.02.03
– ident: ref28
  doi: 10.1155/2018/1804953
– ident: ref35
– ident: ref10
  doi: 10.1155/2020/6612390
– ident: ref22
  doi: 10.1109/TCSI.2022.3175713
– ident: ref14
  doi: 10.1016/j.image.2019.115632
– ident: ref23
  doi: 10.1016/j.chaos.2021.111315
SSID ssj0002991627
Score 2.275723
Snippet This paper proposes a new entropy-sensitive based data coding algorithm for the secure communication of image information between transceiver systems. The...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 284
SubjectTerms chaos
data coding
image entropy
logistic map
Title A New Data Coding Algorithm for Secure Communication of Image
URI https://doaj.org/article/8412ae25662443da99e657c83168ea4e
Volume 6
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2687-4539
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002991627
  issn: 2687-4539
  databaseCode: DOA
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwFLRQxcCCQIAoX_KAxBSaOI4_BoZSqEBCFQOgbtGzY1Mk2qC28Pt5jgOUiYU1iiznnnx3L0ruEXJqROUtcEhEOIXcM5-AsjzJrBXSCF2YJkzn6U6ORmo81vcro77CN2ExHjgC11M8Y-BQmAUKUV6B1k4U0qowcMkBd4F9U6lXmqnAwSzYHiZjSiNKdi57dgL14hwFTsYxKz8qtBLW36jKcItstnaQ9uM2tsmam-2Qiz5F7qFXsAQ6qIO40P7rc41t_GRK0WTS5iW5o79-7qC1p7dTZIdd8ji8fhjcJO2Yg8Rid6aSolAV4EnICq-YkcykSDlpap1SPvcih8JwFHlXMZ8psFkOIVeLpVXGpOdg8j3SmdUzt0-o1uCdMJpz49FpCKiUyYWxuJj3oKFLzr4eu3yLaRYldgENQGUDUNkC1CWXAZXvu0IKdXMBa1O2tSn_qs3BfyxySDYYGokYt3hEOsv5uzsm6_Zj-bKYnzRl_wTn7bD0
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+New+Data+Coding+Algorithm+for+Secure+Communication+of+Image&rft.jtitle=Chaos+theory+and+applications&rft.au=O%C4%9Fra%C5%9F%2C+Hidayet&rft.date=2024-11-30&rft.issn=2687-4539&rft.eissn=2687-4539&rft.volume=6&rft.issue=4&rft.spage=284&rft.epage=293&rft_id=info:doi/10.51537%2Fchaos.1517688&rft.externalDBID=n%2Fa&rft.externalDocID=10_51537_chaos_1517688
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2687-4539&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2687-4539&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2687-4539&client=summon