Re: 64-bit discrete logarithm



ctgPi <fabio@xxxxxxxxxxxxxxxxxxx> wrote:
Is there any algorithm that might satisfy both constraints? Or is the
discrete log problem intrinsically harder than factorization at 64
bits?

If you can choose special primes, you can use Pohlig-Hellman.

--
kg
.



Relevant Pages

  • Re: Surrogate factoring explained
    ... the point of surrogate factoring is to break the RSA ... >> encryption technique, which depends on picking special primes so ... and relating its factorization to the ...
    (sci.math)
  • Re: Surrogate factoring explained
    ... the point of surrogate factoring is to break the RSA ... >> encryption technique, which depends on picking special primes so ... and relating its factorization to the ...
    (sci.crypt)
  • Re: Surrogate factoring explained
    ... and relating its factorization to the ... RSA doesn't depend on special primes. ...
    (sci.math)
  • Re: Surrogate factoring explained
    ... the point of surrogate factoring is to break the RSA ... >> encryption technique, which depends on picking special primes so ... and relating its factorization to the ...
    (sci.math)
  • Re: Surrogate factoring explained
    ... and relating its factorization to the ... RSA doesn't depend on special primes. ...
    (sci.crypt)