KFU. Card publication. On Communication Complexity of Bent Functions from Maiorana

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

ON COMMUNICATION COMPLEXITY OF BENT FUNCTIONS FROM MAIORANA&NDASH;MCFARLAND CLASS

Form of presentation

Articles in Russian journals and collections

Year of publication

2016

��

��

Authors, employees of KFU

Marchenko Anton Aleksandrovich, author

Bibliographic description in the original language

Marchenko A. On Communication Complexity of Bent Functions from Maiorana–McFarland Class / A. Marchenko // Lobachevskii Journal of Mathematics. - 2016. - Vol. 37. - � 6. - R. 730–733.

Annotation

Lobachevskii Journal of Mathematics

Keywords

Communicatoin complexity, bent functions, Maiorana-McFarland, Lower bound

The name of the journal

Lobachevskii Journal of Mathematics

On-line resource for training course

http://dspace.kpfu.ru/xmlui/bitstream/handle/net/107725/Marchenko.pdf?sequence=2&isAllowed=y

URL

http://link.springer.com/article/10.1134/S1995080216060172

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=143493&p_lang=2

Resource files

File name	Size (MB)	Format
6.jpg	0,00	jpg	show / download
Marchenko.pdf	0,21	pdf	show / download

Full metadata record

Field DC	Value	Language
dc.contributor.author	Marchenko Anton Aleksandrovich	ru_RU
dc.date.accessioned	2016-01-01T00:00:00Z	ru_RU
dc.date.available	2016-01-01T00:00:00Z	ru_RU
dc.date.issued	2016	ru_RU
dc.identifier.citation	Marchenko �. On Communication Complexity of Bent Functions from Maiorana–McFarland Class / �. Marchenko // Lobachevskii Journal of Mathematics. - 2016. - Vol. 37. - � 6. - �. 730–733.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=143493&p_lang=2	ru_RU
dc.description.abstract	Lobachevskii Journal of Mathematics	ru_RU
dc.description.abstract	Lobachevskii Journal of Mathematics	ru_RU
dc.description.abstract	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.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Communicatoin complexity	ru_RU
dc.subject	bent functions	ru_RU
dc.subject	Maiorana-McFarland	ru_RU
dc.subject	Lower bound	ru_RU
dc.title	On Communication Complexity of Bent Functions from Maiorana–McFarland Class	ru_RU
dc.type	Articles in Russian journals and collections	ru_RU