Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2005 | Volume: 5 | Issue: 9 | Page No.: 1692-1712
DOI: 10.3923/jas.2005.1692.1712
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Security of the Cryptographic Protocols Based on Discrete Logarithm Problem

Kefa Rabah

We wish to find the smallest non-negative integer, , for which y=g where, y, GF(p) (if such an exists). This is the Discrete Logarithm Problem (DLP). A number of strategies have been proposed to solve the DLP, among them, Shanks Baby-Step Giant-Step algorithm, the Pollard Rho algorithm, the Pohlig-Hellman algorithm and the Index-Calculus method. We show that, given certain assumptions about the smoothness of the integers, the index calculus will, in general, out-perform the other three methods, substantially increasing the range of problems which are feasible to solve and thereby threatening the security of the DLP-based crypto-algorithms like, DH key exchange protocol, ElGamal cryptosystem, DSA and many others. In this paper we describe basic principle and implementation procedure to these DLP-crypto algorithms. We will also discuss the general methods of attacking DLP cryptosystems and how secure they are against these general attacks. The mathematical challenge here lies in computing discrete logarithms in finite fields of type Zp, which consist of the integers modulo a large prime p.
PDF Fulltext XML References Citation Report Citation
  •    Encryption Algorithm of RSH (Round Sheep Hash)
How to cite this article:

Kefa Rabah , 2005. Security of the Cryptographic Protocols Based on Discrete Logarithm Problem. Journal of Applied Sciences, 5: 1692-1712.

DOI: 10.3923/jas.2005.1692.1712






Curve Bottom