Quote:
Originally Posted by tetramur
No. An algorithm for DL implies algorithm for IF and vice versa.

A general algorithm for discrete logarithms implies an algorithm for integer factorization. But Joux's algorithm isn't general, and so it doesn't directly give rise to a factorization algorithm. It wouldn't be surprising if it did give a factorization algorithm for an appropriatelyrestricted setting, but it's not at all clear what that would look like, and it probably wouldn't be naturallooking in the integers. Personally I think that it would be worth a paper to do this (and such a paper would likely include an actual factorization). But this is outside my expertise, so I won't be the one writing that paper.