The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key generations. This means the key generation system generates two keys: one is simple, and the other one is encrypted by using an improved Caesar algorithm. The encryption algorithm in the first 8 round uses simple key 1, and from round 9 to round 16, the algorithm uses encrypted key 2. Using the improved structure of the Data Encryption Standard algorithm, the results of this paper increase Data Encryption Standard encryption security, performance, and complexity of search compared with standard Data Encryption Standard. This means the Differential cryptanalysis cannot be performed on the cipher-text.
Twitter data analysis is an emerging field of research that utilizes data collected from Twitter to address many issues such as disaster response, sentiment analysis, and demographic studies. The success of data analysis relies on collecting accurate and representative data of the studied group or phenomena to get the best results. Various twitter analysis applications rely on collecting the locations of the users sending the tweets, but this information is not always available. There are several attempts at estimating location based aspects of a tweet. However, there is a lack of attempts on investigating the data collection methods that are focused on location. In this paper, we investigate the two methods for obtaining location-based dat
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreThe PET scans provide images that pinpoint the anatomic location of abnormal metabolic activity within the body. A radionuclide suitable for labeling a wide range of radiopharmaceuticals for positron emission tomography imaging is used also for local therapy of tumors. Among the possible methods for cyclotron production of radionuclide used in PET. We investigate the proton irradiation to produce the standard radionuclide (15O, 11C,1 3N, 18F) and some non-standard Radionuclide (76Br,124I,60Cu,66Ga,86Y and 89Zr). The total integral yield based on the main published and approved experimental results of excitation functions were calculated.
Ensuring security, integrity, and reliability of the election process consider as the main challenges in the electronic voting system. This paper describes the e-voting system by integrating the biometric authentication, advanced encryption, and watermarking techniques towards meeting such challenges. The system employs the fingerprint authentication by utilizing the Scale-Invariant Feature Transform (SIFT) for verifying the identity of the voter to ensure genuineness and non-repudiation of the service. The vote will be encrypted with the AES-GCM technique to be employed in securing the voting process, thus ensuring both data privacy and integrity. Hybrid Blind Watermarking employs the technique of Discrete Wavelet Transform (DWT) a
... Show MoreProtecting information sent through insecure internet channels is a significant challenge facing researchers. In this paper, we present a novel method for image data encryption that combines chaotic maps with linear feedback shift registers in two stages. In the first stage, the image is divided into two parts. Then, the locations of the pixels of each part are redistributed through the random numbers key, which is generated using linear feedback shift registers. The second stage includes segmenting the image into the three primary colors red, green, and blue (RGB); then, the data for each color is encrypted through one of three keys that are generated using three-dimensional chaotic maps. Many statistical tests (entropy, peak signa
... Show MoreThe problem of the research lies in the lack of standard levels for modern administration as a guide for evaluating weaknesses and strengths as well as finding solutions. The aim of the research lies in identifying standard levels for modern administration in Iraqi central Olympic committee and international federations. The subjects were (24) Olympic committee' federations. All procedures were standardized to fit our modern administration work. The data was collected and treated using proper statistical operations. The researcher concluded standard levels for modern administration in international federation of the Iraqi Olympic committee, in addition to that he concluded that most administrations levels ranged within four levels (good, fa
... 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