Over the last decade, there have been significant efforts in developing efficient XOR-enabled SAT solvers for cryptographic applications. In [22] we proposed a solver specialised to problems, and more precisely instances arising from index calculus attack on discrete logarithm problem elliptic curve-based cryptosystems. Its most prominent feature is module that performs an enhanced version of G...