In the Cocks IBE scheme it is required for the hash function, that the Jacobi symbol of its output and the universally available moduls $n = p*q$ is $+1$, so:
$\Big(\frac{H(ID)}{n}\Big) = \Big(\frac{a}{n}\Big) = \Big(\frac{a}{p}\Big) * \Big(\frac{a}{q}\Big) = +1$
So, either both Jacobi symbols $\Big(\frac{a}{p}\Big)$ and $\Big(\frac{a}{q}\Big)$ are $+1$ or $-1$. In the frist case, $+a$ is a quadratic residue modulo $n$, because its the product of two numbers that are quadratic residue mod $n$. So far its clear to me. However, in the latter case, why is $-a$ a quadratic residue?
In Cocks paper [1] it says: The latter case arises because by construction $p$ and $q$ are both congruent to 3 mod 4, and so $\Big(\frac{-1}{p}\Big) = \Big(\frac{-1}{q}\Big) = -1$
If I try solve it for the case that $-a$ is a quadratic residue mod $n$, and that both $\Big(\frac{a}{p}\Big) = \Big(\frac{a}{q}\Big) = -1$,
I come to the following result:
$\Big(\frac{-a}{n}\Big) = \Big(\frac{-a}{p}\Big) * \Big(\frac{-a}{q}\Big) = \Big(\frac{a}{p}\Big) * \Big(\frac{-1}{p}\Big) * \Big(\frac{a}{q}\Big) * \Big(\frac{-1}{q}\Big)$
$ = \Big(\frac{a}{p}\Big) * (-1) * \Big(\frac{a}{q}\Big) * (-1) = \Big(\frac{a}{p}\Big) * \Big(\frac{a}{q}\Big) = (-1) * (-1) = +1$
However, in the last step both Jacobi symbols are $-1$, and thus $-a$ cannot be a quadratic residue mod $n$, because it is the product of two quadratic nonresidues?
I must have made a mistake somewhere, but I don't see it.
[1] Clifford Cocks: An Identity Based Encryption Scheme based on Quadratic Residues, 2001.