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 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.
Кандидат физико-математических наук, старший научный сотрудник отдела теории управляющих систем, Институт прикладной математики и механики НАН Украины, Донецк,
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.