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

DOI10.1007/S10559-013-9502-7zbMath1316.94088OpenAlexW2065106451MaRDI QIDQ465937

V. V. Skobelev

Publication date: 24 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-013-9502-7

zbMATH Keywords

hash functionfinite ringautomaton without output

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60)

Related Items (2)

Statistically equivalent mappings of finite sets ⋮ Automata over abstract finite quasigroups

Cites Work

• Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\)
• On the complexity of analysis of automata over a finite ring
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of families of hash functions defined by automata over a finite ring