Optimizations in computing the algebraic normal form transform of Boolean functions

Pashinska, Maria and Bakoev, Valentin and Bouyukliev, Ilija and Bikov, Dusan (2021) Optimizations in computing the algebraic normal form transform of Boolean functions. In: International Conference Automatics and Informatics (ICAI) 2021, 30 September-2 October 2021, Varna, Bulgaria.

Text (CONFERENCE (ICAI'2021) PROGRAM) icai21-program.pdf Restricted to Registered users only until 31 December 2021. Download (192kB)

Abstract

The Reed-Muller transform is widely used in discrete mathematics and cryptography, in particular for computing the algebraic normal form of Boolean functions. This is a good reason to look for ways to optimize the implementation of the algorithm. Here we present different ways for optimization based on the bitwise representation of the true table vector of a Boolean function. We compare the implementation of the standard algorithm with the implementation using AVX2 and AVX512 instruction sets and the corresponding extended registers and parallel implementation using GPUs with CUDA and OpenMP. The experimental results show that various degree of speedup can be achieved depending on the used platforms and approaches.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Natural sciences > Computer and information sciences Natural sciences > Matematics
Divisions:	Faculty of Computer Science
Depositing User:	Dusan Bikov
Date Deposited:	27 Dec 2021 08:42
Last Modified:	27 Dec 2021 08:42
URI:	https://eprints.ugd.edu.mk/id/eprint/28963

Actions (login required)

View Item