A Generic Model of the Pseudo-Random Generator Based on Permutations Suitable for Security Solutions in Computationally-Constrained Environments

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.

Protocols for symmetric secret key establishment: Modern approach

“…Solutions based on the above proposals give users complete autonomy and end-to-end security protection. The applicability of solutions of this type allows -Direct establishment of cryptographic keys between communication sites, people or machines, without the mediation of a trusted third party, -Application of secure symmetric cryptographic algorithms in mass communication systems, IoT and WSN (Unkašević et al, 2019), -Simplification of the complexity of security systems thus facilitating their administration, and -By simplifying the complexity and administration of security systems, facilitation of their analysis, potential weaknesses detection and, overall, an in-crease of their security.…”

Ідентифікація Віддалених Користувачів З Нульовим Розголошенням З Використанням Псевдовипадкових Послідовностей

“…Cryptography uses generators that remember the state, non-linear Boolean functional transformations of the transition to the next state, and the formation of the output bit. In other words, the generator circuit fits into the well-known abstract automaton model [15]. The fundamental point here is that the Boolean functional transformations used have high nonlinearity and meet the criterion of the avalanche effect.…”

Security and Privacy in Wireless Sensor Networks: Advances and Challenges

“…It is the natural choice to use a symmetric algorithm due to its complexity. Reference [1] presents a generic model of the pseudo-random generator in computationally constrained environments. It can be applied to stream cryptography algorithms, as a subgroup of symmetric cryptography algorithms, in WSN and the Internet of Things (IoT).…”