Here modular multiplication unitary means $U_a : |s\rangle \to|as\mod N\rangle$.
My main question is, can the modular multiplication unitary $U_a$ can be constructed in time polynomial in the number of qubits $n$ for any $a$ and $N$? Or is this an open question? I cannot find a method or proof of implementing modular multiplication unitary fast.