Page 152 - ISCI’2017

Chapter 6

A PSEUDORANDOM SEQUENCES GENERATOR BASED ON THE

MULTIMODULO TRANSFORMATION

Yuriy I. Gorbenko
Department of Information Systems and Technologies Security, V.N. Karazin Kharkiv National

University, Svobody sq., 4, Kharkov, 61022, Ukraine;

gorbenkou@iit.kharkov.ua

Tetiana A. Grinenko
Kharkiv National University of Radio Electronics, Nauka Ave, 14, Kharkov, 61166, Ukraine

t_lame@mail.ru

Oleksii P. Nariezhnii

V.N. Karazin Kharkiv National University, Svobody sq., 4, Kharkov, 61022, Ukraine
narlexa69@mail.ru

Abstract
Main theoretical statements and practical research results of pseudorandom sequences over arbitrary alphabet
generation based on multimodulo transformation in the finite field GF(p ) are given, results of properties analysis on
n
distinguishing, unpredictability, irreversibility, repetition period and complexity (performance) are brought.

Key words: pseudorandom sequence, pseudorandom sequence generator, multimodulo transformation, Galois field,
distinguishing, unpredictability, irreversibility, repetition period, complexity.

Introduction

The keys management tools are important components of cryptography systems, which

characteristics and properties on, depend their resistance and the level of security in whole. At the

different stages of key management it is needed to generate key data, key information and different
options, having quite complex properties requirements. In practice, depending on the requirements,

two methods are applied for key generation, based on random and pseudorandom sequences (PRS),
which are brought about in the form of corresponding cryptographic tools.

152