相关论文: Cryptographic Pseudo-Random Sequences from the Cha…

This paper analyzes security performance of an image encryption algorithm using 2D lag-complex Logistic map (LCLM), which adopts it as a pseudo-random number generator, and uses the sum of all pixel values of the plain-image as its initial…

We introduce a new measure of information-theoretic secrecy based on rate-distortion theory and study it in the context of the Shannon cipher system. Whereas rate-distortion theory is traditionally concerned with a single reconstruction…

This paper proposes three different chaotic encryption methods using 1-D chaotic map known as Logistic map named as Logistic, NLFSR and Modified NLFSR according to the name of chaotic map and non-linear function involved in the scheme. The…

We apply the method of spectral sequences to study classical problems in analysis. We illustrate the method by finding polynomial vector fields that commute with a given polynomial vector field and finding integrals of polynomial…

The combinative applications of one-way coupled map lattice (OCML) and some simple algebraic operations have demonstrated to be able to construct the best known chaotic cryptosystem with high practical security, fast encryption speed, and…

Randomness extraction is an essential post-processing step in practical quantum cryptography systems. When statistical fluctuations are taken into consideration, the requirement of large input data size could heavily penalise the speed and…

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

We studied the statistical properties of a quantum system in the pseudo-integrable regime through the gap ratios between consecutive energy levels of the scattering spectra. A two-dimensional quantum billiard containing a point-like…

The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…

This paper is the second in a series of two, and describes the current state of the art in modelling and prediction of chaotic time series. Sampled data from deterministic non-linear systems may look stochastic when analysed with linear…

This letter introduces a framework for the automatic generation of hardware cores for Artificial Neural Network (ANN)-based chaotic oscillators. The framework trains the model to approximate a chaotic system, then performs design space…

It is an important fact that extremal discrete structures -- that is, discrete structures of maximal size among those that avoid certain configurations -- exhibit strong pseudorandom behavior. We present instances of this phenomenon in the…

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 we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every…

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…

We suggest a method for generation of random binary sequences with prescribed correlation properties. It is based on a kind of modification of the widely used convolution method of constructing continuous random processes. Apart from the…

A chaotic modulation scheme is an efficient wideband communication method. It utilizes the deterministic chaos to generate pseudo-random carriers. Chaotic bifurcation parameter modulation is one of the well-known and widely-used techniques.…

With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generators (PRNGs) are fundamental in cryptosystems and information…

The ability to hide information from unauthorized individuals has been a prevalent issue over the years. Countless algorithms such as DES, AES and SHA have been developed. These algorithms depend on varying key length and key management…

We propose a flexible procedure for large-scale image search by hash functions with kernels. Our method treats binary codes and pairwise semantic similarity as latent and observed variables, respectively, in a probabilistic model based on…