IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2003724.html
   My bibliography  Save this article

A Chaos-Based Image Encryption Scheme Is Proposed Using Multiple Chaotic Maps

Author

Listed:
  • Muhammad Akraam
  • Tabasam Rashid
  • Sohail Zafar
  • Akif Akgul

Abstract

Everybody wants to maintain solitariness to some extent or entirely in his dealings with other people during different modes of communication. To retain privacy, researchers materialized distinct image encryption algorithms using chaotic maps. Due to their extraordinary features, most researchers employed multidimensional chaotic maps to barricade clandestine information or digital images from potential invaders. Still, multidimensional chaotic maps have many impediments conferred in the literature review. In this paper, we developed a cryptosystem utilizing multiple chaotic maps to mitigate the shortcoming of multidimensional chaotic maps. A distinctive approach is adopted to sire a key stream using a combination of chaotic maps and create a sequence of random integers linked with the pixels of the plain image to shatter the association between neighboring pixels of a plain image. Finally, diffusion is accomplished using the previously diffused pixels at a decimal level. Security and statistical analysis demonstrate that the presented encryption algorithm is robust against well-known attacks. An ample key space indicates that it is best suited for secure communication.

Suggested Citation

  • Muhammad Akraam & Tabasam Rashid & Sohail Zafar & Akif Akgul, 2023. "A Chaos-Based Image Encryption Scheme Is Proposed Using Multiple Chaotic Maps," Mathematical Problems in Engineering, Hindawi, vol. 2023, pages 1-13, May.
  • Handle: RePEc:hin:jnlmpe:2003724
    DOI: 10.1155/2023/2003724
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2023/2003724.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2023/2003724.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/2003724?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yinghong Cao & Linlin Tan & Xianying Xu & Bo Li, 2024. "A Universal Image Compression Sensing–Encryption Algorithm Based on DNA-Triploid Mutation," Mathematics, MDPI, vol. 12(13), pages 1-21, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:2003724. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.