Golić conjecture ([3]) states that the necessary condition for a function to be perfectly balanced for any choice of a tapping sequence is linearity of a function in the first or in the last essential variable. In the current paper we prove Golić conjecture.

We consider new approaches to the investigation and introduce parameters for some new classes of perfectly balanced Boolean functions.

The purpose of this document is to make the specifications of the cryptographic algorithms defined by the Russian national standards GOST R 34.10-2012 and GOST R 34.11-2012 available to the Internet community for their implementation in the cryptographic protocols based on the accompanying algorithms.These specifications define the pseudorandom functions, the key agreement algorithm based on the Diffie-Hellman algorithm and a hash function, the parameters of elliptic curves, the key derivation functions, and the key export functions.

Новые методы изучения совершенно уравновешенных булевых функций © 2009 г. О. А. Логачев, С. В. Смышляев, В. В. Ященко В работе рассмотрены новые подходы к изучению и введены параметры для описания некоторых новых классов совершенно уравновешенных булевых функций. Работа первого и третьего авторов поддержана Российским фондом фундаментальных исследований, проект 07-0100154.

We continue the study of properties of perfectly balanced Boolean functions with the use of the concept of barriers of Boolean functions.