IT Security

Analysis of various security aspects of communication protocols, in particular Key Exchange Protocols (IKE & IKEv2) and VPN protocols (IPsec). Evaluation of security levels in IoT/IoE networks. Design and deployment of computer systems, that measures the level of cyberthreats in close physical proximity of the actor. Detection of anomalies, trends and threats in IT security by utilizing machine learning, statistical methods, game theory, semantic networks.

The Network Balance Realized by Routing Organization System

2011

In the presented paper, we propose to exploit routing organization for the purpose of managing network resources. According to our assumptions, we have the same quantity of materials, objects, tokens, tools etc. at our disposal in every node of the network. During network operation we must distribute resources between these nodes. It should be carried out as instantaneously and as economically as possible. Multi-Agent Systems are also used to deal with this kind of tasks and the centralised algorithms presented in this paper are to be used to measure the efficiency of the distributed MAS solution. From the logistical point of view, we have a sequence of stages with different states of token…

A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms

2013

Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.

Approximate Algorithm for Fast Capacity Provisioning in WANs with Trade-Off between Performance and Cost under Budget Constraint

2014

Due to the emergence of Software Defined Networking (SDN) with the idea of centralized control over computer networks, the Capacity and Flow Assignment Problem (CFA) may be approached in a classical non-distributed fashion in real-life scenarios. The question arises whether a heuristical approach to this NP-complete problem is of any use in practice.

A Note on Keys and Keystreams of Chacha20 for Multi-key Channels

2018

In this paper we analyze the keystreams generated by the Chacha20 stream cipher. We also compare these to the ones generated by its predecessor, the RC4 stream cipher. Due to the proposed multi-key channels in the upcoming TLS 1.3 standard we analyze the behavior of the keystream in the boundary case where there is a single bit difference between two keys used for the initiation of the stream cipher algorithms. The goal is to check whether a single bit change in the key has any predictable influence on the bits of the keystream output.

Algorithmic Complexity Vulnerability Analysis of a Stateful Firewall

2016

Algorithmic complexity vulnerabilities are an opportunity for an ad-versary to conduct a sophisticated kind of attack i.e. on network infrastructure services. Such attacks take advantage of worst case time or space complexity of algorithms implemented on devices in their software. In this paper we address potential risks introduced by such algorithmic behavior in computer networks in particular on a stateful firewall. First we introduce the idea and theoretical background for the attack. We then describe in full detail a successfully con-ducted attack which takes advantage of the worst case computational complexi-ty of O(n2) of a hash table data structure used to store active sessions. The …

Virtual Environment for Implementation and Testing Private Wide Area Network Solutions

2013

In this paper the concept of virtual environment for implementation and testing private Wide Area Network (WAN) solutions is presented. The VMware vSphere virtualization platform is used. The paper presents the ability to reflect the structure of any given WAN topology using Vyatta software routers and VMware virtualization platform and verifies its reliability regarding data transfer. The paper includes a number of performance tests to verify the dependability of the proposed solution and provide a proof-of-concept for the network topology during the Design phase of the PPDIOO methodology, right before the Implementation phase.

Designing Frame Relay WAN Networks with Trade-Off between Link Cost and Performance

2014

This paper is focused on the problem of designing a Wide Area Network topology with trade-off between link cost and response time to users. The L2 technology chosen for the research is a Frame Relay based solution. The link capacities in the network and the routes used by packets are determined in a way to minimize network cost and response time at the same time. In FR networks link capacity corresponds directly to CIR parameter which makes the presented numerical results very useful in practice, especially during preliminary network design in the Design Phase of the PPDIOO methodology.

Lifespan-Aware Routing for Wireless Sensor Networks

2010

Wireless Sensor Networks (WSNs) have the capability to become the eyes and ears for the future networked society allowing monitoring of any habitat or object's properties remotely and independently of an energy source. Services based on this technology may change the way we monitor and control remote areas and objects. In this paper we propose a different approach to routing data across Wireless Sensor Networks. We argue that a distance-vector protocol using a lifespan-aware metric is a plausible solution to the task of routing information in WSN in a manner that both saves energy of the individual node and manages summarized energy of the system equally and fairly. The concept is designed …

Minimal Büchi Automata for Certain Classes of LTL Formulas

2009

In this paper we calculate the minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking. Our results may be used for verification of the quality of algorithms which automatically translate LTL formulas into Buchi automata and for improving the quality and speed of such translators. In the last section of this paper we compare our lower-bound estimations to Buchi automata generated by two currently used translators: LTL2BA and SPOT.

A Note on the Local Minimum Problem in Wireless Sensor Networks

2013

The Local Minimum Problem occurs in geographic routing scenarios. In this paper two solutions to this problem for certain network topologies are proposed. By using the notion of virtual coordinates a theoretical and a practical constructions are presented. A distributed algorithm for the practical approach is proposed.

On Applications of Wireless Sensor Networks

2009

Wireless Sensor Networks (WSN) are ad-hoc networks in which small independent sensor nodes have limited energy, computational resources and wireless communication capabilities. Recently, both academia and industry have shown great interest in the area of Wireless Sensor Networks. This paper focuses on the practical applications in commerce and feasible future employment of WSNs. Continued advances of wireless communication technologies have led to the following fields of applications: habitat and environmental monitoring, security of buildings and property, oil and gas installations, mines and tunnels, emergency medical care, military applications. In the near future WSNs will certainly ent…