Image Encryption via Data-Identified Discrete Chaotic Maps
Wenyuan Lia, Xiao-Yun Wang, Zhigang Zhu, Xiaofeng Zhang, Li Zhang

TL;DR
This paper introduces a novel data-driven image encryption method that learns chaotic maps directly from data, enhancing security by making the encryption structure data-dependent and highly sensitive to initial conditions.
Contribution
It develops a framework that identifies explicit chaotic maps from observational data using SINDy-PI, moving beyond fixed maps in chaos-based cryptography.
Findings
Successfully applied to multiple chaotic systems demonstrating generality.
Achieves high information entropy and low pixel correlation.
Exhibits extreme sensitivity to initial conditions, ensuring security.
Abstract
In this work, we propose a data-driven image encryption framework that identifies chaotic maps directly from data using the SINDy-PI algorithm. Unlike conventional encryption schemes relying on predefined maps, our method learns the full explicit dynamics -- including cross-terms and higher-order nonlinearities -- from observational data. The validity of this approach is verified on three distinct chaotic systems: the H{\'e}non map, the three-dimensional logistic map, and the piecewise-linear Lozi map, demonstrating its generality. The encryption key consists solely of initial conditions; the map structure itself becomes data-dependent, introducing an extra layer of security. Moreover, even when the initial conditions are fixed, different training data (e.g., with a tiny noise seed) lead to slightly different maps, which produce completely different ciphertexts (NPCR ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
