  In this paper we study the computational feasibility of an algorithm to prove
orbifold equivalence between potentials describing Landau-Ginzburg models.
Through a comparison with leading results of Groebner basis computations in
cryptology, we infer that the algorithm produces systems of equations that are
beyond the limits of current technical capabilities. As such the algorithm
needs to be augmented by `inspired guesswork', and we provide two new examples
of applying this approach.
