Related papers: A topological chaos framework for hash functions
We prove that multiplicative chaos measures can be constructed from extreme level sets or thick points of the underlying logarithmically correlated field. We develop a method which covers the whole subcritical phase and only requires…
We examine whether the chaotic behavior of classical systems with a limited number of degrees of freedom can produce quantum dephasing, against the conventional idea that dephasing takes place only in large systems with a huge number of…
The most exciting recent development in nonlinear dynamics is realization that chaos can be useful. One application involves "Secure Communication". Two piecewise linear systems with switching nonlinearities have been taken as chaos…
Chaotic behavior of quantum systems can be characterized by the adherence of the expectation values of given probes to moments of the Haar distribution. In this work, we analyze the behavior of several probes of chaos using a technique…
Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical. Here we survey recent results on how simple hashing…
The orbits of fluid particles in two dimensions effectively act as topological obstacles to material lines. A spacetime plot of the orbits of such particles can be regarded as a braid whose properties reflect the underlying dynamics. For a…
A new framework for information hiding security, called chaos-security, has been proposed in a previous study. It is based on the evaluation of unpredictability of the scheme, whereas existing notions of security, as stego-security, are…
This work redefines the framework of chaos in dynamical systems by extending Devaney's definition to multiple mappings, emphasizing the pivotal role of nonlinearity. We propose a novel theorem demonstrating how nonlinear dynamics within a…
Haskell functions are defined as a series of clauses consisting of patterns that are matched against the arguments in the order of definition. In case an input is not matched by any of the clauses, an error occurs. Therefore it is desirable…
In chaotic deterministic systems, seemingly stochastic behavior is generated by relatively simple, though hidden, organizing rules and structures. Prominent among the tools used to characterize this complexity in 1D and 2D systems are…
Category computation theory deals with a web-based systemic processing that underlies the morphic webs, which constitute the basis of categorial logical calculus. It is proven that, for these structures, algorithmically incompressible…
In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical $\epsilon$-universal hash…
This paper establishes some criteria of chaos in non-autonomous discrete systems. Several criteria of strong Li-Yorke chaos are given. Based on these results, some criteria of distributional chaos in a sequence are established. Moreover,…
Perfect hash functions can potentially be used to compress data in connection with a variety of data management tasks. Though there has been considerable work on how to construct good perfect hash functions, there is a gap between theory…
Theoretical foundations of compositional reasoning about heaps in imperative programming languages are investigated. We introduce a novel concept of compositional symbolic memory and its relevant properties. We utilize these formal…
Most existing approaches to hashing apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of the method to respond to the…
A function $f : U \to \{0,\ldots,n-1\}$ is a minimal perfect hash function for a set $S \subseteq U$ of size $n$, if $f$ bijectively maps $S$ into the first $n$ natural numbers. These functions are important for many practical applications…
Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the…
Deep hashing enables image retrieval by end-to-end learning of deep representations and hash codes from training data with pairwise similarity information. Subject to the distribution skewness underlying the similarity information, most…
In this paper, we study the chaotic behavior of a discrete-time linear inclusion.