Analysis of traditional and modern image encryption algorithms under realistic ambience

Malik, Anjali; Gupta, Shailender; Dhall, Sangeeta

doi:10.1007/s11042-020-09279-6

Cited by 8 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Key size is a crucial parameter utilized for testing cryptography systems. Keyspace specifies the total combinations of keys 26 . Keys with a longer length offer higher resistance, and it has a significant impact on an encryption model's robustness against attack 20 .…”

Section: Resultsmentioning

confidence: 99%

“…The occurrence of this noise is due to sharp and sudden annoyance in images. It appears as a collection of dark and white pixels throughout the image 26 …”

Section: Resultsmentioning

confidence: 99%

“…Keyspace specifies the total combinations of keys. 26 Keys with a longer length offer higher resistance, and it has a significant impact on an encryption model's robustness against attack. 20 This analysis interprets the keyspace size longer than 2 100 indicates the high security of the encryption model.…”

Section: Keyspace Analysismentioning

confidence: 99%

“…It appears as a collection of dark and white pixels throughout the image. 26 Noise attack analysis has been illustrated in Figure 8 in which 0.05 and 0.01 intensity of salt and pepper noise have been applied on two colored images (sailboat on lake, peppers) and two grayscale images (fishing boat and clock).…”

Section: Noise Attackmentioning

confidence: 99%

See 3 more Smart Citations

Multi‐chaotic maps and blockchain based image encryption

Kumari,

Singh,

Singh

2024

Concurrency and Computation

View full text Add to dashboard Cite

SummaryThe vast technological developments make data transmission more frequent over networks. So, the data needs to be secured and for that reason, there is a requirement to develop an effective encryption model. This article proposes a novel image encryption model using multi‐chaotic maps and blockchain (MCBE). Chaotic maps have been used in encryption models as chaotic maps have the properties of randomness, and non‐periodicity that get utilized in improving the efficiency of an encryption model. Logistic and tent maps have been employed as multi‐chaotic maps to make the encryption process effective in this work. A logistic map has a simple structure and is easily implementable but has some drawbacks like small keyspace. Keyspace and randomness are enhanced by using a tent map along with a logistic map. The proposed MCBE methodology applies to grayscale or colored images having different file formats and sizes. Initially, in the confusion phase, the permutation of the original image is performed based on a random permutation that changes the original image pixel's position. The encryption model applies multi‐chaotic maps, row‐wise and column‐wise in the diffusion phase to promote the efficiency of the encryption model. Finally, blockchain has been implemented using the SHA‐256 hash function to obtain the encrypted image that enhances the security by increasing the keyspace, to resist brute force attacks. The evaluation performance of the MCBE has been analyzed against various attacks namely statistical attacks, differential attacks, NIST randomness test, noise, and cropping attacks. The evaluated keyspace is which has high key sensitivity with a correlation of encrypted images close to 0. Maximum achieved entropy value of 7.9998, SSIM value between original and encrypted images nearby 0 confirms the dissimilarity. The Number of Pixels Change Rate (NPCR) value of 99.62%, and the value of Unified Average Changed Intensity (UACI) value of 33.54% are within the specified standard range. The calculated correlation coefficient, NPCR, and UACI values have been compared with the existing algorithms, and the results show that the proposed MCBE methodology has better performance than the other state‐of‐the‐art methods. The experimental results indicate that the chaotic ranges generated by multi‐chaotic maps and the SHA‐256 hash function improve the keyspace and security of the encryption model confirming the efficacy of the proposed model MCBE.

show abstract

Section: Resultsmentioning

confidence: 99%

“…The occurrence of this noise is due to sharp and sudden annoyance in images. It appears as a collection of dark and white pixels throughout the image 26 …”

Section: Resultsmentioning

confidence: 99%

Section: Keyspace Analysismentioning

confidence: 99%

Section: Noise Attackmentioning

confidence: 99%

See 2 more Smart Citations

Multi‐chaotic maps and blockchain based image encryption

Kumari,

Singh,

Singh

2024

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Vigenère cypher is an algorithm designed for a long time and is included in the class of classic algorithms because it operates on a character scale instead of bits and a simple encryption and decryption calculation process [1] [2]. Nevertheless, the vigenère cypher can be categorized as a modern cryptographic algorithm if the encryption and decryption process is carried out using the XOR technique to operate on a bit scale [3] [4]. Although simple, this algorithm is quite safe, and because of its simplicity, the Vigenère cypher algorithm is an algorithm that is very light in terms of algorithm complexity, so this algorithm only requires a small number of computer resources and time for the encryption and decryption process [5].…”

Section: Introductionmentioning

confidence: 99%

Improve The Security of The Vigenère Cypher Algorithm by Modifying the Encoding Table and Key

Sidik

2021

ijobas

View full text Add to dashboard Cite

This investigation was conducted to move forward the security of the vigenère cypher calculation by tending to the key conveyance issue and the most key issue within the calculation if cryptoanalysts effectively got it. The working demonstrates employments a 512-bit Electronic Code Book (ECB). The essential key utilized was a 512-bit arbitrary key. The randomized encoding table was also generated by the Blum Blum Shub calculation employing a scrambler key. The RSA calculation was utilized to scramble 512-bits random keys and scrambler keys. It comes about to appear that the proposed calculation does not include a key dissemination issue. With a randomized encoding table, the 512-bits arbitrary key cannot be utilized to unscramble the ciphertext off chance that cryptanalysis did not know the mixed table utilized. The preparing time appeared the proportion of the contrast of the vigenère cypher calculation. The proposed calculation was not as well essentially distinctive, and the longer the message was handled, the proportion of the time distinction possessed was moreover getting closer to one, which implies the distinction was not critical. The coming about ciphertext was too exceptionally secure, where the coming about ciphertext was irregular since the key utilized was random, and there were 3.75 x 10126 keys combination. This algorithm can be an alternative algorithm that is fast, safe, and easy to implement

show abstract