A class of coders based on gsm (Q1323360)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A class of coders based on gsm |
scientific article; zbMATH DE number 567321
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of coders based on gsm |
scientific article; zbMATH DE number 567321 |
Statements
A class of coders based on gsm (English)
0 references
26 June 1994
0 references
Most cryptographic systems are based on number theory techniques and results. However, a quite promising approach is the use of formal theory machineries for cryptographic purposes. So, using the definition of gsm and finite translators, a new class of coders is proposed. In the first part it is shown that if \(M\) is a weakly-deterministic coder, then \(M^{-1}\) is also a coder. In the second part, this class of coders is used for solving a problem of secret selling of secrets.
0 references
cryptographic systems
0 references
finite translators
0 references
weakly-deterministic coder
0 references
secrets
0 references
