54 research outputs found
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
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
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
Quantitative Evaluation of Chaotic CBC Mode of Operation
The cipher block chaining (CBC) block cipher mode of operation presents a
very popular way of encrypting which is used in various applications. In
previous research work, we have mathematically proven that, under some
conditions, this mode of operation can admit a chaotic behavior according to
Devaney. Proving that CBC mode is chaotic is only the beginning of the study of
its security. The next step, which is the purpose of this paper, is to develop
the quantitative study of the chaotic CBC mode of operation by evaluating the
level of sensibility and expansivity for this mode.Comment: in International Conference on Advanced Technologies for Signal &
Images Processing ATSIP'2016 , Mar 2016, Monastir, Tunisi
A novel pseudo-random generator based on discrete chaotic iterations
International audienceSecurity 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
Suitability of chaotic iterations schemes using XORshift for security applications
International audienceThe design and engineering of original cryptographic solutions is a major concern to provide secure information systems. In a previous study, we have described a generator based on chaotic iterations, which uses the well-known XORshift generator. By doing so, we have improved the statistical performances of XORshift and make it behave chaotically, as defined by Devaney. The speed and security of this former generator have been improved in a second study, to make its usage more relevant in the Internet security context. In this paper, these contributions are summarized and a new version of the generator is introduced. It is based on a new Lookup Table implying a large improvement of speed. A comparison and a security analysis between the XORshift and these three versions of our generator are proposed, and various new 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
Theoretical Design and FPGA-Based Implementation of Higher-Dimensional Digital Chaotic Systems
Traditionally, chaotic systems are built on the domain of infinite precision
in mathematics. However, the quantization is inevitable for any digital
devices, which causes dynamical degradation. To cope with this problem, many
methods were proposed, such as perturbing chaotic states and cascading multiple
chaotic systems. This paper aims at developing a novel methodology to design
the higher-dimensional digital chaotic systems (HDDCS) in the domain of finite
precision. The proposed system is based on the chaos generation strategy
controlled by random sequences. It is proven to satisfy the Devaney's
definition of chaos. Also, we calculate the Lyapunov exponents for HDDCS. The
application of HDDCS in image encryption is demonstrated via FPGA platform. As
each operation of HDDCS is executed in the same fixed precision, no
quantization loss occurs. Therefore, it provides a perfect solution to the
dynamical degradation of digital chaos.Comment: 12 page
On the design of a family of CI pseudo-random number generators
Chaos and its applications in the field of secure communications have
attracted a lot of attention. Chaos-based pseudo-random number generators are
critical to guarantee security over open networks as the Internet. We have
previously demonstrated that it is possible to define such generators with good
statistical properties by using a tool called "chaotic iterations", which
depends on an iteration function. An approach to find update functions such
that the associated generator presents a random-like and chaotic behavior is
proposed in this research work. To do so, we use the vectorial Boolean negation
as a prototype and explain how to modify this iteration function without
deflating the good properties of the associated generator. Simulation results
and basic security analysis are then presented to evaluate the randomness of
this new family of generators.Comment: 4 pages, In WICOM'11, 7th Int. IEEE Conf. on Wireless Communications,
Networking and Mobile Computing, Wuhan, China, pages 1--4, September 201
- …