No abstract

Considered cryptosystems such as Cardano square lattices are characterized by the high-speed encryption in use today Enhanced Programming computers. This is because the number of different variants rapidly increases with the size of a square. In this paper we have shown that, for the size of 20 × 20, the number of such grids exceeds the number of 1.6 × 2 60 . Therefore, these systems have sufficient cryptographic resistance. Application of these systems in conjunction with substitution cipher can still more resist cryptographic attacks.

No abstract

An upgraded version of Ford-Fulkerson algorithm is proposed, which allows to determine the maximum flow and the distribution flow in branches of the network. Results of simulation using this algorithm are given. They show its effectiveness in comparison with the other variants of flow distribution in the network at change of the capacity of branches randomly in time.

No abstract