Algorithm of construction of optimal according to criterion of zero correlation non-binary $S$-boxes

This paper considers the construction of cryptographic $S$-boxes of the length $N=3^k$, which are optimal from the point of view of the absence of correlation between the output and input vectors. Constructed sets of $S$-boxes can be recommended for upgrading of the existing block symmetric ciphers, as well as for the synthesis of new high-speed encryption algorithms based on the principles of multi-valued logic.