Quote:
Originally Posted by jasonp
Nobody knows if there is a way to transfer the recent improvements in discrete logarithms to the integer factorization domain. Note that the kind of discrete logs that can be solved quickly by Joux et al would not appear in actual cryptosystems

Can method used by Joux et al. be extended with keeping time complexity the same? If yes, how can it be done?