Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (96)

Search Parameters:
Keywords = digital chaotic map

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
30 pages, 11266 KB  
Article
Image Encryption Algorithm Based on a Novel 2D Folded Sine-Logistic Map and Concentric-Ring Model
by Meixuan Huang, Shaobao Wu, Zhihua Wu and Xiaoqiang Zhang
Entropy 2026, 28(8), 863; https://doi.org/10.3390/e28080863 - 1 Aug 2026
Viewed by 303
Abstract
Digital images, as a widely used multimedia carrier, are vulnerable to various security risks in open network environments. To enhance the security of digital images during storage and transmission, this paper proposes an image encryption algorithm based on a 2D folded sine-logistic map. [...] Read more.
Digital images, as a widely used multimedia carrier, are vulnerable to various security risks in open network environments. To enhance the security of digital images during storage and transmission, this paper proposes an image encryption algorithm based on a 2D folded sine-logistic map. First, the user master key and the SHA-256 hash of the plaintext image are combined to generate plaintext-related chaotic sequences. Second, a concentric-ring permutation is performed through three-ring partition, cyclic shifting, and route regrouping, with an additional channel crossover for RGB images to enhance inter-channel coupling. Finally, an enhanced hybrid diffusion mechanism with 4-bit nibble-swap perturbation is applied to strengthen pixel-value diffusion and local nonlinearity. Experimental results show that the average ciphertext entropy reaches 7.999, the adjacent-pixel correlation coefficient is reduced to 0.000016, and the NPCR/UACI values are close to their theoretical ideal levels. Combined with comprehensive security analyses, these findings demonstrate that the proposed scheme suppresses statistical characteristics and pixel correlations, resists brute-force, statistical, and differential attacks, and provides an efficient and secure solution for grayscale and color image transmission. Full article
(This article belongs to the Section Complexity)
Show Figures

Figure 1

15 pages, 9474 KB  
Review
Bifurcations and Hyperchaos in Mathematical Models of Sleep
by Adriano Scibilia and Luigi Fortuna
Bioengineering 2026, 13(7), 833; https://doi.org/10.3390/bioengineering13070833 - 21 Jul 2026
Viewed by 427
Abstract
Sleep regulation is generated by interacting nonlinear feedback loops involving homeostatic pressure, circadian forcing, mutual inhibition, and neuromodulatory mechanisms. This work presents a nonlinear-dynamical interpretation of sleep with emphasis on bifurcation structure, Lyapunov stability, deterministic intermittency, and hyperchaotic fragmentation. After summarizing representative sleep [...] Read more.
Sleep regulation is generated by interacting nonlinear feedback loops involving homeostatic pressure, circadian forcing, mutual inhibition, and neuromodulatory mechanisms. This work presents a nonlinear-dynamical interpretation of sleep with emphasis on bifurcation structure, Lyapunov stability, deterministic intermittency, and hyperchaotic fragmentation. After summarizing representative sleep models and the literature on sleep-stage dynamics, we combine bifurcation and Lyapunov exponent analyses of representative sleep-population models with a four-dimensional model in which cortical activation, sleep-promoting activity, homeostatic sleep drive, and the circadian pacemaker form a slow–fast feedback system. The model maps coordinate-dependent feedback, separated homeostatic accumulation and clearance, external sleep-debt forcing, refractory dynamics, and on–off intermittency onto physiological sleep–wake processes. The baseline diagrams identify routes from regular oscillations to period-doubling, chaotic bands, periodic windows, and positive Lyapunov regions, while the new Lyapunov maps of the four-dimensional model identify parameter regions where the largest and second-largest Lyapunov exponents are positive, supporting the hyperchaotic classification. The formulation also shows how chronic sleep debt and disease-associated or stress-related insomnia can be represented as shifts in homeostatic drive, inhibitory gain, and circadian coupling. Bifurcation theory therefore provides a useful framework for interpreting irregular sleep transitions and for inspiring future sleep-technology and digital twin applications. Full article
(This article belongs to the Special Issue Computational Intelligence for Healthcare)
Show Figures

Figure 1

33 pages, 13542 KB  
Article
Image Encryption Algorithm Based on a Novel Hyperchaotic Map and 3D Histogram Model
by Xiaoqiang Zhang, Pengfei Chen and Xueheng Zhang
Entropy 2026, 28(5), 576; https://doi.org/10.3390/e28050576 - 21 May 2026
Cited by 1 | Viewed by 371
Abstract
Digital images are easily transmitted in Internet, but there is also a great risk of information leakage. To meet the requirements of secure image transmission and real-time communication, an image encryption algorithm based on a novel chaotic map and a three-dimensional histogram is [...] Read more.
Digital images are easily transmitted in Internet, but there is also a great risk of information leakage. To meet the requirements of secure image transmission and real-time communication, an image encryption algorithm based on a novel chaotic map and a three-dimensional histogram is proposed. Firstly, a novel two-dimensional chaotic map is designed. Compared with traditional chaotic systems, it exhibits superior chaotic performance and a wider parameter range; secondly, the proposed algorithm is designed to extend the original image to three dimensions, followed by 3D simultaneous scrambling–diffusion; thirdly, the 2D exclusive OR (XOR) operation is performed for further diffusion; finally, the 3D matrix is merged to obtain the encrypted image. The encrypted images have uniform histograms and pass the Chi-square test. Information entropy is greater than 7.9992, and the average values of Number of Pixels Change Rate (NPCR) and Uniform Average Change Intensity (UACI), being 99.6137 and 33.4783, respectively, show that this algorithm can effectively resist differential attacks. On average, a 512 × 512 image can be encrypted in 0.7 s using the proposed algorithm. Thus, the proposed algorithm is applicable to image transmission over network platforms due to its high security, excellent encryption performance, and high efficiency. Full article
(This article belongs to the Section Complexity)
Show Figures

Figure 1

20 pages, 7789 KB  
Article
Simulation and Analysis of the Second-Order Memristive System in the CUDAynamics Suite
by Alexander Khanov, Maksim Gozhan, Denis Butusov, Yulia Bobrova and Valerii Ostrovskii
Algorithms 2026, 19(5), 402; https://doi.org/10.3390/a19050402 - 17 May 2026
Viewed by 623
Abstract
Cycle-to-cycle variability of switching parameters inherent to memristive devices introduces significant problems in the design of neuromorphic systems and non-volatile memory. This study investigates the dynamics of a second-order memristive system incorporating capacitive effects that model parasitic charge within individual memristors, addressing both [...] Read more.
Cycle-to-cycle variability of switching parameters inherent to memristive devices introduces significant problems in the design of neuromorphic systems and non-volatile memory. This study investigates the dynamics of a second-order memristive system incorporating capacitive effects that model parasitic charge within individual memristors, addressing both the technical need for accurate analysis of complex regimes and the demand for exploratory environments. Simulations were performed using CUDAynamics, an interactive software suite developed by the authors, which utilizes parallel computing, primarily via NVIDIA Compute Unified Device Architecture (CUDA). It integrates multiple analysis tools for dynamical systems, including bifurcation diagrams, the largest Lyapunov exponent and periodicity mapping, and interactive navigation in multidimensional parameter spaces. The memristive system was discretized applying multiple integration methods with a fixed time step and various waveforms of the input signal. Analysis tools revealed well-defined regions of chaotic dynamics in the memristor resistance parameter space as functions of input signal properties. Sinusoidal and triangular waveforms produced topologically similar distributions of dynamical regimes, whereas the square waveform, mimicking digital inputs, generated distinct dynamical patterns while still preserving chaotic trajectories under specific conditions. Interactive visualization capabilities of CUDAynamics effectively demonstrate attractor evolution and hysteresis deformation, providing immediate visual feedback that significantly enhances conceptual comprehension of nonlinear feedback mechanisms. Beyond its practical implications for the design of analog and digital memristive devices, CUDAynamics offers a scalable, open-source toolkit to aid researchers and engineers in exploring complex dynamical phenomena. Full article
(This article belongs to the Special Issue Recent Advances in Numerical Algorithms and Their Applications)
Show Figures

Figure 1

31 pages, 2240 KB  
Article
A Routing Mechanism for Low-Power and Lossy Networks in Asymmetric Environments: Leveraging Digital Twin-Enabled Computing Power Networks
by Yanan Cao, Guang Zhang and Yuxin Shen
Symmetry 2026, 18(5), 841; https://doi.org/10.3390/sym18050841 - 14 May 2026
Viewed by 421
Abstract
Asymmetry is a prevalent phenomenon in low-power and lossy networks (LLNs) due to resource constraints and unstable links. The routing protocol for the low power and lossy network (RPL), standardized by the Internet Engineering Task Force (IETF), is specifically designed for LLNs with [...] Read more.
Asymmetry is a prevalent phenomenon in low-power and lossy networks (LLNs) due to resource constraints and unstable links. The routing protocol for the low power and lossy network (RPL), standardized by the Internet Engineering Task Force (IETF), is specifically designed for LLNs with characteristics of resource constraints, lossy links, and complex communication environments. However, its performance is fundamentally limited by node capabilities and unstable links, a contradiction exacerbated by the stringent QoS demands of emerging applications like IIoT or precision agriculture. Consequently, new RPL routing technologies based on the digital twin-enabled computing power network, called RPL-DTCP, were designed to improve network QoS and support practical applications. First, a low-power and lossy network architecture based on twin-enabled computing network was proposed, considering LLN requirements and computing twin services. Second, in response to the requirements of the digital twin, computing power network and LLNs for low synchronization latency, high data accuracy, efficient computing resource utilization, and energy conservation, several routing metrics were designed, including the data processing model, model deployment rate, end-to-end delay, node remaining energy, and ETX. Then an initial matrix and a comprehensive objective function were formulated to comprehensively evaluate these metrics. Third, to solve the multi-objective optimization problem, an enhanced whale optimization algorithm (E-WOA) was developed. E-WOA improved upon the standard version by using improved Tent chaotic mapping for population initialization, nonlinear adaptive convergence factor, and Cauchy variation mutation operator for solution perturbation, thereby enhancing its global search capability and convergence speed, enabling it to effectively identify the optimal routing path. Simulations confirmed that RPL-DTCP outperforms benchmark algorithms, achieving significant reductions in end-to-end delay, higher packet delivery ratios, extended network lifetime, etc. These findings demonstrate that RPL-DTCP effectively addresses the resource-performance contradiction in LLNs, providing a reliable and efficient routing framework for emerging compute-intensive IoT applications. Full article
(This article belongs to the Special Issue Symmetry/Asymmetry in Wireless Communication and Sensor Networks II)
Show Figures

Figure 1

20 pages, 3233 KB  
Article
Discrete Exponential Memristor-Coupled Multistable Hyperchaotic Attractor
by Qiujie Wu, Jin Chen, Yue Wang, Fei Dong and Yang Long
Mathematics 2026, 14(10), 1648; https://doi.org/10.3390/math14101648 - 13 May 2026
Cited by 1 | Viewed by 356
Abstract
Discrete memristive chaotic maps are promising for secure communications due to their digital compatibility, yet existing designs face limitations, including narrow hyperchaotic ranges and a single type of chaotic attractor. This paper proposes a family of 2D hyperchaotic maps by coupling a discrete [...] Read more.
Discrete memristive chaotic maps are promising for secure communications due to their digital compatibility, yet existing designs face limitations, including narrow hyperchaotic ranges and a single type of chaotic attractor. This paper proposes a family of 2D hyperchaotic maps by coupling a discrete exponential memristor with four 1D seed maps. Theoretical analysis reveals that the exponential memristor induces non-hyperbolic fixed points and periodicity with respect to the memristor’s initial charge, enabling controlled coexistence of both homogeneous and heterogeneous multistable attractors. Numerical simulations show two positive Lyapunov exponents (LEs) and broad hyperchaotic regions; the memristor-coupled Sine map achieves a maximum LE of 0.4963 and spectral entropy (SE) of 0.8915, outperforming representative cosine- and quadratic-based benchmarks. A pseudorandom number generator (PRNG) passes all National Institute of Standards and Technology (NIST) SP 800-22 tests. STM32F407-based hardware experiments confirm physical realizability, and an image encryption application demonstrates near-ideal entropy (7.9883) and strong differential attack resistance. These results establish the discrete exponential memristor as an effective nonlinearity for enriching chaos complexity and hardware-oriented security primitives. Full article
(This article belongs to the Section C2: Dynamical Systems)
Show Figures

Figure 1

29 pages, 12423 KB  
Article
Image Encryption Algorithm Based on a New Two-Dimensional Chaotic System and Rotating Dial Model
by Xiaoqiang Zhang and Haoran Hu
Entropy 2026, 28(5), 530; https://doi.org/10.3390/e28050530 - 7 May 2026
Cited by 2 | Viewed by 592
Abstract
With the rapid advancement of information technology, the secure transmission and storage of digital images have garnered increasing attention. To safeguard image information from theft and enhance security during network transmission, a novel image encryption algorithm based on a two-dimensional chaotic system named [...] Read more.
With the rapid advancement of information technology, the secure transmission and storage of digital images have garnered increasing attention. To safeguard image information from theft and enhance security during network transmission, a novel image encryption algorithm based on a two-dimensional chaotic system named the two-dimensional sine-cubic modular map (2D-SCMM) and a rotating dial model is proposed. First, the 2D-SCMM is designed, and comprehensive dynamic analyses along with randomness assessments are conducted. Second, in the scrambling phase, a diagonal cyclic-shift transformation is employed to dynamically update the distribution of pixel positions. Third, during the diffusion phase, inspired by the dial phone, the rotating dial model is utilized to achieve dynamic pixel updates. Finally, extensive testing and comparative analyses reveal that image pixels are evenly distributed, the average entropy value for grayscale images is 7.9993, and the correlation coefficients approach 0. Meanwhile, the encryption algorithm is highly secure against various attacks, such as noise attacks and cropping attacks. Full article
(This article belongs to the Section Complexity)
Show Figures

Figure 1

26 pages, 4266 KB  
Article
A Chaos-Based Image Encryption Algorithm via Integrated Cellular Automata and Tent Map Systems
by Yuanyuan Huang, Zixi Zhou, Diqing Liang, Fei Yu and Jie Jin
Axioms 2026, 15(5), 304; https://doi.org/10.3390/axioms15050304 - 23 Apr 2026
Viewed by 487
Abstract
This study proposes a novel image encryption algorithm based on a two-dimensional discrete chaotic system that integrates cellular automata (CA) with a tent map. The algorithm addresses security vulnerabilities in digital image transmission and storage across open networks or cloud environments. It employs [...] Read more.
This study proposes a novel image encryption algorithm based on a two-dimensional discrete chaotic system that integrates cellular automata (CA) with a tent map. The algorithm addresses security vulnerabilities in digital image transmission and storage across open networks or cloud environments. It employs a three-phase encryption process: coordinate permutation, spatial permutation, and diffusion. Sequential application of Arnold’s coordinate scrambling, maze traversal-based spatial rearrangement, and a CA-driven diffusion mechanism enhances robustness against noise, differential attacks, and partial cropping. A Dynamic CA–Tent Map (DCA–TM) hybrid chaotic system is designed to overcome periodicity and limited key space issues inherent in conventional chaotic encryption. The permutation stage is refined into coordinate and spatial phases to achieve comprehensive pixel randomization. During diffusion, CA rules are selected dynamically based on the iteration counts of the initial parameters, yielding an adaptive encryption system with a variable key space. Performance evaluations—including Lyapunov exponent tests, bifurcation analysis, information entropy measurement, and pixel correlation assessment—confirm the strong chaotic behavior and high security of the proposed scheme. Full article
(This article belongs to the Special Issue Nonlinear Dynamical System and Its Applications)
Show Figures

Figure 1

20 pages, 5162 KB  
Article
Lossless Reversible Color Image Encryption Using Multilayer Hybrid Chaos with Gram–Schmidt Orthogonalization and ChaCha20-HMAC-Authenticated Transport
by Saadia Drissi, Faiq Gmira and Meriyem Chergui
Technologies 2026, 14(4), 235; https://doi.org/10.3390/technologies14040235 - 16 Apr 2026
Viewed by 727
Abstract
In this study, a hybrid multi-layer scheme for reversible color image encryption is proposed, ensuring lossless reconstruction and strong cryptographic security concurrently. This method consists of three main stages. First, session-specific keys are generated using HKDF-SHA256 along with a timestamp-based mechanism to prevent [...] Read more.
In this study, a hybrid multi-layer scheme for reversible color image encryption is proposed, ensuring lossless reconstruction and strong cryptographic security concurrently. This method consists of three main stages. First, session-specific keys are generated using HKDF-SHA256 along with a timestamp-based mechanism to prevent replay attacks and support dynamic key management. Second, a four-layer confusion–diffusion structure is applied. It uses Gram–Schmidt orthogonal matrices, integer-based PWLCM chaotic mapping, the Hill cipher, and dynamically created S-Boxes. These operations rely on integer modular arithmetic 256 and Q16.16 fixed-point precision. Finally, ChaCha20 stream encryption with HMAC-SHA256 authentication is used to secure data transmission in distributed environments. Experimental tests conducted on standard images show strong cryptographic performance, including near-ideal entropy (7.9993 bits), a significant avalanche effect (NPCR 99.6%, UACI 33.4%), and very low pixel correlation. The method achieves perfect lossless reconstruction and provides an effective key space 2128. These results confirm the suitability of the proposed scheme for secure image protection in applications requiring bit-exact recovery, such as medical imaging, digital forensics, and satellite communications. Full article
Show Figures

Figure 1

25 pages, 5523 KB  
Article
Robust Image Encryption Exploiting 2D Hyper-Chaos, Fractal Sierpiński Carpet Confusion, and Cascaded Diffusion
by Zeyu Zhang, Wenqiang Zhang, Mingxu Wang, Na Ren, Peizhen Zhang and Yiting Lin
Symmetry 2026, 18(4), 643; https://doi.org/10.3390/sym18040643 - 10 Apr 2026
Cited by 1 | Viewed by 574
Abstract
With the rapid growth of digital image transmission, ensuring data security has become increasingly important. However, existing chaos-based image encryption algorithms often suffer from insufficient chaotic randomness and weak integration between chaotic dynamics and encryption mechanisms. To address these issues, a novel image [...] Read more.
With the rapid growth of digital image transmission, ensuring data security has become increasingly important. However, existing chaos-based image encryption algorithms often suffer from insufficient chaotic randomness and weak integration between chaotic dynamics and encryption mechanisms. To address these issues, a novel image encryption scheme based on a two-dimensional hyperbolic–exponential Sine–Logistic map (2D-HESLM) is proposed. A Sierpiński carpet-inspired scrambling strategy and a cascaded diffusion mechanism are designed to enhance permutation and diffusion performance based on the 2D-HESLM. The experimental results show that the information entropy value is 7.9980, while NPCR and UACI are approximately averaged 99.6147% and 33.4672%, respectively, with correlation coefficients close to zero. These results demonstrate the effectiveness and security of the proposed scheme. Full article
Show Figures

Figure 1

31 pages, 22634 KB  
Article
A Novel Image Encryption Scheme Based on Two-Dimensional Chaotic Map Constructed from Ackley Function and DNA Operations
by Chao Jiang, Xiong Zhang and Xiaoqin Zhang
Entropy 2026, 28(3), 322; https://doi.org/10.3390/e28030322 - 13 Mar 2026
Cited by 2 | Viewed by 880
Abstract
In contemporary communication systems, digital images occupy an irreplaceable role; however, the privacy-related risks attendant to their prevalent application have grown increasingly salient. This paper presents an image encryption scheme integrating a novel two-dimensional Ackley-Sine chaotic map (2D-ASM) with dynamic DNA operations. First, [...] Read more.
In contemporary communication systems, digital images occupy an irreplaceable role; however, the privacy-related risks attendant to their prevalent application have grown increasingly salient. This paper presents an image encryption scheme integrating a novel two-dimensional Ackley-Sine chaotic map (2D-ASM) with dynamic DNA operations. First, a two-dimensional Ackley-Sine chaotic map, constructed based on the Ackley function and sine function, is designed and validated through a series of chaotic indicators. Results demonstrate that 2D-ASM exhibits superior chaotic properties compared to several existing state-of-the-art chaotic maps, with its maximum Lyapunov exponent (LE) exceeding 23, Permutation Entropy (PE) close to 1 in the full parameter range, and correlation dimension (CD) significantly higher than comparative chaotic systems. The proposed 2D-ASM-based image encryption scheme leverages the SHA-256 hash value of the plaintext image and four external keys to jointly generate the initial conditions and parameters of the 2D-ASM chaotic system, thereby ensuring a sufficiently large key space of 2256. Subsequently, chaotic sequences generated by 2D-ASM are employed to permute and diffuse the plaintext image, followed by dynamic DNA coding, operations, and decoding to obtain the encrypted image. Security analyses and comparisons with several existing representative algorithms confirm that the proposed encryption scheme achieves excellent encryption performance: the Number of Pixels Change Rate (NPCR) is above 99.6%, the Unified Average Changing Intensity (UACI) approaches 33.4%, and the information entropy of ciphertext images reaches 7.999 or higher. The scheme can effectively resist various potential attacks, including statistical and differential attacks, and outperforms representative algorithms in pixel correlation reduction and anti-interference performance. Full article
(This article belongs to the Section Signal and Data Analysis)
Show Figures

Figure 1

24 pages, 9307 KB  
Article
Fast and Lightweight Hybrid Image Encryption and Steganography Leveraging an SPN, Chaotic Maps, and LSB Substitution
by Abdullah Alaklabi, Muhammad Asfand Hafeez and Arslan Munir
J. Cybersecur. Priv. 2026, 6(1), 31; https://doi.org/10.3390/jcp6010031 - 9 Feb 2026
Cited by 1 | Viewed by 2024
Abstract
The rapid growth of digital communication has heightened the need for the secure transfer of sensitive image data. This is due to the increasing threats posed by cyberattacks and unauthorized access. Traditional encryption methods, while effective for text and binary data, often face [...] Read more.
The rapid growth of digital communication has heightened the need for the secure transfer of sensitive image data. This is due to the increasing threats posed by cyberattacks and unauthorized access. Traditional encryption methods, while effective for text and binary data, often face significant challenges when applied to images, due to their larger size and complex structure. These characteristics make it difficult to provide a robust security solution. In this paper, we present a fast and efficient hybrid image encryption and steganography algorithm that leverages a substitution–permutation network (SPN), a chaotic logistic map (CLM), and least-significant-bit (LSB) substitution. This approach aims to improve data security and confidentiality while maintaining low computational complexity. The chaotic map generates random sequences for substitution and permutation, ensuring high unpredictability. The SPN framework improves the confusion and diffusion properties of the encryption process. The LSB substitution method hides the encrypted data values within the pixels of the cover image. We evaluate the security and efficiency of the proposed algorithm using various statistical tests, including measurement of the mean square error (MSE) and peak signal-to-noise ratio (PSNR) and pixel difference histogram (PDH) analysis. The results indicate that our algorithm outperforms many existing methods in terms of speed and efficiency, making it suitable for real-time hybrid encryption and steganography applications. Full article
(This article belongs to the Section Security Engineering & Applications)
Show Figures

Figure 1

20 pages, 3886 KB  
Article
High-Security Image Encryption Using Baker Map Confusion and Extended PWAM Chaotic Diffusion
by Ayman H. Abd El-Aziem, Marwa Hussien Mohamed and Ahmed Abdelhafeez
Computers 2026, 15(2), 106; https://doi.org/10.3390/computers15020106 - 3 Feb 2026
Cited by 4 | Viewed by 968
Abstract
The heavy use of digital images across network systems has become a major concern regarding data confidentiality and unauthorized access. Conventional image encryption techniques hardly achieve high security levels efficiently, especially in real-time and resource-constrained environments. These challenges motivate the development of more [...] Read more.
The heavy use of digital images across network systems has become a major concern regarding data confidentiality and unauthorized access. Conventional image encryption techniques hardly achieve high security levels efficiently, especially in real-time and resource-constrained environments. These challenges motivate the development of more robust and efficient encryption mechanisms. In this paper, a dual-chaotic image encryption framework is developed where two complementary chaotic systems are combined to effectively realize confusion and diffusion. The proposed method uses a chaotic permutation mechanism to find the pixel positions and enhanced chaotic diffusion to change the pixel values for eliminating the statistical correlations. An extended family of piecewise affine chaotic maps is designed to enhance the dynamic range and complexity of the diffusion process for strengthening the resistance capability against cryptographic attacks. Intensive experimental validations confirm that the proposed scheme well obscures the visual information and strongly reduces the pixel correlations in the encrypted images. High entropy values, uniform histogram distributions, high resistance to differential attacks, and improved robustness are further evidenced by statistical and security analyses compared to some conventional image encryption techniques. The results also show extremely low computational overheads, hence allowing for efficient implementation. The proposed encryption framework provides more security for digital image transmission and storage, and the performances are still practical. Given its robustness, efficiency, and scalability, it is equally adequate for real-time multi-media applications and secure communication systems, hence promising to offer a reliable solution for modern image protection requirements. Full article
(This article belongs to the Special Issue Multimedia Data and Network Security)
Show Figures

Figure 1

29 pages, 72687 KB  
Review
A Review of Digital Signal Processing Methods for Intelligent Railway Transportation Systems
by Nan Jia, Haifeng Song, Jia You, Min Zhou and Hairong Dong
Mathematics 2026, 14(3), 539; https://doi.org/10.3390/math14030539 - 2 Feb 2026
Viewed by 1646
Abstract
Digital signal processing plays a central role in intelligent railway communications under high-mobility, strong-multipath, and time-varying-channel conditions. This review surveys representative techniques for multi-carrier modulation, precoding, index modulation, and chaos-inspired physical layer security and highlights their mathematical foundations. Core themes include transform-domain representations [...] Read more.
Digital signal processing plays a central role in intelligent railway communications under high-mobility, strong-multipath, and time-varying-channel conditions. This review surveys representative techniques for multi-carrier modulation, precoding, index modulation, and chaos-inspired physical layer security and highlights their mathematical foundations. Core themes include transform-domain representations typified by time–frequency analysis, linear-algebraic formulations of precoding and equalization, combinatorial structures underlying index mapping and spectral efficiency gains, and nonlinear dynamical systems theory of chaotic encryption. The methods are compared in terms of bit error performance, peak-to-average power ratio, spectral efficiency, computational complexity, and information security, with emphasis on railway-specific deployment constraints. The synergistic application of these methods with intelligent railway transportation systems is expected to enhance the overall performance of railway transportation systems in terms of transmission efficiency, reliability, and security. It provides critical technological support for the efficient and secure operation of next-generation intelligent transportation systems. Full article
Show Figures

Figure 1

56 pages, 2938 KB  
Article
FileCipher: A Chaos-Enhanced CPRNG-Based Algorithm for Parallel File Encryption
by Yousef Sanjalawe, Ahmad Al-Daraiseh, Salam Al-E’mari and Sharif Naser Makhadmeh
Algorithms 2026, 19(2), 119; https://doi.org/10.3390/a19020119 - 2 Feb 2026
Cited by 4 | Viewed by 903
Abstract
The exponential growth of digital data and the escalating sophistication of cyber threats have intensified the demand for secure yet computationally efficient encryption methods. Conventional algorithms (e.g., AES-based schemes) are cryptographically strong and widely deployed; however, some implementations can face performance bottlenecks in [...] Read more.
The exponential growth of digital data and the escalating sophistication of cyber threats have intensified the demand for secure yet computationally efficient encryption methods. Conventional algorithms (e.g., AES-based schemes) are cryptographically strong and widely deployed; however, some implementations can face performance bottlenecks in large-scale or real-time workloads. While many modern systems seed from hardware entropy sources and employ standardized cryptographic PRNGs/DRBGs, security can still be degraded in practice by weak entropy initialization, misconfiguration, or the use of non-cryptographic deterministic generators in certain environments. To address these gaps, this study introduces FileCipher. This novel file-encryption framework integrates a chaos-enhanced Cryptographically Secure Pseudorandom Number Generator (CPRNG) based on the State-Based Tent Map (SBTM). The proposed design achieves a balanced trade-off between security and efficiency through dynamic key generation, adaptive block reshaping, and structured confusion–diffusion processes. The SBTM-driven CPRNG introduces adaptive seeding and multi-key feedback, ensuring high entropy and sensitivity to initial conditions. A multi-threaded Java implementation demonstrates approximately 60% reduction in encryption time compared with AES-CBC, validating FileCipher’s scalability in parallel execution environments. Statistical evaluations using NIST SP 800-22, SP 800-90B, Dieharder, and TestU01 confirm superior randomness with over 99% pass rates, while Avalanche Effect analysis indicates bit-change ratios near 50%, proving strong diffusion characteristics. The results highlight FileCipher’s novelty in combining nonlinear chaotic dynamics with lightweight parallel architecture, offering a robust, platform-independent solution for secure data storage and transmission. Ultimately, this paper contributes a reproducible, entropy-stable, and high-performance cryptographic mechanism that redefines the efficiency–security balance in modern encryption systems. Full article
Show Figures

Figure 1

Back to TopTop