Estimation of the time required to organize a secret channel

In this study, we construct the mathematical model of a covert channel of agent interaction in the wide area network and in a closed segment of a local area network. The channel transmits information through an IPsec-based protective device with the use of encapsulation and enciphering of packets. We analyse the asymptotic behaviour of the time needed to learn the agent the language of information transmission. We prove that if the number $n$ of nodes in an arbitrary segment and the number $m$ of segments grow without limits, then the learning time is $O(m^2n\ln n)$ under some conditions.
This research was supported by the Russian Foundation for Basic Research, grant 01–01–00895.