Suppose to have a function for numbers expressed in 8-bit $\in [0,2^8-1]$ defined as: $$f(x)=x||x||x||x$$ where $|f(x)|$ is exactly 32 bits.
e.g., suppose x=2 (00000010) so $f(x)=2+2^9+2^{17}+2^{25}=33686018$ (00000010000000100000001000000010)
Given N and x I'd like to find y,z,w s.t.
$$f(x)*f(y) \space mod \space N= f(z)*f(w) \space mod \space N$$
What is a good way to proceed?