2000 character limit reached
Hash functions using chaotic iterations (1702.02489v1)
Published 8 Feb 2017 in cs.CR
Abstract: In this paper, a novel formulation of discrete chaotic iterations in the field of dynamical systems is given. Their topological properties are studied: it is mathematically proved that, under some conditions, these iterations have a chaotic behavior in the meaning of Devaney. This chaotic behavior allows us to propose a way to generate new hash functions. An illustration example is detailed in order to show how to use our theoretical study in practice.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.