Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Estimation of the time needed to set up a covert channel
-
A. A. Grusho
Veröffentlicht/Copyright:
1. Juli 2003
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(m2n ln n) under some conditions.
Published Online: 2003-07-01
Published in Print: 2003-07-01
Copyright 2003, Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
Artikel in diesem Heft
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
