Preferred Language
Articles
/
rBZNQ4cBVTCNdQwChz5Y
The Effect of Addition of Combination of Plasma Treated Polyester and Polyamide Fibers on Surface Roughness and Some Mechanical Properties of Heat Cured Acrylic Resin
...Show More Authors

Crossref
View Publication
Publication Date
Thu Dec 26 2024
Journal Name
Al–bahith Al–a'alami
EMPLOYING TWITTER IN THE U.S. PRESIDENTIAL ELECTION CAMPAIGN IN 2016: U.S. PRESIDENTIAL CANDIDATE DONALD TRUMP’S TWEETS AS A “MODEL”: (A Research Drawn from a Master’s Thesis) (An Analytical Study)
...Show More Authors

This study aimed to identify the employment of the social networking platform «Twitter» in the 2016 presidential campaign led by the Republican candidate, Donald Trump; and analyse his tweets through his personal account on «Twitter»  for the period from: 10/ 8/2016 to: 11/ 8/2016 which represents the last month of the election campaign.

The study belongs to the type of descriptive studies using the analytical method through an analysis index that includes sub-categories and other secondary categories. The research has adopted the ordinary unit of information material (tweet) as an analysis unit for this purpose.

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Apr 01 2012
Journal Name
2012 International Conference On Future Communication Networks
Efficient method to find the multiplicative inverse in GF (2<sup>m</sup>) using FPGA by exponentiation to (2<sup>k</sup>)
...Show More Authors

Crossref (1)
Crossref
Publication Date
Sun Apr 01 2012
Journal Name
2012 International Conference On Future Communication Networks
Efficient method to find the multiplicative inverse in GF (2<sup>m</sup>) using FPGA by exponentiation to (2<sup>k</sup>)
...Show More Authors

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

... Show More
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref