PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS
In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS) with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR) of maximum period with...
Saved in:
Main Authors: | A. Beletsky (Author), E. Beletsky (Author) |
---|---|
Format: | Book |
Published: |
Kherson State University,
2014-04-01T00:00:00Z.
|
Subjects: | |
Online Access: | Connect to this object online. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
SYNTHESIS OF PRIMITIVE MATRICES OVER A FINITE GALOIS FIELDS AND THEIR APPLICATIONS
by: A.J. Beletsky, et al.
Published: (2012) -
GENERALIZED MATRIXES OF GALOIS PROTOCOLS EXCHANGE ENCRYPTION KEYS
by: Anatoly Beletsky
Published: (2016) -
THE TABULAR OF CRYPTOGRAPHIC PRIMITIVES OF NONLINEAR SUBSTITUTIONS
by: A. Beletsky
Published: (2015) -
(k,n,f) - Arcs in Galois Plane of Order Five
by: Ban A. Q
Published: (2006) -
The Symmetrical Block Rsb-32 Encryption Algorithm With Dynamic Encryption Settings.
by: A. Beletsky, et al.
Published: (2009)