[Cryptography] GNU's "anonymous-but-taxable electronic payments system" Heh.

[CodesInChaos]

How do you handle the case where GCD(m, n) != 1 where m is the message
(i.e. the full domain hash) and n the modulus? Do you reject that
message and generate a new one?

----

AFAIK zerocoin has unconditionally secure blinding but factoring the
accumulator modulus allows minting new coins. (I only looked into the
original zerocoin, not the newer zcash)