الفهرس 
ch 1 IntroductionOnly 14 pages are availabe for public view
 |  | from | 134 |  |  |
| | | from | 134 | | |
Abstract
Encryption alters data. Literature has increasingly used to image encryption. Digital image encryption uses chaos-based methods due to increased data capacity and pixel correlation. Multimedia message storage and interchanged have expanded as more people use mobile phones and personal digital assistants. Chained al. chaotic system uses several pathways to safeguard data quickly. Encryption reduces computing complexity, simplifying the operation. This thesis introduces chaotic image encryption. Merging chaotic maps (e.g., Logistic, Tent, Quadratic, Cubic, and Bernoulli maps) to produce more robust chaotic maps increases security and privacy by applying variable keys. Proposed chaotic maps use sine square logistic maps. Tested each chaotic map’s encryption period. In this thesis, merged chaotic maps to create a new map. Wanted a way to choose the best chaotic encryption map based on lowest correlation. thought a low correlation value indicated good encryption. Because some photographs are affected by one map but not others. Performance research on grey photos showed that the suggested image encryption and decoding method was resilient. S-boxes with Arnold Transform, circular mapping, and proposed approaches were compared. Proposed pipeline wins. has been found high information entropy, low correlation coefficients, and strong security in the suggested approach. Different chaotic map main equation results. MATLAB correlation results between plaintext and ciphertext images were compared using correlation coefficient, MSE, entropy, PSNR, and histogram.