I figured out an answer of the type I wanted. I'll call the character $\chi_N$ instead of $\chi$ to indicate its dependence on $N$. The requirements for $\chi_N$ are:
(a) It must be trivial on units
(b) It must be trivial on rational primes $p$ not dividing $N$
(c) If $\pi\in A$ is such that $\pi\overline{\pi}$ is a rational prime $p$ not dividing $N$, then $\chi(\pi)=1\iff d$ is a cube modulo $p$.
A basic fact from Wikipedia is that rational primes which are coprime to $3$ fall into two categories:
- Those equivalent to $1$ modulo 3. These split into $2$ primes $\pi$ and $\overline{\pi}$ as described in (c) above.
- Those equivalent to $2$ modulo $3$. These remain prime in $A$.
It is easy to see that the elements $p$ in (c) are the split rational primes, i.e. $\equiv 1\pmod{3}$, and so for proving requirement (b) we only need to consider $p\equiv 2\pmod{3}$.
In the Wikipedia article he defines a primary as an element coprime to $3$ and equivalent to $\pm 1\pmod{3}$. Under this definition, he then states that for any element $\lambda\in A$ coprime to $3$, exactly one of $\lambda,\mu_3\lambda\text{, and }\mu_3^2\lambda$ is primary. The definition has the weakness that the unique factorization that he states isn't quite correct because the negative of a primary is primary. Others define a primary as only being equivalent to $2\pmod{3}$, and state that any $\lambda$ coprime to $3$ has exactly one associate which is primary. Under this definition the unique factorization works. But I will use the Wikipedia definition. It is a minor difference, but I wanted to note it.
As suggested, use the character $\chi_N(r)=(\frac{N}{r})$, where $(\frac{N}{r})$ is the cubic character extended to non-primes. It is initially defined on all $R_N:=\{r\in A\ |\ r\text{ is coprime to } N\}$. Any such $r$ reduces an element of $A_N:=
(A/NA))^*=R_N/NR_N$.
But we need to show it is well-defined on $A_N$; I will show this below, but for now I will just use the cubic character itself.
First note that (a) is a general property of the cubic character. If the rational prime $p$ is $\equiv 2\pmod{3}$, then $3\nmid p-1$, so on $(\mathbb{Z}/p\mathbb{Z})^*$ cubing has trivial kernel, so is surjective. Therefore $d$ is a cube, say $N=N_1^3\pmod{p}$, and so
$(\frac{N}{p})=(\frac{N_1}{p})^3=1$. So we only need to prove (c)
The next step is to break up $N$ into $3Part\times N_1$ where $N_1$ is coprime to $3$ and $3Part$ is $3$ or $9$.
Correspondingly $\chi_N$ breaks into $\chi_{3Part}\chi_{N_1}$..
It is enough to show that if $r_1\equiv r_2\pmod{N}$, both coprime to $N$. then $\chi_{3Part}(r_1)=\chi_{3Part}(r_2)$ and $\chi_{N1}(r_1)=\chi_{N1}(r_2)$. By multiplying $r_1$ by a unit $u$, we can make it primary. So we can replace $r_1$ and $r_2$ by $r_1u$ and $r_2u$, giving the same value for $\chi_3$ and $\chi_1$. But now $r_1$ being primary and $r_1\equiv r_2\pmod{N}\implies r_1\equiv r_2\pmod{3}\implies r_2$ is primary.
The supplementary law for $3$ shows $\chi_{3Part}(r_1)=1=\chi_{3Part}(r_2)$. Also, since $r_1$ and $r_2$ are both primary, cubic reciprocity says that $\chi_{N_1}(r_1)=(\frac{r_1}{N_1})$ and $\chi_{N_1}(r_2)=(\frac{r_2}{N_1})$. But since $r_1\equiv r_2\pmod{N}$, $r_1\equiv r_2\pmod{N_1}$, and therefore by the equal property of the cubic character for numerators modulo the denominator, $(\frac{r_1}{N_1})=(\frac{r_2}{N_1})$, and by the same law again $\chi_{N_1}(r_1)=\chi_{N_1}(r_2)$. So $\chi$ is well-defined on $(A/NA)^*$.
Consider the requirement (c) by considering a rational prime $p\equiv 1 \pmod{3}$ with $N(\pi)=\pi\overline{\pi}=p$.
Lemma. $\pi\mid N^k-1\iff N\text{ is a cube }\pmod{\pi}\iff N\text{ is a cube }\pmod{p}$.
Proof. $A/pA$ has $p^2$ elements, and it breaks up into the direct sum of $A/\pi A$ and $A/\overline{\pi}A$, so these each have $p$ elements.
Therefore the field inclusion $\mathbb{Z}/p\mathbb{Z}\to A/\pi A$ is an isomorphism, with cubes mapping to cubes. Q.E.D. This really works because $N$ is an ordinary integer.
The lemma shows that
$$(\frac{N}{\pi})=1\iff N\text{ is a cube }\pmod{p}$$
whereas for part c) we need
$$(\frac{N}{\pi})=1\iff d\text{ is a cube }\pmod{p}$$
This is quite similar, but there are two differences (replacement of prime powers) between $d$ and $N$:
(1) Primes $q\ne 3$ dividing $d$ may occur as a square in $d$ but not in $N$.
(2) The power of $3$ in the definition of $N$ may be different.
Fix any prime $q$ dividing $N$ (so it is prime to $p$.).
Lemma. $q$ is a cube $\pmod{p}\iff q^2$ is.
$\implies$ Obvious. $\impliedby$ If $q^2\equiv x^3\pmod{p}$, then
$$q^4\equiv x^3\pmod{p}\implies q\equiv (q^{-1}x)^3\pmod{p}$$
Since $A_N$ breaks up as a product over all primes dividing $N$ (including $3$), and since an element of $A_N$ is a cube if and only if each component is, we just need to consider cases 1) and 2)
For case 1), the lemma implies the replacement of $q^2$ in $d$ with $q$ in $N$ doesn't matter.
For case 2), the possibilities are
- $3$ doesn't divide $d$, in which case the 3Part acts trivially and so can be ignored
- $3$ divides $d$ but $9$ doesn't, in which case $3Part$ is $3^2$, and the lemma suffices
- $9$ divides $d$, in which case the 3 part of $N$ is $9$, the same as the previous item
I hope this is complete and typed in correctly..