The Discrete Logarithm Problem in the ElGamal
Cryptosystem over the Abelian Group U(n)
Where n= pm
,or 2pm

Hayder Raheem Hashim

doi:https://doi.org/10.14445/22315373/IJMTT-V7P522

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 7 | Number 2 | Year 2014 | Article Id. IJMTT-V7P522 | DOI : https://doi.org/10.14445/22315373/IJMTT-V7P522

The Discrete Logarithm Problem in the ElGamal Cryptosystem over the Abelian Group U(n) Where n= pm ,or 2pm

Hayder Raheem Hashim

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

Keywords

ElGamal Cryptosystem, The abelian group U(n), The Discrete Logarithm Problem over U(n), The ElGamal cryptosystem over U(n) : n =pm , or 2pm for a positive integer m and p is an odd large prime.

References

[1] Klein, Philip (1996). Public-key cryptosystems, and El Gamal's system in particular. Retrieved Jan 30, 2014 from http://cs.brown.edu/ courses/cs007/elgamal/home.html
[2] MAHALANOBIS, Y. (2011). A SIMPLE GENERALIZATION OF THE ELGAMAL CRYPTOSYS TEM TO NON- ABELIAN GROUPSII.- Retrieved Jan. 30, 2014 from http://arxiv.org/pdf/0706.3305.pdf
[3] Ikenaga, B.(2008). The Group of Units in the Integers mod n. Retrieved Jan. 30, 2014 from http://www.m illersv ille.edu/~ bikenaga/abstract- algebra-1/unitzn/unitzn.html
[4] Solomon, R. (2003). Abstract Algebra : Pure and Applied Undergraduate Texts. USA: American Mathematical Society.
[5] Dong, C. Math in Network Security: A Crash Course: Discrete Logarithm Problem. Retrieved Jan 30, 2014, from http://www /~mrh/330- http://www http://www /~mrh/330tutor/ch06s02.html
[6]Rosen, K. H. (2005). Elementary Number Theory and Its Applications. (5th ed.).United State of America: Boston
[7] Lisa, Eckstein (1996). Public-key cryptosystems: El Gamal's cryptosystem. Retrieved Jan. 30, 2014 from http://cs.brown.edu/courses/ cs007/elgamal/ node1. Html
[8] The primitive root theorem (n.d). Retrieved Feb. 07, 2014 from http://pages.uoregon.edu /nganou/primitive.pdf

Citation :

Hayder Raheem Hashim, "The Discrete Logarithm Problem in the ElGamal Cryptosystem over the Abelian Group U(n) Where n= pm ,or 2pm," International Journal of Mathematics Trends and Technology (IJMTT), vol. 7, no. 2, pp. 184-189, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V7P522