On the Fine-Grained Complexity of Parity Problems