Fast and Secure Image Encryption Using Josephus Ring Permutation and Logistic Map Diffusion

In recent years, the demand for efficient and secure image encryption techniques has grown significantly due to the increasing transmission of sensitive visual data. This paper proposes a novel hybrid image encryption scheme combining a Josephus Ring-based permutation phase with a logistic map-based diffusion phase to achieve both high security and computational efficiency. In the permutation phase, pixel positions are dynamically swapped using a Josephus Ring traversal, effectively disrupting spatial correlations. Subsequently, the diffusion phase employs a chaotic logistic map to generate temporary keys, which are XORed with permuted pixel values to enhance randomness and resist statistical attacks. The proposed method leverages the simplicity of the Josephus Ring for fast permutation and the inherent unpredictability of chaotic maps for robust diffusion. Experimental results demonstrate that the algorithm achieves strong encryption performance, with high sensitivity to initial keys, resistance against differential attacks, and low computational overhead. Security analysis confirms its effectiveness in terms of key space robustness, statistical entropy, and resistance to common cryptographic threats. The combination of these two lightweight mechanisms makes the proposed scheme suitable for real-time secure image transmission applications.

Institutions

Publication Details

Journal
Journal of Dynamic Systems Measurement and Control
Published
2025-04-12
DOI
https://doi.org/10.71503/jadsc.2025.1203702
Primary Topic
GDF15 and Related Biomarkers
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast and Secure Image Encryption Using Josephus Ring Permutation and Logistic Map Diffusion

Journal of Dynamic Systems Measurement and Control
GDF15 and Related Biomarkers
article

Fast and Secure Image Encryption Using Josephus Ring Permutation and Logistic Map Diffusion

article en

Abstract

In recent years, the demand for efficient and secure image encryption techniques has grown significantly due to the increasing transmission of sensitive visual data. This paper proposes a novel hybrid image encryption scheme combining a Josephus Ring-based permutation phase with a logistic map-based diffusion phase to achieve both high security and computational efficiency. In the permutation phase, pixel positions are dynamically swapped using a Josephus Ring traversal, effectively disrupting spatial correlations. Subsequently, the diffusion phase employs a chaotic logistic map to generate temporary keys, which are XORed with permuted pixel values to enhance randomness and resist statistical attacks. The proposed method leverages the simplicity of the Josephus Ring for fast permutation and the inherent unpredictability of chaotic maps for robust diffusion. Experimental results demonstrate that the algorithm achieves strong encryption performance, with high sensitivity to initial keys, resistance against differential attacks, and low computational overhead. Security analysis confirms its effectiveness in terms of key space robustness, statistical entropy, and resistance to common cryptographic threats. The combination of these two lightweight mechanisms makes the proposed scheme suitable for real-time secure image transmission applications.

Journal of Dynamic Systems Measurement and Control
Islamic Azad University, Firoozkooh Branch (IR), Islamic Azad University of Gorgan (IR)
Openalex Percentile: Top 35%
GDF15 and Related Biomarkers
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.