No abstract

Symmetric cryptography methods have an important role in security solutions design in data protection. In that context, symmetric cryptography algorithms and pseudo-random generators connected with them have strong influence on designed security solutions. In the computationally constrained environment, security efficiency is also important. In this paper we proposed the design of a new efficient pseudo-random generator parameterized by two pseudo-random sequences. By the probabilistic, information-theoretic and number theory methods we analyze characteristics of the generator. Analysis produced several results. We derived sufficient conditions, regarding parameterizing sequences, so that the output sequence has uniform distribution. Sufficient conditions under which there is no correlation between parameterizing sequences and output sequence are also derived. Moreover, it is shown that mutual information between the output sequence and parameterizing sequences tends to zero when the generated output sequence length tends to infinity. Regarding periodicity, it is shown that, with appropriately selected parameterizing sequences, the period of the generated sequence is significantly longer than the periods of the parameterizing sequences. All this characteristics are desirable regarding security applications. The efficiency of the proposed construction can be achieved by selection parameterizing sequences from the set of efficient pseudo-random number generators, for example, multiple linear feedback shift registers.

No abstract

Multi-sensor imaging systems using the global navigation satellite system (GNSS) and digital magnetic compass (DMC) for geo-referencing have an important role and wide application in long-range surveillance systems. To achieve the required system heading accuracy, the specific magnetic compass calibration and compensation procedures, which highly depend on the application conditions, should be applied. The DMC compensation technique suitable for the operation environment is described and different technical solutions are studied. The application of the swinging procedure was shown as a good solution for DMC compensation in a given application. The selected DMC was built into a system to be experimentally evaluated, both under laboratory and field conditions. The implementation of the compensation procedure and magnetic sensor integration in systems is described. The heading accuracy measurement results show that DMC could be successfully integrated and used in long-range surveillance systems providing required geo-referencing data.

This paper performs a comparative analysis of different watermarking techniques. Namely, in the last twenty-five years, a large number of algorithms for digital watermarking have been developed. In order to understand how different schemes can be applied it is important to define some criteria for classifying them. The algorithms are classified according to the characteristics of embedded watermarks and based on applications in which the watermark is built in. The robustness of the watermarks with respect to a different kind of attacks is also analyzed.

Introduction/purpose: The problem of efficient distribution of cryptographic keys in communication systems has existed since its first days and is especially emphasized by the emergence of mass communication systems. Defining and implementing efficient protocols for symmetric cryptographic keys establishment in such circumstances is of great importance in raising information security in cyberspace. Methods: Using the methods of Information Theory and Secure Multiparty Computation, protocols for direct establishment of cryptographic keys between communication parties have been defined. Results: The paper defines two new approaches to the problem of establishing cryptographic keys. The novelty in the protocol defined in the security model based on information theory is based on the source of common randomness, which in this case is the EEG signal of each subject participating in the communication system. Experimental results show that the amount of information leaking to the attacker is close to zero. A novelty in the second case, which provides security with keys at the level of computer security by applying Secure Multiparty Computation, is in the new application field, namely generation and distribution of symmetric cryptographic keys. It is characteristic of both approaches that within the framework of formal theories, it is possible to draw conclusions about their security characteristics in a formal way. Conclusions: The paper describes two new approaches for establishing cryptographic keys in symmetric cryptographic systems with experimental results. The significance of the proposed solutions lies in the fact that they enable the establishment of secure communication between communication parties from end to end, avoiding the influence of a trusted third party. In that way, the achieved communication level security significantly increases in relation to classical cryptographic systems.

No abstract

No abstract