|
This article is cited in 3 scientific papers (total in 3 papers)
Statistical estimation of the significant arguments set of the binary vector-function with corrupted values
O. V. Denisov LLC "Certification Research Center", Moscow
Abstract:
Let $\Theta$ be the set of significant arguments of the unknown binary vector-function with the random uniformly distributed arguments and corrupted values. Algorithm for constructing the estimate $\Theta^*$ of $\Theta$ based on statistical estimates of function spectrum is proposed. For some function classes (particularly, for vectorial bent-functions and bijective mappings) we get asymptotic bounds of the data size sufficient for the successful work of the algorithm, i.e. $\mathbf P\{\Theta^*=\Theta\}\to1$.
Key words:
binary vector-function, essential arguments, function spectrum estimations.
Received 22.IV.2013
Citation:
O. V. Denisov, “Statistical estimation of the significant arguments set of the binary vector-function with corrupted values”, Mat. Vopr. Kriptogr., 5:4 (2014), 41–61
Linking options:
https://www.mathnet.ru/eng/mvk134https://doi.org/10.4213/mvk134 https://www.mathnet.ru/eng/mvk/v5/i4/p41
|
Statistics & downloads: |
Abstract page: | 390 | Full-text PDF : | 192 | References: | 40 | First page: | 7 |
|