Non-Binary Pseudorandom Number Generators For Information Security Purposes

The paper considers non-binary pseudorandom number generators (PRNG) on the non-linear feedback shift registers (NLFSR). The schemes of p-ary NLFSR are given that create a sequence of length S ≤ pN, where N is a degree of a primitive polynomial over GF(p)). In addition, the scheme of the universal N...

Full description

Saved in:
Bibliographic Details
Published inProcedia computer science Vol. 123; pp. 203 - 211
Main Authors Ivanov, M.A., Roslyj, E.B., Starikovskiy, A.V., Krasnikova, S.A., Shevchenko, N.A., Shustova, L.I.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2018
Subjects
NLFSR
Pseudorandom Number Generator
Tail
Universal NLFSR
NLFSR
Universal NLFSR
Pseudorandom Number Generator
Tail
Online AccessGet full text

Cover

More Information
Summary:The paper considers non-binary pseudorandom number generators (PRNG) on the non-linear feedback shift registers (NLFSR). The schemes of p-ary NLFSR are given that create a sequence of length S ≤ pN, where N is a degree of a primitive polynomial over GF(p)). In addition, the scheme of the universal NLFSR is given, which generates, depending on configuration, the sequences of any period including the maximum possible for a given amount of memory elements. The peculiarity of the considered NLFSR is the presence of pre-period (tail). The devices can be used as building blocks when constructing of unpredictable PRNG.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2018.01.032