Next Article in Journal
Computer-Aided Diagnosis of Multiple Sclerosis Using a Support Vector Machine and Optical Coherence Tomography Features
Previous Article in Journal
Location of Moving Targets in Substation Non-Line-of-Sight Environment
Previous Article in Special Issue
Crowdsourced Security Reconstitution for Wireless Sensor Networks: Secrecy Amplification
Open AccessArticle

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

1
VLATACOM Institute, 11070 Belgrade, Serbia
2
Singidunum University, 11000 Belgrade, Serbia
*
Author to whom correspondence should be addressed.
Current address: Milutina Milankovića Boulevard 5, Belgrade, Serbia.
Sensors 2019, 19(23), 5322; https://doi.org/10.3390/s19235322
Received: 31 October 2019 / Revised: 19 November 2019 / Accepted: 27 November 2019 / Published: 3 December 2019
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. View Full-Text
Keywords: pseudo-random generator; security; wireless sensor networks; IoT; probability distribution; correlation; information leakage pseudo-random generator; security; wireless sensor networks; IoT; probability distribution; correlation; information leakage
Show Figures

Figure 1

MDPI and ACS Style

Unkašević, T.; Banjac, Z.; Milosavljević, M. A Generic Model of the Pseudo-Random Generator Based on Permutations Suitable for Security Solutions in Computationally-Constrained Environments. Sensors 2019, 19, 5322.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop