Bikov, Dusan and Bouyukliev, Ilija (2017) Parallel Fast Möbius (Reed-Muller) Transform and its Implementation with CUDA on GPUs. Proceedings of the International Workshop on Parallel Symbolic Computation.
Full text not available from this repository.
Official URL: http://doi.acm.org/10.1145/3115936.3115941
Abstract
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.
| Item Type: | Article |
|---|---|
| Subjects: | Natural sciences > Computer and information sciences Natural sciences > Matematics |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Dusan Bikov |
| Date Deposited: | 18 Dec 2017 14:05 |
| Last Modified: | 18 Dec 2017 14:05 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/18729 |
Actions (login required)
 |
View Item |