On communication complexity of bent functions from Maiorana–McFarland class
- Авторлар: Marchenko A.1
-
Мекемелер:
- Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
- Шығарылым: Том 37, № 6 (2016)
- Беттер: 730-733
- Бөлім: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198427
- DOI: https://doi.org/10.1134/S1995080216060172
- ID: 198427
Дәйексөз келтіру
Аннотация
In this article we study two party Communication Complexity of Boolean bent functions from Maiorana–McFarland class. In particular, we describe connections between Maiorana–McFarland construction of bent functions and operations on matrix form of Boolean functions and show that bent functions of 2n variables from Maiorana–McFarland class have deterministic communication complexity equal n + 1. Finally, we show that not all bent functions have high communication complexity lower bound by giving the example of such function.
Авторлар туралы
A. Marchenko
Department of Theoretical Cybernetics, Institute of Computational Mathematics and Information Technologies
Хат алмасуға жауапты Автор.
Email: Anton.Marchenko@kpfu.ru
Ресей, Kremlevskaya ul. 35, Kazan, Tatrstan, 420008