55 research outputs found
Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata
Cryptographic hash functions have recently brought an exceptional research interest. With the increasing number of attacks against the widely used functions as MD5, SHA-1 and RIPEMD, the need to consider new hash functions design and conception strategies becomes crucial. In this paper, we propose a fast and efficient hash function using programmable cellular automata that are very suitable for cryptographic applications due to their chaotic and complex behavior derived from simple rules interaction. The proposed function is evaluated using several statistical tests, while obtained results demonstrate very admissible cryptographic properties such as confusion/diffusion capability and high sensitivity to input changes. Furthermore, the hashing scheme can be easily implemented through software or hardware, so it provides very competitive running performances
Designing substitution boxes based on chaotic map and globalized firefly algorithm
Cipher strength mainly depends on the robust structure and a well-designed interaction of the components in its framework. A significant component of a cipher system, which has a significant influence on the strength of the cipher system, is the substitution box or S-box. An S-box is a vital and most essential component of the cipher system due to its direct involvement in providing the system with resistance against certain known and potential cryptanalytic attacks. Hence, research in this area has increased since the late 1980s, but there are still several issues in the design and analysis of the S-boxes for cryptography purposes. Therefore, it is not surprising that the design of suitable S-boxes attracts a lot of attention in the cryptography community. Nonlinearity, bijectivity, strict avalanche criteria, bit independence criteria, differential probability, and linear probability are the major required cryptographic characteristics associated with a strong S-box. Different cryptographic systems requiring certain levels of these security properties. Being that S- boxes can exhibit a certain combination of cryptographic properties at differing rates, the design of a cryptographically strong S-box often requires the establishment of a trade-off between these properties when optimizing the property values. To date, many S-boxes designs have been proposed in the literature, researchers have advocated the adoption of metaheuristic based S-boxes design. Although helpful, no single metaheuristic claim dominance over their other countermeasure. For this reason, the research for a new metaheuristic based S-boxes generation is still a useful endeavour. This thesis aim to provide a new design for 8 Ă— 8 S-boxes based on firefly algorithm (FA) optimization. The FA is a newly developed metaheuristic algorithm inspired by fireflies and their flash lighting process. In this context, the proposed algorithm utilizes a new design for retrieving strong S- boxes based on standard firefly algorithm (SFA). Three variations of FA have been proposed with an aim of improving the generated S-boxes based on the SFA. The first variation of FA is called chaotic firefly algorithm (CFA), which was initialized using discrete chaotic map to enhance the algorithm to start the search from good positions. The second variation is called globalized firefly algorithm (GFA), which employs random movement based on the best firefly using chaotic maps. If a firefly is brighter than its other counterparts, it will not conduct any search. The third variation is called globalized firefly algorithm with chaos (CGFA), which was designed as a combination of CFA initialization and GFA. The obtained result was compared with a previous S-boxes based on optimization algorithms. Overall, the experimental outcome and analysis of the generated S-boxes based on nonlinearity, bit independence criteria, strict avalanche criteria, and differential probability indicate that the proposed method has satisfied most of the required criteria for a robust S-box without compromising any of the required measure of a secure S-box
Artificial Intelligence for the design of symmetric cryptographic primitives
Algorithms and the Foundations of Software technolog
A novel symmetric image cryptosystem resistant to noise perturbation based on S8 elliptic curve S-boxes and chaotic maps
The recent decade has seen a tremendous escalation of multimedia and its applications. These modern applications demand diverse security requirements and innovative security platforms. In this manuscript, we proposed an algorithm for image encryption applications. The core structure of this algorithm relies on confusion and diffusion operations. The confusion is mainly done through the application of the elliptic curve and S8 symmetric group. The proposed work incorporates three distinct chaotic maps. A detailed investigation is presented to analyze the behavior of chaos for secure communication. The chaotic sequences are then accordingly applied to the proposed algorithm. The modular approach followed in the design framework and integration of chaotic maps into the system makes the algorithm viable for a variety of image encryption applications. The resiliency of the algorithm can further be enhanced by increasing the number of rounds and S-boxes deployed. The statistical findings and simulation results imply that the algorithm is resistant to various attacks. Moreover, the algorithm satisfies all major performance and quality metrics. The encryption scheme can also resist channel noise as well as noise-induced by a malicious user. The decryption is successfully done for noisy data with minor distortions. The overall results determine that the proposed algorithm contains good cryptographic properties and low computational complexity makes it viable to low profile applications
Chaos and Cellular Automata-Based Substitution Box and Its Application in Cryptography
Substitution boxes are the key factor in symmetric-key cryptosystems that determines their ability to resist various cryptanalytic attacks. Creating strong substitution boxes that have multiple strong cryptographic properties at the same time is a challenging task for cryptographers. A significant amount of research has been conducted on S-boxes in the past few decades, but the resulting S-boxes have been found to be vulnerable to various cyberattacks. This paper proposes a new method for creating robust S-boxes that exhibit superior performance and possess high scores in multiple cryptographic properties. The hybrid S-box method presented in this paper is based on Chua’s circuit chaotic map, two-dimensional cellular automata, and an algebraic permutation group structure. The proposed 16×16
S-box has an excellent performance in terms of security parameters, including a minimum nonlinearity of 102, the absence of fixed points, the satisfaction of bit independence and strict avalanche criteria, a low differential uniformity of 5, a low linear approximation probability of 0.0603, and an auto-correlation function of 28. The analysis of the performance comparison indicates that the proposed S-box outperforms other state-of-the-art S-box techniques in several aspects. It possesses better attributes, such as a higher degree of inherent security and resilience, which make it more secure and less vulnerable to potential attacks
On the design of stream ciphers with Cellular Automata having radius = 2
Cellular Automata (CA) have recently evolved as a good cryptographic primitive. It plays an important role in the construction of new fast, efficient and secure stream ciphers. Several studies have been made on CA based stream ciphers and we observe that the cryptographic strength of a CA based stream cipher increases with the increase in the neighbourhood radii if appropriate CA rules are employed. The current work explores the cryptographic feasibility of 5-neighbourhood CA rules also referred to as pentavalent rules. A new CA based stream cipher, CARPenter, which uses pentavalent rules have been proposed. The cipher incorporates maximum length null-boundary linear CA and a non-linear CA along with a good non-linear mixing function. This is implemented in hardware as well as software and exhibits good cryptographic properties which makes the cipher resistant to almost all attacks on stream ciphers, but with the cost of additional computing requirements. This cipher uses 16 cycles for initialization, which is the least number of cycles when compared to other existing stream ciphers
Deterministic Chaos in Digital Cryptography
This thesis studies the application of deterministic chaos to digital
cryptography. Cryptographic systems such as pseudo-random generators
(PRNG), block ciphers and hash functions are regarded as a dynamic
system (X, j), where X is a state space (Le. message space)
and f : X -+ X is an iterated function. In both chaos theory and
cryptography, the object of study is a dynamic system that performs
an iterative nonlinear transformation of information in an apparently
unpredictable but deterministic manner. In terms of chaos theory, the
sensitivity to the initial conditions together with the mixing property
ensures cryptographic confusion (statistical independence) and diffusion
(uniform propagation of plaintext and key randomness into cihertext).
This synergetic relationship between the properties of chaotic and
cryptographic systems is considered at both the theoretical and practical
levels: The theoretical background upon which this relationship is
based, includes discussions on chaos, ergodicity, complexity, randomness,
unpredictability and entropy.
Two approaches to the finite-state implementation of chaotic systems
(Le. pseudo-chaos) are considered: (i) floating-point approximation of
continuous-state chaos; (ii) binary pseudo-chaos. An overview is given
of chaotic systems underpinning cryptographic algorithms along with
their strengths and weaknesses. Though all conventional cryposystems
are considered binary pseudo-chaos, neither chaos, nor pseudo-chaos are
sufficient to guarantee cryptographic strength and security.
A dynamic system is said to have an analytical solution Xn = (xo)
if any trajectory point Xn can be computed directly from the initial
conditions Xo, without performing n iterations. A chaotic system with an
analytical solution may have a unpredictable multi-valued map Xn+l =
f(xn). Their floating-point approximation is studied in the context of
pseudo-random generators.
A cryptographic software system E-Larm ™ implementing a multistream
pseudo-chaotic generator is described. Several pseudo-chaotic
systems including the logistic map, sine map, tangent- and logarithm feedback
maps, sawteeth and tent maps are evaluated by means of floating point
computations. Two types of partitioning are used to extract
pseudo-random from the floating-point state variable: (i) combining the
last significant bits of the floating-point number (for nonlinear maps);
and (ii) threshold partitioning (for piecewise linear maps). Multi-round
iterations are produced to decrease the bit dependence and increase non-linearity.
Relationships between pseudo-chaotic systems are introduced
to avoid short cycles (each system influences periodically the states of
other systems used in the encryption session).
An evaluation of cryptographic properties of E-Larm is given using
graphical plots such as state distributions, phase-space portraits, spectral
density Fourier transform, approximated entropy (APEN), cycle length
histogram, as well as a variety of statistical tests from the National Institute
of Standards and Technology (NIST) suite. Though E-Larm passes
all tests recommended by NIST, an approach based on the floating-point
approximation of chaos is inefficient in terms of the quality/performance
ratio (compared with existing PRNG algorithms). Also no solution is
known to control short cycles.
In conclusion, the role of chaos theory in cryptography is identified;
disadvantages of floating-point pseudo-chaos are emphasized although
binary pseudo-chaos is considered useful for cryptographic applications.Durand Technology Limite
- …