> rising to the non-associative power indices ... in the last two decades has been analyzed and does not have a quantum polynomial algorithm that solves it. The problem is called Exponential Congruences Problem.

The author uses similar wording a couple times and it is a little ambiguous? Does "does not have" mean a superpolynomial quantum lower bound has been discovered for this algorithm (or is there a reduction to some other important conjectured complexity theorem)? Or is it just that a polynomial algorithm has not been discovered yet?