Novel method for image security system based on improved SCAN method and pixel rotation technique

Mahmood, Ali Shakir; Rahim, Mohd Shafry Mohd

doi:10.1016/j.jisa.2018.08.001

Cited by 7 publications

(9 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Entropy is the rate at which information is produced by a stochastic source of data. To build a perfect encryption system, the entropy of enciphered data of a table approaches the optimal state is required, and can be calculated according to the equation [13,15,16]: -…”

Section: Information Entropy Analysismentioning

confidence: 99%

“…It is a try to get the decryption key using a simple variation in the input. Here, the large enough output variation, the more difficult for an attacker to find the decryption key [13][14][15]. A reliable cipher system must distribute the effect of The differential attack is analyzed by calculating the sum of the absolute difference (SAD) between each pair of encrypted databases.…”

Section: Differential Attack Analysismentioning

confidence: 99%

See 1 more Smart Citation

A Chaos-Based Encryption Algorithm for Database System

Albahrani

Lafta²,

Ghayad³

2023

JCSANDM

View full text Add to dashboard Cite

This paper introduces a new Database Transposition, Substitution and XORing Algorithm (DTSXA) based on using chaotic maps. It is based primarily on two well-known security properties: confusion and diffusion. A random number generator was depended on to produce the keys for the algorithm of encryption and decryption. The encryption of the Arabic language in addition to the English language was done, besides it can encrypt a table, individual row and individual column. The suggested algorithm was obeyed and analyzed by different tests involving brute force attack analyses, statistical attack analyses (security analysis histogram, correlation coefficient analysis and information entropy analysis), key sensitivity analysis, differential attack analysis, and mean square error analysis. This algorithm passed all the applied analyses well-deservedly, which indicates that the presented encryption algorithm has a high security level due to its large key space and high sensitivity to the change in the cipher keys.

show abstract

Section: Information Entropy Analysismentioning

confidence: 99%

Section: Differential Attack Analysismentioning

confidence: 99%

A Chaos-Based Encryption Algorithm for Database System

Albahrani

Lafta²,

Ghayad³

2023

JCSANDM

View full text Add to dashboard Cite

show abstract

“…4, confirmed that the presented method achieved an efficient result after encryption. In addition to the visual result, the distribution of pixels can be justified by a quantitative measure known as chi-square, defined by the following mathematical formula [41].…”

Section: Histogram Testmentioning

confidence: 99%

Image Cryptosystem for IoT Devices Using 2-D Zaslavsky Chaotic Map

2022

IJIES

View full text Add to dashboard Cite

Recently, the proliferation of the Internet of Things (IoT) services and applications has prompted several governments to deploy many cameras in critical sites, such as embassies, military institutions, and ministries. The images must be encrypted to protect data shared between IoT sensors/devices and embedded subsystems. Often, IoT devices are smaller and less powerful. A lot of traditional encryption methods are computationally inefficient. They require many rounds of coding, which takes up much space on a device. Despite this, this paper has developed a lightweight encryption algorithm based on chaos theory suitable for IoT devices with limited processing power. The confusion-diffusion structure is often divided into two independent components in chaotic image cryptosystems. However, it reduces the security of the cryptosystem since the independent design may be subjected to cryptanalysis individually. This paper presents an efficient chaotic image encryption algorithm based on a plaintext-associated approach. It incorporates confusion-diffusion operation to increase encryption reliability. The Zaslavsky map initial values are determined by the values and locations of an input image and random values to resist chosen-plaintext cryptanalysis. Furthermore, the proposed method uses a simultaneous confusion-diffusion process to resist any separate attack. The simulation and experimental analysis demonstrate that the proposed encryption algorithm has 0.3927 seconds as a fast encryption time. Moreover, it provides a high performance compared to several other chaotic-based image cryptosystems. as measured by the histogram, entropy (7.99723), pixel change rate (99.7194), unified average changing intensity (33.4635) within the critical interval, pixel correlation, global and local entropy, CDR (ciphertext difference rate), and gray difference degree (GDD). It also has higher security than other chaoticbased image cryptosystems.

show abstract

“…It has been efficiently and largely exploited by many research studies from different fields. As for example, Digital Image Processing (DIP) has been used to carry out a real-time response for security purposes due to its images high resolution(s) by exploiting pixel intensities and variations for a varied diversity of purposes some of which are extensively and technically described and reviewed in [1][2][3][4][5][6][7][8][9][10][11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

Pixel Intensity-Based Contrast Algorithm (PICA) for Image Edges Extraction (IEE)

et al. 2020

View full text Add to dashboard Cite

In this paper, images' pixels are exploited to extract objects' edges. This paper has proposed a Pixel Intensity based Contrast Algorithm (PICA) for Image Edges Extraction (IEE). This paper highlights three contributions. Firstly, IEE process is fast and PICA has less computation time when processing different images' sizes. Secondly, IEE is simple and uses a 2×4 mask which is different from other masks where it doesn't require while-loop(s) during processing images. Instead, it has adopted an if-conditional procedure to reduce the code complexity and enhance computation time. That is, the reason why this design is faster than other designs and how it contributes to IEE will be explained. Thirdly, design and codes of IEE and its mask are available, made an open source, and in-detail presented and supported by an interactive file; it is simulated in a video motion design. One of the PICA's features and contributions is that PICA has adopted to use less while-loop(s) than traditional methods and that has contributed to the computation time and code complexity. Experiments have tested 526 samples with different images' conditions e.g., inclined, blurry, and complexbackground images to evaluate PICA's performance in terms of computation time, enhancement rate for processing a single image, accuracy, and code complexity.By comparing PICA to other research works, PICA consumes 5.7 mS to process a single image which is faster and has less code complexity by u×u. Results have shown that PICA can accurately detect edges under different images' conditions. Results have shown that PICA has enhanced computation time rate for processing a single image by 92.1% compared to other works. PICA has confirmed it is accurate and robust under different images' conditions. PICA can be used with several types of images e.g., medical images and useful for real-time applications.

show abstract

Novel method for image security system based on improved SCAN method and pixel rotation technique

Cited by 7 publications

References 25 publications

A Chaos-Based Encryption Algorithm for Database System

A Chaos-Based Encryption Algorithm for Database System

Image Cryptosystem for IoT Devices Using 2-D Zaslavsky Chaotic Map

Pixel Intensity-Based Contrast Algorithm (PICA) for Image Edges Extraction (IEE)

Contact Info

Product

Resources

About