Loading [MathJax]/extensions/MathMenu.js
A Comparative Study of Elgamal Based Digital Signature Algorithms | IEEE Conference Publication | IEEE Xplore

A Comparative Study of Elgamal Based Digital Signature Algorithms


Abstract:

A powerful and practical public-key and digital signature scheme was produced by ElGamal. ElGamal public-key and digital signature scheme were modified from the domain of...Show More

Abstract:

A powerful and practical public-key and digital signature scheme was produced by ElGamal. ElGamal public-key and digital signature scheme were modified from the domain of natural integers, Z, to the domains of Gaussian integers, Z[i], and polynomials over finite fields, F[x]. We implement the classical and modified ElGamal digital signature scheme 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 digital signature algorithms.
Date of Conference: 24-26 July 2006
Date Added to IEEE Xplore: 25 June 2007
Print ISBN:1-889335-33-9
Print ISSN: 2154-4824
Conference Location: Budapest, Hungary

1. Introduction

The concept of a digital signature was introduced in 1976 by Diffie and Hellman. One of the powerful and practical signature schemes was produced by ElGamal [3] in 1985. El-Kassar et al. [4] and El-Kassar and Haraty [5] modified the ElGamal signature schemes from the domain of natural integers, , to two principal ideal domains, namely the domain of Gaussian integers, , and the domain of polynomials over finite fields, , by extending the arithmetic needed for the modifications to these domains. In both cases, it was shown that the same prime modulus used in the classical ElGamal scheme can be used in the new settings to produce larger cyclic groups; hence, the message space, the keyspace and signature set are enlarged without any additional effort. The larger key space makes the new schemes more secure and harder to break. Moreover, it was shown in both cases that the arithmetic is easy and efficient to apply.

References

References is not available for this document.