Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm | IEEE Conference Publication | IEEE Xplore

Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm


Abstract:

Summary form only given. 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...Show More

Abstract:

Summary form only given. 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 Pollard's rho algorithm that works in the domain of natural integers. We enhance the Pollard's rho algorithm to work with the modified ElGamal cryptosystems.
Date of Conference: 06-06 January 2005
Date Added to IEEE Xplore: 13 June 2005
Print ISBN:0-7803-8735-X

ISSN Information:

Conference Location: Cairo, Egypt

1 Introduction

Cryptography is the art or science of keeping messages secret. People mean different things when they talk about cryptography. Children play with toy ciphers and secret languages. However, these have little to do with real security and strong encryption. Strong encryption is the kind of encryption that can be used to protect information of real value against organized criminals, multinational corporations, and major governments. Strong encryption used to be only in the military domain; however, in the information society it has become one of the central tools for maintaining privacy and confidentiality.

References

References is not available for this document.