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 work aims to introduce and to study a new kind of divisor graph which is called idempotent divisor graph, and it is denoted by . Two non-zero distinct vertices v1 and v2 are adjacent if and only if , for some non-unit idempotent element . We establish some fundamental properties of , as well as it’s connection with . We also study planarity of this graph.
(3)
(2)
In this paper, we introduce the concept of Jordan –algebra, special Jordan –algebra and triple –homomorphisms. We also introduce Bi - –derivations and Annihilator of Jordan algebra. Finally, we study the triple –homomorphisms and Bi - –derivations on Jordan algebra.
(1)
This paper concerns with the state and proof the existence and uniqueness theorem of triple state vector solution (TSVS) for the triple nonlinear parabolic partial differential equations (TNPPDEs) ,and triple state vector equations (TSVEs), under suitable assumptions. when the continuous classical triple control vector (CCTCV) is given by using the method of Galerkin (MGA). The existence theorem of a continuous classical optimal triple control vector (CCTOCV) for the continuous classical optimal control governing by the TNPPDEs under suitable conditions is proved.
(1)
Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing
... Show MoreThe paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w
... Show More
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.
(13)