Related papers: Performance Analysis of a Keyed Hash Function base…

Consistent hashing (CH) has been pivotal as a data router and load balancer in diverse fields, including distributed databases, cloud infrastructure, and peer-to-peer networks. However, existing CH algorithms often fall short in…

It has been demonstrated earlier that universal computation is 'almost surely' chaotic. Machine learning is a form of computational fixed point iteration, iterating over the computable function space. We showcase some properties of this…

In recent years, a growing number of cryptosystems based on chaos have been proposed. But most of them encountered many problems such as small key space and weak security. In the present paper, a new kind of chaotic cryptosystem based on…

We propose a hash function based on arithmetic coding and public-key cryptography. The resistance of the hash function to second preimage attack, collision and differential cryptanalysis is based on the properties of arithmetic coding as a…

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…

Cayley hash functions are cryptographic hashes constructed from Cayley graphs of groups. The hash function proposed by Shpilrain and Sosnovski (2016), based on linear functions over a finite field, was proven insecure. This paper shows that…

Fundamental problems of periodicity and transient process to periodicity of chaotic trajectories in computer realization with finite computation precision is investigated by taking single and coupled Logistic maps as examples. Empirical…

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…

While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet…

Although hash function learning algorithms have achieved great success in recent years, most existing hash models are off-line, which are not suitable for processing sequential or online data. To address this problem, this work proposes an…

Given a set $S$ of $n$ distinct keys, a function $f$ that bijectively maps the keys of $S$ into the range $\{0,\ldots,n-1\}$ is called a minimal perfect hash function for $S$. Algorithms that find such functions when $n$ is large and retain…

Ensuring security is something that is not easily done as many of the demands of network security conflict with the demands of mobile networks, majorly because of the nature of the mobile devices (e.g. low power consumption, low processing…

Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet. In this paper we take another viewpoint and focus on combinatorial properties of long…

In recent years many chaotic cryptosystems based on Baptista's seminal work have been proposed. We analyze the security of two of the newest and most interesting ones, which use a dynamically updated look-up table and also work as stream…

Internet communication systems involving cryptography and data hiding often require billions of random numbers. In addition to the speed of the algorithm, the quality of the pseudo-random number generator and the ease of its implementation…

In this paper is proposed a novel steganographic scheme based on chaotic iterations. This research work takes place into the information hiding security fields. We show that the proposed scheme is stego-secure, which is the highest level of…

Lately, multimedia encryption has been the focus of attention in many researches. Recently, a large number of encryption algorithms has been presented to protect image contents.The main objective of modern image encryption schemes is to…

Recent cryptanalytic attacks have exposed the vulnerabilities of some widely used cryptographic hash functions like MD5 and SHA-1. Attacks in the line of differential attacks have been used to expose the weaknesses of several other hash…

This paper introduces a new watermarking algorithm based on discrete chaotic iterations. After defining some coefficients deduced from the description of the carrier medium, chaotic discrete iterations are used to mix the watermark and to…

Chaos-based approaches are frequently proposed in information hiding, but without obvious justification. Indeed, the reason why chaos is useful to tackle with discretion, robustness, or security, is rarely elucidated. This research work…