A comparitive study of elgamal based cryptographic algorithms

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

A comparitive study of elgamal based cryptographic algorithms

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

Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 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 language	British English
Title of host publication	ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems
Editors	I. Seruca, J. Filipe, S. Hammoudi, J. Cordeiro
Pages	79-84
Number of pages	6
State	Published - 2004
Event	ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems - Porto, Portugal Duration: 14 Apr 2004 → 17 Apr 2004

Publication series

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

Conference

Conference	ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems
Country/Territory	Portugal
City	Porto
Period	14/04/04 → 17/04/04

Keywords

ElGamal cryptosystem
Testing and evaluation

Cite this

Haraty, R. A., Otrok, H., & El-Kassar, A. N. (2004). A comparitive study of elgamal based cryptographic algorithms. In I. Seruca, J. Filipe, S. Hammoudi, & J. Cordeiro (Eds.), ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems (pp. 79-84). (ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems).

Haraty, Ramzi A. ; Otrok, Hadi ; El-Kassar, A. N. / A comparitive study of elgamal based cryptographic algorithms. ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems. editor / I. Seruca ; J. Filipe ; S. Hammoudi ; J. Cordeiro. 2004. pp. 79-84 (ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems).

@inproceedings{060711e5397d484b9801ee3a9c623a69,

title = "A comparitive study of elgamal based cryptographic algorithms",

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.",

keywords = "ElGamal cryptosystem, Testing and evaluation",

author = "Haraty, {Ramzi A.} and Hadi Otrok and El-Kassar, {A. N.}",

year = "2004",

language = "British English",

isbn = "9728865007",

series = "ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems",

pages = "79--84",

editor = "I. Seruca and J. Filipe and S. Hammoudi and J. Cordeiro",

booktitle = "ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems",

note = "ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems ; Conference date: 14-04-2004 Through 17-04-2004",

}

Haraty, RA, Otrok, H & El-Kassar, AN 2004, A comparitive study of elgamal based cryptographic algorithms. in I Seruca, J Filipe, S Hammoudi & J Cordeiro (eds), ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems. ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems, pp. 79-84, ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems, Porto, Portugal, 14/04/04.

A comparitive study of elgamal based cryptographic algorithms. / Haraty, Ramzi A.; Otrok, Hadi; El-Kassar, A. N.
ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems. ed. / I. Seruca; J. Filipe; S. Hammoudi; J. Cordeiro. 2004. p. 79-84 (ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A comparitive study of elgamal based cryptographic algorithms

AU - Haraty, Ramzi A.

AU - Otrok, Hadi

AU - El-Kassar, A. N.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - ElGamal cryptosystem

KW - Testing and evaluation

UR - http://www.scopus.com/inward/record.url?scp=8444240067&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:8444240067

SN - 9728865007

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

SP - 79

EP - 84

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

A2 - Seruca, I.

A2 - Filipe, J.

A2 - Hammoudi, S.

A2 - Cordeiro, J.

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

Y2 - 14 April 2004 through 17 April 2004

ER -

A comparitive study of elgamal based cryptographic algorithms

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this