A comparitive study of elgamal based cryptographic algorithms

Ramzi A. Haraty, Hadi Otrok, A. N. El-Kassar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

In 1985 a powerful and practical public-key scheme was produced by ElGamal; his work was applied using large prime integers, El-Kassar et al. and El-Kassar and Haraty modified the ElGamal public-key encryption scheme from the domain of natural integers, Z, to two principal ideal domains, namely the domain of Gaussian integers, Z[i], and the domain of the rings of polynomials over finite fields, F[x], by extending the arithmetic needed for the modifications to these domains. In this work we implement the classical and modified ElGamal cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers. We enhance the Baby-Step-Giant algorithm to work with the modified ElGamal cryptosystems.

Original languageBritish English
Title of host publicationICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems
EditorsI. Seruca, J. Filipe, S. Hammoudi, J. Cordeiro
Pages79-84
Number of pages6
StatePublished - 2004
EventICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems - Porto, Portugal
Duration: 14 Apr 200417 Apr 2004

Publication series

NameICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems

Conference

ConferenceICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems
Country/TerritoryPortugal
CityPorto
Period14/04/0417/04/04

Keywords

  • ElGamal cryptosystem
  • Testing and evaluation

Fingerprint

Dive into the research topics of 'A comparitive study of elgamal based cryptographic algorithms'. Together they form a unique fingerprint.

Cite this