Quasigroup string processing: Part 4
Journal
Contributions, Section of Natural, Mathematical and Biotechnical Sciences
Date Issued
2017-03-08
Author(s)
Abstract
Given a finite alphabet A and a quasigroup
operation ∗ on the set A, in earlier paper of ours we have
defined the quasigroup transformation E : A
+ → A
+, where
A
+ is the set of all finite strings with letters from A. Here
we present several generalizations of the transformation E
and we consider the conditions under which the transformed
strings have uniform distributions of n-tuples of letters of A.
The obtained results can be applied in cryptography, coding
theory, defining and improving pseudo random generators,
and so on.
operation ∗ on the set A, in earlier paper of ours we have
defined the quasigroup transformation E : A
+ → A
+, where
A
+ is the set of all finite strings with letters from A. Here
we present several generalizations of the transformation E
and we consider the conditions under which the transformed
strings have uniform distributions of n-tuples of letters of A.
The obtained results can be applied in cryptography, coding
theory, defining and improving pseudo random generators,
and so on.
Subjects
File(s)![Thumbnail Image]()
Loading...
Name
5-9-1-SM.pdf
Size
207.77 KB
Format
Adobe PDF
Checksum
(MD5):78faca64103ac00332a550e976d06b7a