Models of Pseudonondeterministic Cryptographic Transformations

Abstract

The analyses of possible approaches of cryptographic transformation performance from the automata theory point of view are presented. The choice of pseudonondeterministic approach for cryptographic transformations implementation is grounded. The models of encryption and hashing are presented as instance of the approach implementation.