Playfair cipher is a substitution scheme. The classical playfair scheme has a limited matrix size containing only uppercase letters, so it is prone to hackers and cryptanalysis. To increase the resistance of playfair cipher, a new encipherment and decipherment method is proposed in this work, which depends on the permutation and its inverse, respectively. In addition, a modified key matrix is utilized, which includes capital and small Alphabets, numbers, and 38 special characters collected from ASCII codes. In the proposed method, both substitution and transposition schemes are used, where the first stratum of the cipher is a substitution by using key matrix and the second stratum is a transposition by using permutation key which provides multi strata resistance to brute force and other cryptanalysis attacks. A comparison between the traditional playfair scheme and the proposed method demonstrates that the encoded text is hard to recognize by cryptanalysts, which improves the security of the encryption process.
Multi-agent systems are subfield of Artificial Intelligence that has experienced rapid growth because of its flexibility and intelligence in order to solve distributed problems. Multi-agent systems (MAS) have got interest from various researchers in different disciplines for solving sophisticated problems by dividing them into smaller tasks. These tasks can be assigned to agents as autonomous entities with their private database, which act on their environment, perceive, process, retain and recall by using multiple inputs. MAS can be defined as a network of individual agents that share knowledge and communicate with each other in order to solve a problem that is beyond the scope of a single agent. It is imperative to understand the chara
... Show MoreThis paper discusses the limitation of both Sequence Covering Array (SCA) and Covering Array (CA) for testing reactive system when the order of parameter-values is sensitive. In doing so, this paper proposes a new model to take the sequence values into consideration. Accordingly, by superimposing the CA onto SCA yields another type of combinatorial test suite termed Multi-Valued Sequence Covering Array (MVSCA) in a more generalized form. This superimposing is a challenging process due to NP-Hardness for both SCA and CA. Motivated by such a challenge, this paper presents the MVSCA with a working illustrative example to show the similarities and differences among combinatorial testing methods. Consequently, the MVSCA is a
... Show MoreBackground: Gliomas are brain tumours of supporting tissue of the brain. The management of low grade glioma is still a great debate ranges from just follow up to extensive surgery followed by DXT, with or without chemothery.
Patients and Methods: 282 patients taken from neuro-surgical hospital between 1980-1990, divided to 3 groups with different modality of management & follow up for 15 years.
Results: the five years survival and symptomatic improvement was higher in the group managed by extensive surgery and DXT with or without cytoxic drugs followed by group managed by biopsy and DXT with or without cytoxic.
Conclusion: management of low grade glioma symptoms & out come (survival) is best by extensive surgery & DX
Audio security is an important aspect in various areas of communication. This paper deals with audio encryption as many of the data communication depends on audio data. In this paper, a new proposal of audio encryption system has been introduced. The system can be divided into two phases, the first phase focuses on generating a high-quality Pseudo Random Number generator (PRNGs) using elementary, periodic and hybrid rules of cellular automata (CA). The system suggests a new combination of CA rules in an endeavor to provide high randomness and to improve the strength of the proposed cryptosystem. Whereas the second phase produces the Enhanced Rivest Cipher 5 (ERC5) algorithm which employs the generated Random Number Sequence (RNS) i
... Show MoreCryptography 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
... Show MoreHomomorphic 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
... Show MoreCryptography 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
... Show MoreIn the present study, multi-walled carbon nanotubes (MWCNTs) with outside diameters of< 8 nm and 20−30 nm were covalently functionalized with β-Alanine using a novel synthesis procedure. The functionalization process was proved successful using Raman spectroscopy, FTIR, and TEM. Utilizing the two-step method with ultrasonication, the MWCNTs treated with β-Alanine (Ala-MWCNTs) with weight concentrations of 0.025%, 0.05%, 0.075%, and 0.1% were dispersed in distilled water to prepare water-based nanofluids. The aqueous colloidal dispersions of pristine MWCNTs were unstable. While for Ala-MWCNTs and after> 50 days from preparation, higher colloidal stability was obtained up to relative concentration of 0.955 and 0.939 for the 0.075-wt% samp
... Show MoreThe problem of poverty and deprivation constitute a humanitarian tragedy and its continuation may threaten the political achievements reached by the State. Iraq, in particular, and although he is one of the very rich countries due to availability of huge economic wealth, poverty indicators are still high. In addition, the main factor in the decline in the standard of living due to the weakness of the government's performance in the delivery of public services of water, electricity and sanitation. Thus, the guide for human development has been addressed which express the achievements that the state can be achieved both on a physical level or on the human level, so in order to put appropriate strategies and policies aimed at elimin
... Show MoreIn this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi
... Show More