Forecasting the influence of the guided flame on the combustibility of timber species using artificial intelligence

Data steganography is one of the most popular methods of data protection, but most introduced methods are not secure. In this paper research a simplified LSB method of data steganography will produced, this method will easily used to hide any message in any covering image, changing the image or/and changing the message will not require any changes in the algorithm. The proposed method will use a complicated key to select a secret block from the covering image to be used to hide the message. The PK will contain 5 components of double data type, thus the PK will provide a huge key space which is capable to resist any hacking attempt, the algorithm of the proposed method will be very sensitive to the PK values, any changes in these values will be considered as a hacking attempt by producing unexpected outputs. The proposed method will be implemented and tested using various messages, various covering images, and various PK; the obtained results will be analyzed applying sensitivity analysis, quality analysis and security analysis to prove the improvements added to LSB method of data steganography.

Section: Figure 3: Lsm Sm Hidingmentioning

confidence: 99%

“…-Digital image usually has a huge capable to hold short and long secret messages [40][41][42][43][44].…”

Section: Introductionmentioning

confidence: 99%

Using Secret Image Block to Secure LSB Data Steganography

Alqadi¹

2022

“…Messages may be private or secret, thus they require a high level of protection when using unsecure communication environment [22][23][24][25][26]. One of the most popular techniques to protect the secret messages is data cryptography, which means encrypting the message before sending it and decrypting the message after receiving it.…”

Section: Introductionmentioning

confidence: 99%

Improving Standard Methods of Message Cryptography

Alqadi¹

2022

Protecting secret messages from being hacked is a vital issue. In this paper research some standard symmetric and asymmetric methods of data cryptography will be studied and a comparative analysis of these methods will be provided. A simple, highly secure and efficient method of secret messages cryptography will be introduced; the method will use a character private key with variable length. Increasing the PK length will increase the key space making the method capable to resist any attack, the produced decrypted message will be very sensitive to the PK, any changes in the PK during the decryption phase will be considered as a hacking attempt by producing a damaged decrypted message. The proposed method will be implemented using various messages; the obtained results will be analyzed to prove the quality, security and efficiency achievements provided by the proposed method.

“…For example, the server can store your message history, connect additional conversation participants via alternate channels (such as joining a video conference call), use automatic moderation, and so on [35][36][37][38][39][40]. Messages may be private or secret, thus they require a high level of protection when using unsecure communication environment [22][23][24][25][26]. One of the most popular techniques to protect the secret messages is data cryptography, which means encrypting the message before sending it and decrypting the message after receiving it.…”

Section: Introductionmentioning

confidence: 99%

Secure Method to Protect Secret Short Messages using Rearrangement Key

Zneit¹,

Alqadi²

2022

An efficient, highly secure and simple method of short messages cryptography method will be introduced. The method will use a rearrangement key to encrypt-decrypt SMs, the key will be generated by running a chaotic logistic map model with a selected parameter, these parameters will form the private secret key which is known by the data sender and the data receiver. The private key will provide the necessary key space to resist hacking attacks. The SM up to I K bytes will be encrypted-decrypted using RK, if the message size is greater than 1 K bytes, the message will be divided into blocks of 1 K bytes’ length, and each block can be encrypted-decrypted using its own RK. The method will be simple and easy to implement, and it can suit any message with any length, the process of encryption is based on putting the character from the SM in its position maintained in the RK, the decryption will be implemented by recovering the characters from the decrypted SM by the indexes in the RK from the index 1 to the index L (L: is the message length). The proposed method will be implemented using various SMs, the results will be analyzed. Based on the obtained values of MSE, PSNR, CC and NSCR it will be proved that the proposed method satisfies the quality requirements in the encryption and decryption phases. The speed of the proposed method will be tested and the obtained results will be compared with other methods speed to show the improvements provided by the proposed method.