Home › Entities › academia › An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps

An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps

Research article (IEEE Access, 2020) · cited 12× · AI/ML
CreativeWork academia

Facts

4 properties
Instance of
scholarly article[2]
Publication date
2020as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
IEEE Accessas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Mapsas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W3040524301as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.1109/ACCESS.2020.3006513as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded

Report an error or request removal Lineage (PROV-JSON)

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
🔗 Connections
Authored by 4
Chunpeng Wang, Hongwei Xie, Xiaoqing Wang, Xingyuan Wang
← Author of 4
Chunpeng Wang, Hongwei Xie, Xiaoqing Wang, Xingyuan Wang
Press Enter · cited answer in seconds

Summary

An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps is a scholarly article[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps. Retrieved October 19, 2026, from https://4ort.xyz/entity/an-efficient-and-secure-image-encryption-algorithm-based-on-non-adjacent-coupled-maps
MLA “An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps.” 4ort.xyz Knowledge Graph, 4ort.xyz, 19 Oct. 2026, https://4ort.xyz/entity/an-efficient-and-secure-image-encryption-algorithm-based-on-non-adjacent-coupled-maps.
BibTeX @misc{4ortxyz_an-efficient-and-secure-image-encryption-algorithm-based-on-non-adjacent-coupled-maps_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps}}, year = {2026}, url = {https://4ort.xyz/entity/an-efficient-and-secure-image-encryption-algorithm-based-on-non-adjacent-coupled-maps}, note = {Accessed: 2026-10-19}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An Efficient and Secure Image Encryption Algorithm Based on Non- Adjacent Coupled Maps — https://4ort.xyz/entity/an-efficient-and-secure-image-encryption-algorithm-based-on-non-adjacent-coupled-maps (retrieved 2026-10-19)

Canonical URL: https://4ort.xyz/entity/an-efficient-and-secure-image-encryption-algorithm-based-on-non-adjacent-coupled-maps · Last refreshed: