it's worth clarifying that Fourier-based integer multiplication as a general class of algorithms are not galactic. For example, there are techniques that are competitive on some computing platforms for as few as 2048 bits, which occurs during RSA encryption

https://eprint.iacr.org/2022/439

this doesn't use the literal n \log n algorithm, which may be galactic. but it uses fundamentally similar techniques.