Image Encryption via Base-n PRNGs and Parallel Base-n S-boxes

preprint OA: closed
View at publisher

Abstract

Abstract The fast-paced advancement in multimedia production and exchanges over unsecured networks have led to a dire need to develop security applications. In this regard, chaos theory has much to offer, especially high-dimensional (HD) chaotic functions of fractional order. The authors propose a new secure and robust image encryption method in this research work. In this method, the authors hybridize the Chen and Chua chaotic functions with a memristor circuit to benefit from the strengths of each. Such a hybridization of systems allows for the generation of pseudo-random numbers which are used to develop encryption keys and substitution boxes (S-boxes). The generated encryption keys are utilized with different logical and arithmetic operations, carrying out data diffusion. Multiple S-boxes of varying base-n are generated and utilized in a parallel fashion, carrying out data confusion. The computed numerical results reflect the superior capabilities of the proposed image encryption technique, signifying resilience and robustness against various attacks.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00