RUS  ENG
Full version
JOURNALS // Computational nanotechnology // Archive

Comp. nanotechnol., 2018 Issue 3, Pages 32–43 (Mi cn197)

05.13.00 INFORMATICS, COMPUTER FACILITIES AND MANAGEMENT
05.13.19 INFORMATION SECURITY

Geometric approach to estimation of complexity boolean functions

V. G. Nikonov, A. I. Zobova

a “FSRBIT”

Abstract: This paper describes fundamentally new method to estimate difficulty of boolean functions and analyzes possibilities of its using for building functions with required parameters. The interest to this method nowadays is caused by engineering new principles of implementation of data security.

Keywords: geometric complexity, boolean function.



© Steklov Math. Inst. of RAS, 2026