Known algorithms for dense k-SUM and k-XOR are essentially optimal, supported by self-reduction and obfuscation techniques.