SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS

The algorithms for constructing generalized primitive matrices Galois and Fibonacci arbitrary order , the items belong to the prime field , . The examples of application of these matrices in the problems of the synthesis of generalized linear shift register with linear feedback and matrix analogue...

Full description

Bibliographic Details
Main Authors: A.J. Beletsky, А.А. Beletsky
Format: Article
Language:English
Published: Kherson State University 2012-10-01
Series:Ìnformacìjnì Tehnologìï v Osvìtì
Subjects:
Online Access:http://ite.kspu.edu/webfm_send/343
id doaj-a55bc0486dac43a6ad674ec318fb65db
record_format Article
spelling doaj-a55bc0486dac43a6ad674ec318fb65db2020-11-24T22:34:49ZengKherson State UniversityÌnformacìjnì Tehnologìï v Osvìtì1998-69392306-17072012-10-01132343SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONSA.J. BeletskyА.А. BeletskyThe algorithms for constructing generalized primitive matrices Galois and Fibonacci arbitrary order , the items belong to the prime field , . The examples of application of these matrices in the problems of the synthesis of generalized linear shift register with linear feedback and matrix analogue Diffie-Hellman.http://ite.kspu.edu/webfm_send/343generators of pseudorandom sequencesirreducible and primitive polynomialsprimitive matricesprotocol exchange encryption keys.
collection DOAJ
language English
format Article
sources DOAJ
author A.J. Beletsky
А.А. Beletsky
spellingShingle A.J. Beletsky
А.А. Beletsky
SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
Ìnformacìjnì Tehnologìï v Osvìtì
generators of pseudorandom sequences
irreducible and primitive polynomials
primitive matrices
protocol exchange encryption keys.
author_facet A.J. Beletsky
А.А. Beletsky
author_sort A.J. Beletsky
title SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
title_short SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
title_full SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
title_fullStr SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
title_full_unstemmed SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
title_sort synthesis of primitive matrices over a finite galois fields and their applications
publisher Kherson State University
series Ìnformacìjnì Tehnologìï v Osvìtì
issn 1998-6939
2306-1707
publishDate 2012-10-01
description The algorithms for constructing generalized primitive matrices Galois and Fibonacci arbitrary order , the items belong to the prime field , . The examples of application of these matrices in the problems of the synthesis of generalized linear shift register with linear feedback and matrix analogue Diffie-Hellman.
topic generators of pseudorandom sequences
irreducible and primitive polynomials
primitive matrices
protocol exchange encryption keys.
url http://ite.kspu.edu/webfm_send/343
work_keys_str_mv AT ajbeletsky synthesisofprimitivematricesoverafinitegaloisfieldsandtheirapplications
AT aabeletsky synthesisofprimitivematricesoverafinitegaloisfieldsandtheirapplications
_version_ 1725725938159714304