Аннотация:This paper deals with the efficient parallel search of square m-sequences on both modern CPUs and GPUs.The key idea is based on applying particular vector processor instructions with a view to maximizing the advantage of Single Instruction Multiple Data (SIMD) and Single Instruction Multiple Threads (SIMT) execution patterns.The developed implementation was adjusted to testing for the maximum-period of m-sequences of some particular forms.Furthermore, the early abort sieving strategy based on the application of SAT-solvers were presented.With this solution, it is possible to search m-sequences up to degree 32 exhaustively.
