Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex

Background: Errors of horizontal condylar inclinations and Bennett angles had largely affected the articulation of teeth and the pathways of cusps. The aim of this study was to estimate and compare between the horizontal condylar (protrusive) angles and Bennett angles of full mouth rehabilitation patients using two different articulator systems. Materials and Methods: Protrusive angles and Bennett angles of 50 adult males and females Iraqi TMD-free full mouth rehabilitation patients were estimated by using two different articulator systems. Arbitrary hinge axis location followed by protrusive angles and Bennett angles, estimation was done by a semiadjustable articulator system. A fully adjustable articulator system was utilized to locate th

The power generation of solar photovoltaic (PV) technology is being implemented in every nation worldwide due to its environmentally clean characteristics. Therefore, PV technology is significantly growing in the present applications and usage of PV power systems. Despite the strength of the PV arrays in power systems, the arrays remain susceptible to certain faults. An effective supply requires economic returns, the security of the equipment and humans, precise fault identification, diagnosis, and interruption tools. Meanwhile, the faults in unidentified arc lead to serious fire hazards to commercial, residential, and utility-scale PV systems. To ensure secure and dependable distribution of electricity, the detection of such ha

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H

The recent development in statistics has made statistical distributions the focus of researchers in the process of compensating for some distribution parameters with fixed values and obtaining a new distribution, in this study, the distribution of Kumaraswamy was studied from the constant distributions of the two parameters. The characteristics of the distribution were discussed through the presentation of the probability density function (p.d.f), the cumulative distribution function (c.d.f.), the ratio of r, the reliability function and the hazard function. The parameters of the Kumaraswamy distribution were estimated using MLE, ME, LSEE by using the simulation method for different sampling sizes and using preli