Not really. Shor's algorithm is asymptotically still a lot faster than their new algorithm (polynomial vs exponential), although it might perform slower for pri

Not really. Shor's algorithm is asymptotically still a lot faster than their new algorithm (polynomial vs exponential), although it might perform slower for primes up to some fixed size. This is generally less important in cryptography though, especially when determining your security gap. Also, while new, this result isn't really surprising. That Grover's algorithm can be applied to get a quadratic improvement over existing classical search algorithms has been known for a long time.