TAILIEUCHUNG - A comparative study of ElGamal based digital signature algorithms

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. | S147 Journal of Computational Methods in Sciences and Engineering 6 2006 S147-S156 IOS Press A comparative study of ElGamal based digital signature algorithms Ramzi A. Haratya . El-Kassarb and Bilal M. Shebaroa Lebanese American University Lebanon Beirut Arab University Lebanon 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 ElGamal digital signature testing evaluation Baby step giant algorithm 1. Introduction The concept of a digital signature was introduced in 1976 by Diffie and Hellman 14 and more applied by Menezes et al. 1 . One of the powerful and practical signature schemes was produced by ElGamal 13 in 1985. El-Kassar et al. 2 3 and El-Kassar and Haraty 4 modified the ElGamal signature schemes from the domain of natural integers Z to two principal ideal domains namely the domain of Gaussian integers Z i a bi a b E Z i ự 1 and the domain of polynomials over finite fields F by extending the arithmetic needed for the modifications to these domains 5 . 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 key space 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 .

• An ninh - Bảo mật
• Digital signature algorithms
• Classical and modified ElGamal signature
• ElGamal signature scheme
• ElGamal based digital signature algorithms
• Testing and evaluation
• The domain of gaussian integers
• Smartcards without coprocessor
• The Digital signature
• The RSA and ESIGN
• The Implementation of Digital Signature Algorithms
• An 8 bit smart card
• Digital signature
• Digital signature algorithm
• Discrete logarithm problem
• Digital signature scheme
• Lược đồ chữ ký số
• Thuật toán chữ ký số
• New construction method
• Algorithm for formation of signature
• Digital signature schema
• Root problem
• New key schemes
• Digital signature systems
• Guarantee Exclusive Ownership
• The Digital Signatures
• The Usual Algorithms
• Lack Exclusive Ownership
• Digital signature schemes
• Hash function
• ElGamal scheme
• Index calculate algorithms
• Public key cryptography
• The key agreement
• Safe Storage of public keys
• Algorithms and Explanations
• Key agreement Algorithm