000 04289naa a22005177i 4500
001 UMUN-OA-20261005-CYB-053
003 local
005 20261005174818.0
006 m o d
007 cr||||||||||||
008 261005s2024 xx o u000 0 eng d
024 7 _a10.1007/s10462-024-10719-0
_2doi
035 _a(local)OpenAlex:W4392683354
040 _alocal
_beng
_clocal
041 0 _aeng
100 0 _aSanjay Kumar
_eauthor.
245 1 2 _aA chaotic based image encryption scheme using elliptic curve cryptography and genetic algorithm /
_cSanjay Kumar; Deepmala Sharma.
264 1 _a[Place of publication not identified] :
_bSpringer Science+Business Media,
_c2024.
300 _a1 online resource (1 article).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aPublication type: Journal article.
500 _aLinked open-access copy: published version.
506 0 _aOpen access; no subscription required for the linked open-access version.
_fUnrestricted online access
_2star
520 3 _aAbstract In the era of digital communication and data security, image encryption plays a crucial role in safeguarding sensitive information. Protecting sensitive visual data from unauthorized access drives the pursuit of advanced image encryption methods. This paper proposes a novel approach to enhance image encryption by combining the power of a chaotic map, elliptic curve cryptography, and genetic algorithm. The chaotic map, specifically Arnold’s cat map, is employed to introduce chaos and randomness into the encryption process. The proposed image encryption process involves applying Arnold’s cat map for shuffling the pixel positions, followed by elliptic curve cryptography for encrypting the pixel values using public and private keys. Additionally, a genetic algorithm is employed to optimize the key generation process, enhancing the security of the encryption scheme. The combined utilization of these techniques aims to achieve a high level of confidentiality and robustness in image encryption. The algorithm underwent thorough analysis. It achieved a maximum entropy score of 7.99, indicating a high level of randomness and unpredictability in the encrypted data. Additionally, it exhibited near-zero correlation, which suggests strong resistance against statistical attacks. Moreover, the cryptographic range of possible keys was found to be $$2^{511}$$ 2 511 . This extensive key space makes the algorithm highly resilient against brute force attacks. It took only 0.5634 s to encrypt a moderately sized $$512\times 512$$ 512 × 512 pixel image with an 8-bit image on a standard desktop computer with a 2.3 GHz processor and 16 GB of RAM. The experimental findings confirm that the proposed approach is highly effective and efficient in safeguarding sensitive image data from unauthorized access and potential attacks. This scheme has the benefit of allowing us to protect our private image data while it’s being transmitted.
540 _aCreative Commons Attribution (licence family recorded by the source; version not supplied in metadata).
_uhttps://openalex.org/W4392683354
546 _aIn English.
588 0 _aDescription generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.
590 _aCourse allocation: B. Sc. Cyber Security.
650 4 _aimage encryption
650 4 _achaotic maps
650 4 _aArnold cat map
650 4 _aelliptic curve cryptography
650 4 _agenetic algorithm
650 4 _apixel shuffling
653 _aB. Sc. Cyber Security
653 _aUMUN open access collection
653 _acryptography
655 4 _aJournal articles.
700 0 _aDeepmala Sharma
_eauthor.
773 0 _tArtificial Intelligence Review
_gVol. 57, no. 4, (2024)
_x0269-2821
856 4 0 _uhttps://link.springer.com/content/pdf/10.1007/s10462-024-10719-0.pdf
_yRead open-access publication
_zOpen access. Access and licence reported by the source; this host could not be independently checked by automation.
_70
884 _aCourse selection and automated MARC21 enrichment from OpenAlex metadata.
_g20261005
_khttps://openalex.org/W4392683354
_qlocal
942 _n0
999 _c480
_d480