Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of security to Triple Data Encryption Standard algorithm using Nth Degree Truncated Polynomial Ring Unit algorithm. This aim achieved by adding two new key functions, the first one is Enckey(), and the second one is Deckey() for encryption and decryption key of Triple Data Encryption Standard to make this algorithm more stronger. The obtained results of this paper also have good resistance against brute-force attack which makes the system more effective by applying Nth Degree Truncated Polynomial Ring Unit algorithm to encrypt and decrypt key of Triple Data Encryption Standard. Also, these modifications enhance the degree of complexity, increase key search space, and make the ciphered message difficult to be cracked by the attacker.
This work involves synthesis of amides containing isoxazoline unit starting with
chalcone; 4-[3-(3‾-nitrophenyl)-2-propene- 1-one]-aniline[I]. 4-Aminoacetophenone was
reacted with 3-nitrobenzaldehyde in basic medium giving chalcone [I] by claisen-schemidt
reaction. The chalcone [I] was reacted with hydroxylamine hydrochloride giving isoxazoline
[II] in NaOH basic medium. The amides with structural formula [III]a-h were prepared by the
reaction of amino compounds ; isoxazoline [II] with different acid chlorides in dry pyridine
and using DMF as a solvent at 4
0
C. All the synthesized compounds have been characterized
by melting points , FTIR and
1
HMNR (of compound [III]a) spectroscopy.
This paper introduces the concept of fuzzy σ-ring as a generalization of fuzzy σ-algebra and basic properties; examples of this concept have been given. As the first result, it has been proved that every σ-algebra over a fuzzy set x* is a fuzzy σ-ring-over a fuzzy set x* and construct their converse by example. Furthermore, the fuzzy ring concept has been studied to generalize fuzzy algebra and its relation. Investigating that the concept of fuzzy σ-Ring is a stronger form of a fuzzy ring that is every fuzzy σ-Ring over a fuzzy set x* is a fuzzy ring over a fuzzy set x* and construct their converse by example. In addition, the idea of the smallest, as an important property in the study of real analysis, is studied
... Show More
(2)
(52)
(54)
conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
(1)
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a
... Show More
(3)