Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using six S-Boxes, as in the traditional method. Moreover, the CAST encryption algorithm was modified to be used on the private keys and substitution stage (S-Boxes), with the keys and S-Boxes of the encryption algorithm being generated according to the 2D and 3D chaotic map functions. The proposed system passed all evaluation criteria, including (MSE, PSNR, EQ, MD, SC, NC, AD, SNR, SIM, MAE, Time, CC, Entropy, and histograms). Results: Moreover, the results also illustrate that the created S-Boxes passed all evaluation criteria; compared with the results of the traditional method that was used in creating S-Box, the proposed method achieved better results than other methods used in the other works. The proposed solution improves the entropy which is between (7.991–7.999), reduces the processing time which is between (0.5–11 s/Images), and improves NCPR, which is between (0.991–1). Conclusions: The proposed solution focuses on reducing the total processing time for encryption and decryption and improving transmission security. Finally, this solution provides a fast security system for surgical telepresence with secure real-time communication. The complexity of this work needs to know the S-Box creation method used, the chaotic method, the values of the chaotic parameters, and which of these methods was used in the encryption process.
The compound 2,2'-(((1H-benzo(d)imidazol-2-yl)methyl)azanediyl)bis(ethan-1-ol) was reacted with benzyl bromide to afford compound (1) which used as row material to prepare a series of compounds through condensation reaction, the starting compound were reacted with tosyl chloride to protect the OH group to afford compound 2, then reacted benzyl bromide to produce compound (2), then the compound (2) treated with three compounds ( 2-mercaptobenzthiazole, 2-mercaptobenimidazol and 2-chloromethyl benzimidazole) to form compounds 3a,b, 4a,b and 5a,b respectively. In the another step the click reaction of compound 2,2'-(((1H-benzo(d)imidazol-2-yl)methyl)azanediyl)bis(ethan-1-ol) with Propargyl bromide produce compound 6 which reacted
... Show MoreThis paper has investigated experimentally the dynamic buckling behavior of AISI 303 stainless steel Aluminized and as received long columns. These columns, hot-dip aluminized and as received, are tested under dynamic buckling, 22 specimens, without aluminizing (type 1), and 50 specimens, with hot-dip aluminizing at different aluminizing conditions of dipping temperature and dipping time (type 2), are tested under dynamic compression loading and under dynamic combined loading (compression and bending) by using a rotating buckling test machine. The experimental results are compared with Perry Robertson interaction formula that used for long columns. Greenhill formula is used to get a mathematical model that descripts the buckling behavior
... Show MoreThe problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
The paper presents a highly accurate power flow solution, reducing the possibility of ending at local minima, by using Real-Coded Genetic Algorithm (RCGA) with system reduction and restoration. The proposed method (RCGA) is modified to reduce the total computing time by reducing the system in size to that of the generator buses, which, for any realistic system, will be smaller in number, and the load buses are eliminated. Then solving the power flow problem for the generator buses only by real-coded GA to calculate the voltage phase angles, whereas the voltage magnitudes are specified resulted in reduced computation time for the solution. Then the system is restored by calculating the voltages of the load buses in terms
... Show MoreThe aim of this research is to construct a cognitive behavior program based on the theory of Meichenbaum in reducing the emotional sensitivity among Intermediate school students. To achieve the aims of the research, two hypotheses were formulated and the experimental design with equal groups was chosen. The population of research and its sample are determined. The test of negative emotional sensitivity, which is constructed by the researcher, was adopted. The test contains (20) items proved validity and reliability as a reliable test by presenting it to a group of arbitrators and experts in education and psychology. An educational program is constructed based on the theory of Meichenbaum. The test was applied to a sample of (60) second i
... Show MoreThe present work aims to study the effect of using an automatic thresholding technique to convert the features edges of the images to binary images in order to split the object from its background, where the features edges of the sampled images obtained from first-order edge detection operators (Roberts, Prewitt and Sobel) and second-order edge detection operators (Laplacian operators). The optimum automatic threshold are calculated using fast Otsu method. The study is applied on a personal image (Roben) and a satellite image to study the compatibility of this procedure with two different kinds of images. The obtained results are discussed.