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

                 The aim of the research is to identify the adequacy of accounting disclosure in granting bank financing in explaining the role of accounting disclosure in granting bank financing by linking the concepts of full, comprehensive and adequate disclosure to bank financing. The impact of full accounting disclosure on granting bank financing, the existence of an impact of comprehensive accounting disclosure on granting bank financing, the existence of an impact of adequate accounting disclosure on granting bank financing, and the research relied on the descriptive approach, the deductive and inductive approach, the inferential analytical approach, a

In our research, we dealt with one of the most important issues of linguistic studies of the Holy Qur’an, which is the words that are close in meaning, which some believe are synonyms, but in the Arabic language they are not considered synonyms because there are subtle differences between them. Synonyms in the Arabic language are very few, rather rare, and in the Holy Qur’an they are completely non-existent. And how were these words, close in meaning, translated in the translation of the Holy Qur’an by Almir Kuliev into the Russian language.