DocumentCode :
2925137
Title :
A Comparative Study of Elgamal Based Digital Signature Algorithms
Author :
Haraty, Ramzi A. ; El-Kassar, A.N. ; Shebaro, Bilal M.
Author_Institution :
Lebanese American Univ., Byblos
fYear :
2006
fDate :
24-26 July 2006
Firstpage :
1
Lastpage :
6
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.
Keywords :
Gaussian processes; digital signatures; polynomials; public key cryptography; reliability theory; ElGamal digital signature; ElGamal public-key; Gaussian integers; attack algorithm; baby-step-giant algorithm; finite fields; functionality testing; natural integers; polynomials; public-key signature; reliability testing; security testing; Algorithms; Arithmetic; Automation; Digital signatures; Galois fields; Polynomials; Public key; Security; Testing; ElGamal digital signature; testing and evaluation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Automation Congress, 2006. WAC '06. World
Conference_Location :
Budapest
Print_ISBN :
1-889335-33-9
Type :
conf
DOI :
10.1109/WAC.2006.375953
Filename :
4259869
Link To Document :
بازگشت