The first observation follows from the law of quadratic reciprocity. Indeed, assume that $p\equiv 1\pmod{8}$ and $p=A^2+B^2$. Let $A'$ denote the odd part of $A$. Then $p\equiv B^2\pmod{A'}$, and hence $\left(\frac{p}{A'}\right)=1$. It follows that $\left(\frac{A'}{p}\right)=1$, and then by $\left(\frac{2}{p}\right)=1$ also $\left(\frac{A}{p}\right)=1$. In the same way, $\left(\frac{B}{p}\right)=1$. The second observation lies deeper. I will give twothree proofs, the first one giving (which actually yield more information than we need).
Second proof. This proof is based on the properties of the quartic residue symbol in $\mathbb{Z}[i]$. I will rely on Chapter 9 of Ireland-Rosen: A classical introduction to modern number theory (2nd ed.), especially Theorem 2, Proposition 9.8.5, and Proposition 9.8.6 there. Assume that $p\equiv 1\pmod{16}$. There are 8 pairs representing $p$, hence we can assume that our pair $(A,B)$ is the one with
$$A\equiv 1\pmod{8}\qquad\text{and}\qquad B\equiv 0\pmod{4}.$$
As $A/B$ is a square-root of $-1$ modulo $p$, it has order four modulo $p$, hence it is actually a fourth power modulo $p$. Therefore, it suffices to show that $A$ is a fourth power modulo $p$. Equivalently, $A$ is a fourth power in $\mathbb{Z}[i]/(A+Bi)$. However, this follows from the law of quartic reciprocity and the conditions on $(A,B)$:
$$\left(\frac{A}{A+Bi}\right)_4=\left(\frac{A+Bi}{A}\right)_4
=\left(\frac{Bi}{A}\right)_4=\left(\frac{i}{A}\right)_4=(-1)^{(A-1)/4}=1.$$
Third proof. I will use Gerry Myerson's helpful comment below the original post. For any prime $p=4n+1$, Gauss (1825) observed that $p=A^2+B^2$, where $A$ and $B$ are the absolute least residues modulo $p$ of $(2n)!/(2n!^2)$ and $(2n)!^2/(2n!^2)$. For a proof, see Jacobsthal (1907) or the "Added" section below. Hence it suffices to show that in case when $4$ divides $n$, these two integers are fourth powers modulo $p$. So let us assume that $4\mid n$. By Wilson's theorem,
$$(2n)!^{(p-1)/4}=(2n)!^{n}\equiv(p-1)!^{n/2}\equiv(-1)^{n/2}=1\pmod{p},$$
hence $(2n)!$ is a fourth power modulo $p$. So we only need to prove that $2n!^2$ is a fourth power modulo $p$. Equivalently,
$$2^{(p-1)/4}n!^{(p-1)/2}\equiv 1\pmod{p}.\tag{1}$$
However, this follows from Theorem 5 in Emma Lehmer's 1977 paper "Generalizations of Gauss's lemma", and we are done.