Improving Existing Prsg Using QSP

Markovski, Jasen and Dimitrova, Vesna (2003) Improving Existing Prsg Using QSP. In: Proceedings of the Fourth Conference on Informatics and Information Technology. Institute of Informatics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 380-386. ISBN 9989-668-45-0

[img]
Preview
Text
9989-668-45-0_pp380-386.pdf

Download (422kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

Pseudo random sequence generators (PRSG) are deterministic algorithms that produce sequences of elements that imitate natural random behavior. Random sequences have extensive use in scientific experiments as input sequences for different kinds of simulators, in cryptography for preparation of keys and establishing communication, in authentication for preparation of identification numbers, smart cards, serial numbers, etc. For this reason the field of pseudo random generators is widely exploited. However, widely available PRSGs have limited periods (for example, 264), which mean that the pseudo random sequences start repeating the same elements (after at most 264 elements). This makes them inappropriate for large-scale scientific experiments, cryptography and authentication, because they produce predictable pseudo random output sequences. In this paper we will try to improve some of existing linear PRSGs using quasigroup sequence processing (QSP).

Item Type: Book Section
Uncontrolled Keywords: pseudo random sequence generator, quasigroup sequence processing, period of PRSG
Subjects: International Conference on Informatics and Information Technologies > Theoretical backgrounds of CS
Depositing User: Vangel Ajanovski
Date Deposited: 28 Oct 2016 00:15
Last Modified: 28 Oct 2016 00:15
URI: http://eprints.finki.ukim.mk/id/eprint/11141

Actions (login required)

View Item View Item