2,028 research outputs found
A Novel Pseudo-Random Number Generator Based on Multi-Objective Optimization for Image-Cryptographic Applications
Pseudo-random number generators (PRNGs) play an important role to ensure the
security and confidentiality of image cryptographic algorithms. Their primary
function is to generate a sequence of numbers that possesses unpredictability
and randomness, which is crucial for the algorithms to work effectively and
provide the desired level of security. However, traditional PRNGs frequently
encounter limitations like insufficient randomness, predictability, and
vulnerability to cryptanalysis attacks. To overcome these limitations, we
propose a novel method namely an elliptic curve genetic algorithm (ECGA) for
the construction of an image-dependent pseudo-random number generator (IDPRNG)
that merges elliptic curves (ECs) and a multi-objective genetic algorithm
(MOGA). The ECGA consists of two primary stages. First, we generate an EC-based
initial sequence of random numbers using pixels of a plain-image and parameters
of an EC, that depart from traditional methods of population initialization. In
our proposed approach, the image itself serves as the seed for the initial
population in the genetic algorithm optimization, taking into account the
image-dependent nature of cryptographic applications. This allows the PRNG to
adapt its behavior to the unique characteristics of the input image, leading to
enhanced security and improved resistance against differential attacks.
Furthermore, the use of a good initial population reduces the number of
generations required by a genetic algorithm, which results in decreased
computational cost. In the second stage, we use well-known operations of a
genetic algorithm to optimize the generated sequence by maximizing a
multi-objective fitness function that is based on both the information entropy
and the period of the PRNG. By combining elliptic curves and genetic
algorithms, we enhance the randomness and security of the ECGA.Comment: Keywords: Pseudo-random number generator, Elliptic curve, Genetic
algorithm, Multi-objective optimizatio
A novel pseudo-random number generator based on discrete chaotic iterations
Security of information transmitted through the Internet, against passive or
active attacks is an international concern. The use of a chaos-based
pseudo-random bit sequence to make it unrecognizable by an intruder, is a field
of research in full expansion. This mask of useful information by modulation or
encryption is a fundamental part of the TLS Internet exchange protocol. In this
paper, a new method using discrete chaotic iterations to generate pseudo-random
numbers is presented. This pseudo-random number generator has successfully
passed the NIST statistical test suite (NIST SP800-22). Security analysis shows
its good characteristics. The application for secure image transmission through
the Internet is proposed at the end of the paper.Comment: The First International Conference on Evolving Internet:Internet 2009
pp.71--76 http://dx.doi.org/10.1109/INTERNET.2009.1
A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking
In this paper, a new chaotic pseudo-random number generator (PRNG) is
proposed. It combines the well-known ISAAC and XORshift generators with chaotic
iterations. This PRNG possesses important properties of topological chaos and
can successfully pass NIST and TestU01 batteries of tests. This makes our
generator suitable for information security applications like cryptography. As
an illustrative example, an application in the field of watermarking is
presented.Comment: 11 pages, 7 figures, In WISM 2010, Int. Conf. on Web Information
Systems and Mining, volume 6318 of LNCS, Sanya, China, pages 202--211,
October 201
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.
Randomness Quality of CI Chaotic Generators: Applications to Internet Security
Due to the rapid development of the Internet in recent years, the need to
find new tools to reinforce trust and security through the Internet has became
a major concern. The discovery of new pseudo-random number generators with a
strong level of security is thus becoming a hot topic, because numerous
cryptosystems and data hiding schemes are directly dependent on the quality of
these generators. At the conference Internet`09, we have described a generator
based on chaotic iterations, which behaves chaotically as defined by Devaney.
In this paper, the proposal is to improve the speed and the security of this
generator, to make its use more relevant in the Internet security context. To
do so, a comparative study between various generators is carried out and
statistical results are given. Finally, an application in the information
hiding framework is presented, to give an illustrative example of the use of
such a generator in the Internet security field.Comment: 6 pages,6 figures, In INTERNET'2010. The 2nd Int. Conf. on Evolving
Internet, Valencia, Spain, pages 125-130, September 2010. IEEE Computer
Society Press Note: Best Paper awar
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
A Novel Chaotic Image Encryption using Generalized Threshold Function
In this paper, after reviewing the main points of image encryption and
threshold function, we introduce the methods of chaotic image encryption based
on pseudorandom bit padding that the bits be generated by the novel generalized
threshold function (segmentation and self-similarity) methods. These methods
decrease periodic effect of the ergodic dynamical systems in randomness of the
chaotic image encryption. The essential idea of this paper is that given
threshold functions of the ergodic dynamical systems. To evaluate the security
of the cipher image of this scheme, the key space analysis, the correlation of
two adjacent pixels and differential attack were performed. This scheme tries
to improve the problem of failure of encryption such as small key space and
level of security.Comment: 7 pages, 5 figures, Published in international Journal of Computer
Applications (March 2012
- …