Analysis of families of hash functions defined by automata over a finite ring

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 randomly choosing a sequence for which a hash function assumes a given value and also two different sequences of the same length for which the values of a hash function coincide. The computational security of the investigated hash-functions is characterized.