Multiple rounds using mixed chaotic keys method for secure message cryptography
|
Full Text |
Pdf
|
|
Author |
Nasser Abdellatif, Adnan Manasreh, Mohammad S. Khrisat, Hatim Ghazi Zaini and Ziad A. Alqadi
|
|
e-ISSN |
1819-6608 |
|
On Pages
|
967-982
|
|
Volume No. |
18
|
|
Issue No. |
08
|
|
Issue Date |
June 15, 2023
|
|
DOI |
https://doi.org/10.59018/0423128
|
|
Keywords |
cryptography, P.K., CTK, CLK, I.K., CTMM, CLMM, MSE, PSNR, CC, NSCR.
|
Abstract
Protecting secret messages from being hacked is a vital problem. This research paper will present a simple and flexible data cryptography method. The method can encrypt-decrypt messages of any length. Also, it can be easily used to encrypt-decrypt gray and color images. The proposed method will use a private key, which contains the needed information to generate chaotic keys; these keys will be used to obtain indices keys, which will be used as a lockup table in the encryption and decryption phases. The generated key will be very sensitive to the P.K. contents. The P.K. used in the proposed method will have a complex structure, providing a huge key space that can resist attacks. The proposed method will be implemented using various messages, the obtained results will be analyzed, and several test analysis methods will be used to prove the achievements of the proposed method. The quality analysis will use the calculated values of MSE, PSNR, CC, and NSCR to prove the quality of the proposed method in both the encryption and decryption phases. A sensitivity analysis will be performed to show how the encryption and decryption phase is sensitive to the selected P.K.; any changes in the P.K. during the decryption phase will be considered a hacking attempt by producing a damaged decrypted message. A speed analysis will be provided to prove that the proposed method is efficient, and the obtained results will be compared with other methods' results to show the speedup provided by the proposed method.
Back