SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
DOI:
https://doi.org/10.14308/ite000341Keywords:
generators of pseudorandom sequences, irreducible and primitive polynomials, primitive matrices, protocol exchange encryption keysAbstract
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.
Downloads
Download data is not yet available.
Downloads
Published
28.06.2012
Issue
Section
Articles
License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
How to Cite
SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS. (2012). Journal of Information Technologies in Education (ITE), 13, 023-043. https://doi.org/10.14308/ite000341
