[Cryptography] quantum noise vs. public-key crypto

[Pierre Abbat]

https://arxiv.org/abs/2306.10072
According to this paper, Shor's algorithm cannot factor a product of two big 
Fouvry primes if there's too much noise.

I know little about quantum error correction and quantum Fourier transform. 
How does the amount of noise relate to the biggest semiprime Shor can factor? 
What about discrete logarithms in finite fields and in elliptic curve groups?

Pierre
-- 
The Black Garden on the Mountain is not on the Black Mountain.