The Discrete Logarithm Problem in the ElGamal Cryptosystem over the Abelian Group U(n) Where n= pm,or 2pm
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2014, Vol 7, Issue 3
Abstract
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms pm, or 2pm where p is an odd large prime and m is a positive integer. It is another good way to deal with the ElGamal Cryptosystem using that abelian group U(n)={x: x is a positive integer such that x
Authors and Affiliations
Hayder Raheem Hashim
Numerical Comparison of multi-step iterative methods for finding roots of nonlinear equations
—In this paper, we compare different multi-step Newton like methods for solving nonlinear equations. Results are shown in form of iteration tables. Numerical results show that the Modified Shamanskii...
Reflection and Transmission of Elastic Waves at the Loosely Bonded Solid-Solid Interface
Reflection and transmission phenomenon of plane waves at a loosely bonded interface between linear isotropic elastic solid half space and fluid saturated incompressible porous solid half space is studied in the present s...
On Isomorphism in C*-Ternary Algebras for a Cauchy-Jensen Functional Equations
In this paper, we investigate isomorphisms between -ternary algebras by proving the Hyers-Ulam-Rassias stability of homomorphisms in -ternary algebras and of derivations on -ternary algebras for the following Cauchy-Jens...
Mathematical Technique Based Speaker Recognition for Total Security System
Today security system is rapidly growing and updating simultaneously due to advance of technology. This growth in electronic transactions results in a rise of demand for fast and accurate user identification and authenti...
Solutions of the Homogeneous Cubic Equation with Six Unknowns
The homogeneous cubic equation with six unknowns represented by the diophantine equation