Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/23966| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Markovski, Smile | en_US |
| dc.contributor.author | Bakeva, Verica | en_US |
| dc.date.accessioned | 2022-10-31T11:32:37Z | - |
| dc.date.available | 2022-10-31T11:32:37Z | - |
| dc.date.issued | 2017-03-08 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/23966 | - |
| dc.description.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. | en_US |
| dc.relation.ispartof | Contributions, Section of Natural, Mathematical and Biotechnical Sciences | en_US |
| dc.subject | quasigroup, quasigroup string processing, uniform distribution | en_US |
| dc.title | Quasigroup string processing: Part 4 | en_US |
| dc.type | Journal Article | en_US |
| item.grantfulltext | open | - |
| item.fulltext | With Fulltext | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 5-9-1-SM.pdf | 207.77 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.