An integer $q$ is called a quadratic residue modulo $N$ if it is congruent to a perfect square modulo $N$; i.e., if there exists an integer $x$ such that: $x^2≡q\ (mod\ n)$.
Otherwise, $q$ is called a quadratic non-residue modulo $N$.
Given that $N$ is a composite number (whose prime factorization is known beforehand) can someone help with the generic higher residuocity problem of the form:
$(x^2-c^2)^k≡q\ (mod\ n)$.
Find $x$ (where $c$ is some random integer value)? $k$ is an even number (say 2).
I think we can solve it using an approach similar to the original QRP, but I am struggling with the exact approach. Can someone please help with an explicit example?