Wireless sensor network (WSN) security is an important component for protecting data from an attacker. For improving security, cryptography technologies are divided into two kinds: symmetric and asymmetric. Therefore, the implementation of protocols for generating a secret key takes a long time in comparison to the sensor’s limitations, which decrease network throughput because they are based on an asymmetric method. The asymmetric algorithms are complex and decrease network throughput. In this paper, an encryption symmetric secret key in wireless sensor networks (WSN) is proposed. In this work, 24 experiments are proposed, which are encryption using the AES algorithm in the cases of 1 key, 10 keys, 25 keys, and 50 keys. In each experiment, two chains are combined by using a hash function (SHA-2) to produce secret keys. The Network Simulator Version 2 (NS2) was used to assess the network throughput for the generated key. The randomness of the suggested LWM method has been tested by using the Diehard statistical test and the Entropy test. The results of the tests show that the encryption secret keys have a high level of data randomness.
Today the Genetic Algorithm (GA) tops all the standard algorithms in solving complex nonlinear equations based on the laws of nature. However, permute convergence is considered one of the most significant drawbacks of GA, which is known as increasing the number of iterations needed to achieve a global optimum. To address this shortcoming, this paper proposes a new GA based on chaotic systems. In GA processes, we use the logistic map and the Linear Feedback Shift Register (LFSR) to generate chaotic values to use instead of each step requiring random values. The Chaos Genetic Algorithm (CGA) avoids local convergence more frequently than the traditional GA due to its diversity. The concept is using chaotic sequences with LFSR to gene
... Show MoreThis paper deals with proposing new lifting scheme (HYBRID Algorithm) that is capable of preventing images and documents which are fraud through decomposing there in to the real colors value arrays (red, blue and green) to create retrieval keys for its properties and store it in the database and then check the document originality by retrieve the query image or document through the decomposition described above and compare the predicted color values (retrieval keys) of the query document with those stored in the database. The proposed algorithm has been developed from the two known lifting schemes (Haar and D4) by merging them to find out HYBRID lifting scheme. The validity and accuracy of the proposed algorithm have been ev
... Show MoreData security is a fundamental parameter on communication system development. The capability of protecting and securing the information is a great essence for the growth of the data security and electronic commerce. The cryptography has a significant influence upon information security systems against the variety of the attacks, in which higher complexity in secret keys results in the increase of security and the cryptography algorithms’ complexity. The sufficient and newer cryptographic methods’ versions may helpful in the reduction of the security attacks. The main aim of this research is satisfying the purpose of the information security through the addition of a new security level to the Advanced Encryption Standard (AES) algorithm
... Show MoreEncryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and
... Show MoreThe modern systems that have been based upon the hash function are more suitable compared to the conventional systems; however, the complicated algorithms for the generation of the invertible functions have a high level of time consumption. With the use of the GAs, the key strength is enhanced, which results in ultimately making the entire algorithm sufficient. Initially, the process of the key generation is performed by using the results of n-queen problem that is solved by the genetic algorithm, with the use of a random number generator and through the application of the GA operations. Ultimately, the encryption of the data is performed with the use of the Modified Reverse Encryption Algorithm (MREA). It was noticed that the
... Show MoreThe Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods depended on selecting the primes p and q in order to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article gives new construction of the RSA algorithm and DH key exchange using the
primes p,qfrom areal number x.
Computer software is frequently used for medical decision support systems in different areas. Magnetic Resonance Images (MRI) are widely used images for brain classification issue. This paper presents an improved method for brain classification of MRI images. The proposed method contains three phases, which are, feature extraction, dimensionality reduction, and an improved classification technique. In the first phase, the features of MRI images are obtained by discrete wavelet transform (DWT). In the second phase, the features of MRI images have been reduced, using principal component analysis (PCA). In the last (third) stage, an improved classifier is developed. In the proposed classifier, Dragonfly algorithm is used instead
... Show MoreA model using the artificial neural networks and genetic algorithm technique is developed for obtaining optimum dimensions of the foundation length and protections of small hydraulic structures. The procedure involves optimizing an objective function comprising a weighted summation of the state variables. The decision variables considered in the optimization are the upstream and downstream cutoffs lengths and their angles of inclination, the foundation length, and the length of the downstream soil protection. These were obtained for a given maximum difference in head, depth of impervious layer and degree of anisotropy. The optimization carried out is subjected to constraints that ensure a safe structure aga
... Show MoreSteganography is the art of concealing security data in media, such as pictures, audio, video, text, and protocols. The objective of this paper is hiding a secret message in a colour image to prevent an attacker from accessing the message. This is important because more people use the Internet all the time and network connections are spread around the world. The hidden secret message uses two general algorithms that are embedded and extracted. This paper proposes a new algorithm to conceal a secret message in a colour image in LSB. This algorithm includes three phases: 1) dividing the colour image into a number of blocks, 2) concealing the secret message, and 3) transmitting the stego-image from the sender in a multiplexer network and re
... Show MoreCredit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show More