ElGamal encryption/decryption algorithm is based on the difficulty of discrete logarithm problem where it is strait forward to raise numbers to large powers but it is much harder to do the inverse computation of the discrete logarithm. The ElGamal algorithm depends on certain parameters which are affecting the performance, speed and security of the algorithm. Here, the importance of these parameters and the role it takes in the security and complexity of the system are analyzed, particularly the effect of changing the length of the modulo number and the private key number are investigated.

العنوان

Journal of Applied Sciences 01/2005; DOI:10.3923/jas.2005.883.886

الناشر

--

بلد الناشر

فلسطين

نوع المنشور

Both (Printed and Online)

المجلد

--

السنة

2005

الصفحات

--