Fast Exhaustive Search for Polynomial Systems over F3

ePrint Report: Fast Exhaustive Search for Polynomial Systems over F3

Bo-Yin Yang, Wei-Jeng Wang, Shang-Yi Yang, Char-Shin Miou, Chen-Mou Cheng

Solving multivariate polynomial systems over finite fields is an important
problem in cryptography. For random F2 low-degree systems with equally many
variables and equations, enumeration is more efficient than advanced solvers for all
practical problem sizes. Whether there are others remained an open problem.
We here study and propose an exhaustive-search algorithm for low degrees systems
over F3 which is …

advanced char chen cryptography enumeration eprint report fast important low problem random report search systems