3,588 research outputs found
Yet Another Pseudorandom Number Generator
We propose a novel pseudorandom number generator based on R\"ossler attractor
and bent Boolean function. We estimated the output bits properties by number of
statistical tests. The results of the cryptanalysis show that the new
pseudorandom number generation scheme provides a high level of data security.Comment: 5 pages, 7 figures; to be published in International Journal of
Electronics and Telecommunications, vol.63, no.
Improving random number generators by chaotic iterations. Application in data hiding
In this paper, a new pseudo-random number generator (PRNG) based on chaotic
iterations is proposed. This method also combines the digits of two XORshifts
PRNGs. The statistical properties of this new generator are improved: the
generated sequences can pass all the DieHARD statistical test suite. In
addition, this generator behaves chaotically, as defined by Devaney. This makes
our generator suitable for cryptographic applications. An illustration in the
field of data hiding is presented and the robustness of the obtained data
hiding algorithm against attacks is evaluated.Comment: 6 pages, 8 figures, In ICCASM 2010, Int. Conf. on Computer
Application and System Modeling, Taiyuan, China, pages ***--***, October 201
Discrete-Time Chaotic-Map Truly Random Number Generators: Design, Implementation, and Variability Analysis of the Zigzag Map
In this paper, we introduce a novel discrete chaotic map named zigzag map
that demonstrates excellent chaotic behaviors and can be utilized in Truly
Random Number Generators (TRNGs). We comprehensively investigate the map and
explore its critical chaotic characteristics and parameters. We further present
two circuit implementations for the zigzag map based on the switched current
technique as well as the current-mode affine interpolation of the breakpoints.
In practice, implementation variations can deteriorate the quality of the
output sequence as a result of variation of the chaotic map parameters. In
order to quantify the impact of variations on the map performance, we model the
variations using a combination of theoretical analysis and Monte-Carlo
simulations on the circuits. We demonstrate that even in the presence of the
map variations, a TRNG based on the zigzag map passes all of the NIST 800-22
statistical randomness tests using simple post processing of the output data.Comment: To appear in Analog Integrated Circuits and Signal Processing (ALOG
Deciphering a novel image cipher based on mixed transformed Logistic maps
Since John von Neumann suggested utilizing Logistic map as a random number
generator in 1947, a great number of encryption schemes based on Logistic map
and/or its variants have been proposed. This paper re-evaluates the security of
an image cipher based on transformed logistic maps and proves that the image
cipher can be deciphered efficiently under two different conditions: 1) two
pairs of known plain-images and the corresponding cipher-images with
computational complexity of ; 2) two pairs of chosen plain-images
and the corresponding cipher-images with computational complexity of ,
where is the number of pixels in the plain-image. In contrast, the required
condition in the previous deciphering method is eighty-seven pairs of chosen
plain-images and the corresponding cipher-images with computational complexity
of . In addition, three other security flaws existing in most
Logistic-map-based ciphers are also reported.Comment: 10 pages, 2 figure
Breaking an image encryption algorithm based on chaos
Recently, a chaos-based image encryption algorithm called MCKBA (Modified
Chaotic-Key Based Algorithm) was proposed. This paper analyzes the security of
MCKBA and finds that it can be broken with a differential attack, which
requires only four chosen plain-images. Performance of the attack is verified
by experimental results. In addition, some defects of MCKBA, including
insensitivity with respect to changes of plain-image/secret key, are reported.Comment: 10 pages, 4 figure
- …