Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security. We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly. We make an effort to prove the security of the scheme under indistinguishability under chosen-plaintext attack (IND-CPA) through a game-based security proof. The security proof gives a mathematical analysis and its complexity of hardness. Also, it presents security analysis against all the known attacks with respect to the message expansion and homomorphic operations.
The aim of the current research is to reveal the effect of using brain-based learning theory strategies on the achievement of Art Education students in the subject of Teaching Methods. The experimental design with two equal experimental and control groups was used. The experimental design with two independent and equal groups was used, and the total of the research sample was (60) male and female students, (30) male and female students represented the experimental group, and (30) male and female students represented the control group. The researcher prepared the research tool represented by the cognitive achievement test consisting of (20) questions, and it was characterized by honesty and reliability, and the experiment lasted (6) weeks
... Show MoreAs s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res
... Show MoreLe mot anglais code switching ou l’équivalent français alternance codique est un terme très utilisé dans des recherches qui traitent des problèmes en sociolinguistique. Le bilingue dispose, dans son répertoire linguistique, de moyens de communication qui lui permettent d’adapter son langage à des situations de communication plus variées que ceux du monolingue. Le code-switching ou l’alternance codique qui est un lieu de structuration de stratégies de communication en est un moyen indispensable.
L’alternance codique dans la conversation est l’utilisation d’un mot ou plus appartenant à une langue B à l’intérieur d’une phrase qui appartient à une langue A. Dans la plupart des cas, le locuteur se sert de l’a
This paper deals with defining Burr-XII, and how to obtain its p.d.f., and CDF, since this distribution is one of failure distribution which is compound distribution from two failure models which are Gamma model and weibull model. Some equipment may have many important parts and the probability distributions representing which may be of different types, so found that Burr by its different compound formulas is the best model to be studied, and estimated its parameter to compute the mean time to failure rate. Here Burr-XII rather than other models is consider because it is used to model a wide variety of phenomena including crop prices, household income, option market price distributions, risk and travel time. It has two shape-parame
... Show MoreA mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc
... Show MoreIn this work, an estimation of the key rate of measurement-device-independent quantum key distribution (MDI-QKD) protocol in free space was performed. The examined free space links included satellite-earth downlink, uplink and intersatellite link. Various attenuation effects were considered such as diffraction, atmosphere, turbulence and the efficiency of the detection system. Two cases were tested: asymptotic case with infinite number of decoy states and one-decoy state case. The estimated key rate showed the possibility of applying MDI-QKD in earth-satellite and intersatellite links, offering longer single link distance to be covered.
Several previous investigations and studies utilized silica fume (SF) or (micro silica) particles as supplementary cementitious material added as a substitute to cement-based mortars and their effect on the overall properties, especially on physical properties, strength properties, and mechanical properties. This study investigated the impact of the inclusion of silica fume (SF) particles on the residual compressive strengths and microstructure properties of cement-based mortars exposed to severe conditions of elevated temperatures. The prepared specimens were tested and subjected to 25, 250, 450, 600, and 900 °C. Their residual compressive strengths and microstructure were evaluated and compared with control samples (C
... Show MoreSeveral methods have been developed for routing problem in MANETs wireless network, because it considered very important problem in this network ,we suggested proposed method based on modified radial basis function networks RBFN and Kmean++ algorithm. The modification in RBFN for routing operation in order to find the optimal path between source and destination in MANETs clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. The re
... Show Moresignificant bits either in the spatial domain or frequency domain sequentially or pseudo
randomly through the cover media (Based on this fact) statistical Steganalysis use different
techniques to detect the hidden message, A proposed method is suggested of a stenographic
scheme a hidden message is embedded through the second least significant bits in the
frequency domain of the cover media to avoid detection of the hidden message through the
known statistical Steganalysis techniques.