Parallel Fast Möbius (Reed-Muller) Transform and its Implementation with CUDA on GPUs
Dushan Bikov, Iliya Bouyukliev · 2017
One of the most important cryptographic characteristics of the Boolean and vector Boolean functions is the algebraic degree which is connected with the Algebraic Normal Form. In this paper, we present an algorithm for computing the Algebraic Normal Form of a Boolean function using binary Fast Möbius (Reed-Muller) Transform implemented in CUDA for parallel execution on GPU. In the end, we give some experimental results.