Skip to main content

ORIGINAL RESEARCH article

Front. Comput. Sci.

Sec. Computer Security

Volume 7 - 2025 | doi: 10.3389/fcomp.2025.1551166

Multimedia Privacy Considering: N-Round Cascaded Cryptosystem Based on Merged Multi-Chaos Maps in Presence of Various Image Attacks

Provisionally accepted
Mostafa Eltokhy Mostafa Eltokhy 1*Tarek Srour Tarek Srour 1Ali M El-Rifaie Ali M El-Rifaie 2*Mohsen A M El-Bendary Mohsen A M El-Bendary 1Atef E Abouelazm Atef E Abouelazm 3Bilel Neji Bilel Neji 2*
  • 1 Helwan University, Helwan, Egypt
  • 2 American University of the Middle East, Kuwait City, Kuwait
  • 3 Faculty of Engineering, Menofia University, Menofia, Egypt

The final, formatted version of the article will be published soon.

    Due to the wide spreading and varieties of wireless networks and its applications in the open environments, the security techniques need to be more robust, reliable and flexible with the multistages and interfered secret keys capabilities. This research paper presents an efficient cryptography approach through constructing a cascaded series of processes. It proposes multi-Number of encrypting process (N-Round Chaos-based) crypto-system containing N-secret keys based on the type of data classifications and the environment. The paper also presents the simple criteria of the Number of Rounds (N-Round). The several chaos-based encryption techniques have been utilized to construct the proposed algorithm and various scenarios of the N-round mechanism over the different classified images have been presented. In the most related published papers, a vital two issue have been missed which are the criteria of the required and suitable security levels choosing and the rules and conditions of the robust security keys. These to essential issues have been discussed in this research paper. The various gray-scale images are used in the executed computer simulation experiments to demonstrate the robustness, reliability and applicability of the proposed cryptoalgorithm. The experiments are executed with the considering of presence the various attacks such as Speckle, salt & pepper and Gaussian noise. Based on the results using the standard database (Hlevkin, USA CANVAS), the proposed algorithm is robust and suitable in the presence noise/attack environment applications. As clarified form the results, The similarity of extracted images is 100% to the original plaintext for the no-presence attacks, while in presence of noise and attacks the similarity is >99%. The quality of the decrypted images is better than the most of existing cryptosystems.

    Keywords: Power efficient security technique, Chaotic-based encryption, computational complexity, Flexible crypto-algorithm, Interactive security techniques, Image attacks

    Received: 09 Jan 2025; Accepted: 21 Mar 2025.

    Copyright: © 2025 Eltokhy, Srour, El-Rifaie, El-Bendary, Abouelazm and Neji. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

    * Correspondence:
    Mostafa Eltokhy, Helwan University, Helwan, Egypt
    Ali M El-Rifaie, American University of the Middle East, Kuwait City, Kuwait
    Bilel Neji, American University of the Middle East, Kuwait City, Kuwait

    Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.

    Research integrity at Frontiers

    Man ultramarathon runner in the mountains he trains at sunset

    94% of researchers rate our articles as excellent or good

    Learn more about the work of our research integrity team to safeguard the quality of each article we publish.


    Find out more