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 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.