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...

Full description

Saved in:

Bibliographic Details
Published in:	Designs, codes, and cryptography Vol. 91; no. 1; pp. 151 - 163
Main Authors:	Carlet, Claude, Kiss, Rebeka, Nagy, Gábor P.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2023 Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!