Simplicity conditions for binary orthogonal arrays

It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. The supports of CI functions are (equivalently) simple orthogonal arrays, when their elements are written as rows of an array. The minimum Hamming weight of a CI...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Designs, codes, and cryptography Ročník 91; číslo 1; s. 151 - 163
Hlavní autori:	Carlet, Claude, Kiss, Rebeka, Nagy, Gábor P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2023 Springer Nature B.V Springer Verlag
Predmet:	Arrays Boolean Boolean functions Coding and Information Theory Computer Science Cryptology Discrete Mathematics in Computer Science Fourier transforms Mathematics Orthogonal arrays Boolean function Correlation-immune Rao’s bound Linear programming bound Orthogonal array 05B05
ISSN:	0925-1022, 1573-7586
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!