Abstract. Some general properties of families of hash functions defined by strongly connected automata without output function over a finite ring are analyzed. The probabilities of random choice of a sequence with the given value of hash function, as well as of random choice of two different sequences of the same length with the same values of the hash function are computed. The computational security of investigated hash-functions is characterized.

Keywords: finite ring, automaton without output, hash function.