Discrete Logarithm vs Integer Factorization

2.3k Views Asked by At

Can anyone please tell me if finding discrete logarithm is considered more difficult than integer factorization? We have very advanced methods to find factors of large composite numbers like Number Field Sieve. Do any such advanced method exist for finding discrete logarithm modulo prime? This argument is also linked directly with saying which one among RSA or Elgamal cryptosystems is more strong.