Models of Cryptography Transformations Based on Quasigroups.
Keywords:
Algebra, automaton, cryptography, pseudonondeterministic, semigroupsAbstract
It is intuitively obvious, that usage of unknown cryptographic transformations should be more secure against breaking, than usage of known ones. Modern cryptography approaches alters that statements reasoning, that the transformation infeasibility of breaking should be visible for customers for the verification sake. Consequently, the task of this transformation modeling to find the way out of the contradictive conditions arose.
References
J. A. Anderson , Discrete Mathematics with Combinatorics, Prentice Hall, Upper Saddle River, New Jersey, 2004, 960.
V. Luzhetskyi, Y. Baryshev and V. Derech Pseudonondeterministic Approach of Control Systems Cryptographic Protection, Information Technology in Selected Areas of Management 2017, AGH University of Science and Technology Press, Krakow, 2018, 25-39.
V. Luzhetskyi and Y. Baryshev Data-driven Pseudonondeterministic Hashing Constructions, Problems of Infocommunications Science and Technology (PIC S&T), Kharkiv, 2016, 114z-116..
