A topological chaos framework for hash functions
Abstract
This paper presents a new procedure of generating hash functions which can be evaluated using some mathematical tools. This procedure is based on discrete chaotic iterations. First, it is mathematically proven, that these discrete chaotic iterations can be considered as a particular case of topological chaos. Then, the process of generating hash function based on the topological chaos is detailed. Finally it is shown how some tools coming from the domain of topological chaos can be used to measure quantitatively and qualitatively some desirable properties for hash functions. An illustration example is detailed in order to show how one can create hash functions using our theoretical study. Key-words : Discrete chaotic iterations. Topological chaos. Hash function
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.