A Wu‘s Method Based Parallelization Design and Implementation for Algebraic Cryptanalysis

Wus method is one of the effective methods for solving large-scale polynomial equation systems in algebraic cryptanalysis. But it will take a lot of time to solve polynomial equations with a serial algorithm of Wu’s method. In order to eliminate the bottleneck of computing time overheads, we proposes an efficient data parallelization scheme based on Wu‘s method. And a load balance mechanism applied to our scheme, which greatly improves computing-performance of Wu’s method and enhances its ability to meet challenges of algebraic cryptanalysis.