Obesity is an increasing health problem in developing countries and has grown into a major global epidemic. Recent studies suggest that colonization of the stomach with Helicobacter pylori (H. pylori) may affect gastric expression of appetite and satiety-related hormones, finding that patients cured of H. pylori infection have gained weight. Further exploration of the relationship between obesity and H. pylori infection is therefore warranted. The objective of this study was to determine the prevalence of H. pylori infection in a sample of obese patients. A total of 69 obese females and 55 normal-weight females as a control group were included. Body mass indices (BMI) of all females were measured and tests for H. pylori performed. Subjects ranged in age from 20 to 59 years. The threshold for classification of obesity was a BMI of 30 kg/m² or higher. Fifty obese females (72.5%) were H. pylori positive. Thirty-two (58.2%) normal-weight females were seropositive for H. pylori, which was not significant (p > 0.05) when compared with obese group. All the obese above 45 years of age were found to be H. pylori positive. The study showed that there was no significant relation between H. pylori infection and obesity. Rather, the prevalence of H. pylori infection increases with age.
Rivest Cipher 4 (RC4) is an efficient stream cipher that is commonly used in internet protocols. However, there are several flaws in the key scheduling algorithm (KSA) of RC4. The contribution of this paper is to overcome some of these weaknesses by proposing a new version of KSA coined as modified KSA . In the initial state of the array is suggested to contain random values instead of the identity permutation. Moreover, the permutation of the array is modified to depend on the key value itself. The proposed performance is assessed in terms of cipher secrecy, randomness test and time under a set of experiments with variable key size and different plaintext size. The results show that the RC4 with improves the randomness and secrecy with
... Show MoreThere are large numbers of weakness in the generated keys of security algorithms. This paper includes a new algorithm to generate key of 5120 bits for a new proposed cryptography algorithm for 10 rounds that combine neural networks and chaos theory (1D logistic map). Two methods of neural networks (NN) are employed as Adaline and Hopfield and the results are combined through several sequential operation. Carefully integrating high quality random number generators from neural networks and chaos theory to obtain suitable key for randomness and complexity.
Many cryptosystems and security techniques use substitution boxes to ensure the data’s secure communication. A new technique is presented for generating a robust S-box to fulfill security requirements. The AES algorithm represents a block cipher cryptographic algorithm. It was selected by the National Institute of Science and Technology as the optimal cryptographic algorithm in 2011. Through the study of the properties of original S-BOX, this algorithm has been subjected to a number of attacks (linear, differential, statistical, and interpolation), and original S-BOX has been static, which makes the attack strong and shows a weakness in the algorithm. It is necessary to make this algorithm more efficient and powerful through
... Show MoreThe context of multibiometric plays a pivotal role in enhancing an identification system, since a biometric system is now the most physical way of identifying and verifying individuals. The feature of multibiometric could be merged to produce identification information. However, unimodal biometric systems suffer from different types of breaching. Thus, mixing biometrics with cryptography leads to overcome small variations existing between diverse acquisitions of the same biometric in order to produce the robust system. In this paper, a new robust multibiometric system is proposed to create a random key from person multibiometric, facial and fingerprint images which are used simultaneously to produce this key. Several man
... Show MoreThe aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key
... Show MoreAs a new technology, blockchain provides the necessary capabilities to assure data integrity and data security through encryption. Mostly, all existing algorithms that provide security rely on the process of discovering a suitable key. Hence, key generation is considered the core of powerful encryption. This paper uses Zernike moment and Mersenne prime numbers to generate strong prime numbers by extracting the features from biometrics (speech). This proposed system sends these unique and strong prime numbers to the RSA algorithm to generate the keys. These keys represent a public address and a private key in a cryptocurrency wallet that is used to encrypt transactions. The benefit of this work is that it provides a high degree
... Show MoreIt is known that images differ from texts in many aspects, such as high repetition and correlation, local structure, capacitance characteristics and frequency. As a result, traditional encryption methods can not be applied to images. In this paper we present a method for designing a simple and efficient messy system using a difference in the output sequence. To meet the requirements of image encryption, we create a new coding system for linear and nonlinear structures based on the generation of a new key based on chaotic maps.
The design uses a kind of chaotic maps including the Chebyshev 1D map, depending on the parameters, for a good random appearance. The output is a test in several measurements, including the complexity of th
... Show MoreIn this paper, three main generators are discussed: Linear generator, Geffe generator and Bruer generator. The Geffe and Bruer generators are improved and then calculate the Autocorrelation postulate of randomness test for each generator and compare the obtained result. These properties can be measured deterministically and then compared to statistical expectations using a chi-square test.
This study seeks to identify the possibility of achieving the property of faithful representation of accounting information and measure it by using the standard approach based on mathematical and statistical equations by comparing two financial periods before and after the application of (IFRS-15) Revenue from contracts with customers, during the period. (2014-2018), for the financial statements of the mixed joint stock companies listed on the Iraq Stock Exchange, which is one of the main pillars of the economic structure of the country, as a joint investment between the state and the private sector, and has importance in many aspects, including support for projects of public companies, S Absorption and employment of labor, as well as ra
... Show MoreLegislative language is characterized by its complexity, specifically in the process of translating statutory terms from two quite different languages, and from totally two different legal systems as from Spanish into Arabic. The present study stresses the process of translating legislative terms used in Spanish wills into Arabic through high lightening the polysemy of such mentioned terms and explaining their use in other legislative grounds. Additionally, the present study elucidates, analyzes, underlines the difficulty and looks for the most appropriate procedures and techniques of translating some of the prominent inheritance expressions taking in account the legislative dif
... Show More