Search

Two fractional chaotic maps, Lu and Chen fractional chaotic maps, have been analyzed using an innovative predictor-corrector method based on a non-uniform grid. An original chaotic law to control the grid size at each iteration has been introduced. The choice of the non-uniform grid was shown to play a fundamental role to obtain chaotic behavior for a larger fractional parameter range, while decreasing the computational time. The obtained results show that the complexity of the resulting fractional chaotic system in terms of Lyapunov exponents, Fourier transforms and chaos robustness is sensitive to the choice of the grid and can be considerably improved by the proposed method.

For both chaos-based stream ciphers and chaos-based block ciphers, key streams have a crucial influence on their security. A well designed pseudo-chaotic number generator (PCNG) that exhibits both chaotic properties and pseudo-randomness is a good candidate for creating the cryptographic key stream for encryption purposes. PCNGs are based on multiple chaotic maps. Since the majority of the chaotic maps are defined using real numbers, most of the proposed PCNGs use floating-point notations. However, this data type, especially the double-precision notation, has disadvantages of high computation cost and inefficient resource utilization. Also, the quantification errors may undermine the reliability of the produced key stream. To overcome these drawbacks, a key stream generation algorithm using a PCNG scheme is proposed in this paper. The PCNG is based on reformulated skew tent maps over a 32-bit integer field. It not only reduces the resource utilization from the hardware perspective, but also ensures the key stream performance over various operation platforms. Furthermore, the proposed PCNG uses a parameter changeable strategy, which can help to expand the key space, and thus increases the immunity against the brute-force attack. The quality of the key stream produced by the PCNG has been tested in a stream cipher. The analysis and the obtained test results have demonstrated that the proposed PCNG is secure and reliable to generate cryptographic key streams for encryption purposes.

Pseudo-chaotic number generators (PCNGs), designed based on multiple chaotic maps, have a significant influence on the security of chaos-based cryptosystems. Since the majority of the chaotic maps are based on real numbers, most of the proposed PCNGs use floating-point notations. However, this data type, especially the double precision notation, has disadvantages of high computation cost and inefficient resource utilization. Also, due to the high sensitivity of the chaotic systems and the finite precision nature of software and hardware platforms, the truncation or round-off errors may cause a big difference in the generated pseudo-chaotic numbers, which may undermine the PCNG's security reliability. To overcome these drawbacks, a new secure PCNG scheme based on the reformulated skew tent maps over a 32-bit integer field is proposed in this paper. It not only reduces the resource utilization from the hardware perspective, but also ensures the PCNG's performance over various operation platforms. Furthermore, the proposed PCNG uses a parameter changeable strategy, which expands the key space of the cryptosystem that adopts the PCNG, and thus increases the immunity against the brute-force attack. The security and statistical test results have demonstrated that the proposed PCNG has reliable security properties with good randomness and it is suitable for cryptographic applications.

In this paper, we focus on the design of fractional pseudo-chaotic random number generator (FPCRNG) based on the coupling of fractional chaotic systems. The proposed FPCRNG is composed of 3 fractional chaotic systems, including one fractional generalized double-humped logistic system, two 3D fractional systems Chen's system and Lu's system, and one classical skew-tent map. A non-uniform grid calculation method is employed by introducing the skew-tent map into the numerical calculation of the states of the Chen's system and Lu's system to obtain greater chaoticity in terms of Lyapunov exponent. The XOR (exclusive-or) operations are applied to the fractional systems to obtain the final pseudo-chaotic outputs. The security analysis and statistical experiment of a stream cipher implementing the FPCRNG prove that the proposed structure is effective and can be used in the cryptosystem.

In this paper, we design, realize and evaluate a new secure cryptosystem based on a Pseudo-Chaotic Number Generator(PCNG), a global diffusion and a block cipher in Cipher Block Chaining(CBC) mode. The proposed PCNG, defined over a finite field, is based on a discrete Chebyshev map coupled with a Pseudo-Random Number Generator(PRNG) and a discrete skew tent map. Our PCNG can remove a hidden danger of deteriorated security caused by the dynamical degradation encountered in numerical implementation of chaotic maps defined on real numbers. The global diffusion uses a Horizontal Addition Diffusion(HAD) and a Vertical Addition Diffusion(VAD) followed by a modified 2-D cat map. The block cipher in CBC mode is based on a confusion layer using the AES S-Box, followed by a diffusion layer built on the modified 2-D cat map and a key addition operation. The global diffusion enhances the diffusion process of the block cipher. Conducted security analysis and the obtained results have proven that the proposed cryptosystem design is robust with high security and that it can be applied to practical implementations.

International audience

The aim of the paper is to reveal false names of accounts as a result of hackers attacks. The probability a given account to be either false or actual is calculated using methods for machine learning analysis. The suspected account will be used as a pattern and by classification techniques clusters will be formed with a respective probability this name to be false. The purpose of investigation is to determine if there exists a trend, which arises during the creation of new accounts, to detect the false ones and to discriminate them from the real ones independently of that if two types of accounts are generated with the same speed. These security systems are applied in different areas, where the security of the data in users' accounts is required. For example, they can be used in on-line voting for balloting, in studying the social opinion by inquiries, in protection of the information in different user accounts of given system etc.

In this paper an improved Lozi system speed performance is achieved in application to chaotic switched model. Generally speaking, the main advantage of the switched encryption model is its robustness to the noise, while the main drawback is the slow processing speed. In this article we propose to gain model productivity by adjusting parameter in Lozi chaotic generator. Chaos generator is sensitive to any structure, therefore the solution shouldn’t influence the pseudo randomness which is required for encryption. We provide the results of switched chaotic model based on Lozi chaotic generator with changeable parameter studied for chaoticity and pseudo-randomness with NIST, largest Lyapunov exponent, auto-correlation, cross-correlation and cumulative distribution.

The increasing number of e-transactions requires more secure and innovative schemes for secure information storage and transmission. Since the encryption should be unique for each transaction, there is a big necessity of new generators of very huge numbers of encryption keys, and chaotic random number generators seem to be perfectly suitable for this application. In this paper a new robust, gigaperiodic and simple in implementation chaotic generator is proposed. The generator construction is based on the principle of ring-coupling. The proposed chaotic generator successfully passed statistical and analytical tests: NIST, largest Lyapunov exponent, autocorrelation, cross-correlation, uniform distribution. For the best precision of uniform distribution, approximate density function has been applied, the distribution errors are analyzed by written software. The resulting chaotic system promises the designed robust implementation to cryptosystems.

This paper deals with chaotic cryptosystem and observer-based chaotic synchronization of Lozi chaotic generator for secure information transmission. Increasing the size of the secret key has been achieved thanks to the G-interval parameter method for observability analysis of a Lozi chaotic generator.

Bandpass sigma-delta modulation is a technique used to convert high-frequency narrowband electronic signals from analog form to digital, or vice versa. It is a fundamentally nonlinear technique, and therefore can be analyzed only approximately by application of linear analysis. The aim of this work is to present certain results concerning the dynamical behavior of bandpass sigma-delta modulators with zero input based on application of methods of nonlinear dynamics and noninvertible map theory. We will consider the effect of certain circuit imperfections on the behavior of the system, and will also consider the effect of operating in a chaotic regime. While many of our results arise from application of standard methods of nonlinear dynamics, we will emphasize in particular those results that can be obtained by application of the critical lines tool of Mira. The paper, therefore, has two aims: To investigate the nonlinear behavior of bandpass sigma-delta modulators and to provide a demonstration of the applicability of the critical lines tool to a system of engineering importance.

International audience; In this paper an improved chaotic switching algorithm based on modified Lozi system is applied. Generally speaking, the main advantage of the switched encrypted model is its robustness to the noise, while the main drawback is the slow processing speed. In this article we propose to gain model productivity by adjusting parameter in Lozi chaotic generator. Chaos generator is sensitive to any structure, therefore the solution shouldn't influence the pseudo randomness which is required for encryption. We provide the results of switched chaotic model based on Lozi chaotic generator with changeable parameter studied for chaoticity and pseudo-randomness with NIST, largest Lyapunov exponent, auto-correlation, cross-correlation and cumulative distribution.

International audience; The modified Lozi system is analyzed as chaotic PRNG and synchronized via observers. The objective of the study is to investigate chaotic-based encryption method that preserves CSK model advantages, but improves the security level. The CSK model have been discussed to message encryption because it implies better resistance against noise, but there are many evidences of the model weaknesses. The investigation provides the original CSK model analyses of secure message transmission over the communication channel by examining identifiability and observability; switched regimes detection; sensitivity to initial conditions and session key; NIST tests of the encrypted signal; correlation between wrong decrypted messages; system ergodicity. The proposed model has a significant effect on the security level of the transmitted signal that successfully passed chaotic and randomness tests. The results suggest that the original CSK model can be used for information security applications.