This work presents a hybrid chaotic–cryptographic image encryption method that integrates a physical two-dimensional delta-kicked oscillator with a PBKDF2-HMAC-SHA256 key derivation function. The key consists in a 12-symbol human key and four user-defined salt words into 256-bit high-entropy material, later converted for the KDF into 96 balanced decimal digits that seed the chaotic functions. The encryption occurs on the real domain, using a partition–permutation mechanism followed by modular diffusion, both governed by chaos. Experimental results confirm the perfect reversibility of the process, high randomness (entropy = 7.9981), and zero adjacent-pixel correlation. Known and chosen plaintext attacks revealed no statistical dependence between cipher and plain images, while NPCR≈99.6% and UACI≈33.9% demonstrate complete diffusion. The PBKDF2-based key derivation expands the key space to 2256 combinations, effectively eliminating weak-key conditions and enhancing reproducibility. The proposed approach bridges deterministic chaos and modern cryptography, offering a secure and verifiable method for protecting sensitive images.
This work presents a hybrid chaotic–cryptographic image encryption method that integrates a physical two-dimensional delta-kicked oscillator with a PBKDF2-HMAC-SHA256 key derivation function (KDF). The user-provided key material—a 12-character, human-readable key and four salt words—is transformed by the KDF into 256 bits of high-entropy data, which is then converted into 96 balanced decimal digits to seed the chaotic system. Encryption operates in the real number domain through a chaotic partition–permutation stage followed by modular diffusion. Experimental results confirm perfect reversibility, high randomness (Shannon entropy ), and negligible adjacent-pixel correlation. The method resists known- and chosen-plaintext attacks, showing no statistical dependence between plain and cipher images. Differential analysis yields and , demonstrating complete diffusion. The PBKDF2-based key derivation expands the effective key space to , eliminates weak-key conditions, and ensures full reproducibility. The proposed approach bridges deterministic chaos and modern cryptography, offering a secure, verifiable framework for protecting sensitive images.
This work presents a Fourier-domain encryption scheme for multiplexed image databases that integrates virtual-optical multiplexing with chaotic diffusion. By combining chaotic encryption with spectral-domain symmetry reduction, the proposed approach secures large multiplexed image datasets while reducing memory requirements and preserving reconstruction fidelity. A dataset of 2025 grayscale images ( pixels) is multiplexed and encrypted using linear chaotic transformations applied separately to the amplitude (A) and phase () components. To improve storage efficiency, the symmetry conditions of both spectral components are exploited, allowing a reduced portion of the Fourier plane to be stored while preserving accurate reconstruction. A performance landscape relating the correlation coefficient (CC), memory consumption, and the retained Fourier-plane percentage (FPP) is constructed to identify stable operating regions that balance reconstruction fidelity and compression under increasing multiplexing load. The encryption key consists of a 22-symbol ASCII string from which 84 seed parameters for a deterministic pseudorandom chaotic map are derived. Security and sensitivity analyses demonstrate strong key dependence and resistance to statistical attacks, while maintaining high reconstruction fidelity. The proposed scheme provides an efficient and scalable solution for secure large-scale image repositories.
In this paper we obtain approximated numerical solutions for the 2D Helmholtz equation using a radial basis function-generated finite difference scheme (RBF-FD), where weights are calculated by applying an oscillatory radial basis function given in terms of Bessel functions of the first kind. The problem of obtaining weights by local interpolation is ill-conditioned; we overcome this difficulty by means of regularization of the interpolation matrix by perturbing its diagonal. The condition number of this perturbed matrix is controlled according to a prescribed value of a regularization parameter. Different numerical tests are performed in order to study convergence and algorithmic complexity. As a result, we verify that dispersion and pollution effects are mitigated.