A novel method to design S-box based on chaotic map and genetic algorithm

2012 ◽  
Vol 376 (6-7) ◽  
pp. 827-833 ◽  
Author(s):  
Yong Wang ◽  
Kwok-Wo Wong ◽  
Changbing Li ◽  
Yang Li
Keyword(s):  
Genetic Algorithm ◽  
Chaotic Map ◽  
Novel Method

A novel method of S-box design based on discrete chaotic map

2016 ◽  
Vol 87 (4) ◽  
pp. 2407-2413 ◽  
Author(s):  
Dragan Lambić
Keyword(s):  
Chaotic Map ◽  
Novel Method

scholarly journals Strategic Team AI Path Plans: Probabilistic Pathfinding

2008 ◽  
Vol 2008 ◽  
pp. 1-6 ◽  
Author(s):  
Tng C. H. John ◽  
Edmond C. Prakash ◽  
Narendra S. Chaudhari
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computer Games ◽  
Fitness Function ◽  
New Method ◽  
High Quality ◽  
Plan Generation ◽  
Novel Method ◽  
Games And Simulations

This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.

scholarly journals AN EFFICIENT CHAOS-BASED OPTIMIZATION ALGORITHM APPROACH FOR CRYPTOGRAPHY

2012 ◽  
pp. 75-79
Author(s):  
RASHI VOHRA ◽  
BRAJESH PATEL
Keyword(s):  
Genetic Algorithm ◽  
Optimization Algorithm ◽  
Negative Impact ◽  
Chaotic Map ◽  
Pseudorandom Sequence ◽  
Secure Communications ◽  
Security Threats ◽  
Suggested Approach ◽  
Novel Approach ◽  
Algorithm Operation

The utmost negative impact of advancement of technology is an exponential increase in security threats, due to which tremendous demand for effective electronic security is increasing importantly. The principles of any security mechanism are confidentiality, authentication, integrity, non-repudiation, access control and availability. Cryptography is an essential aspect for secure communications. Many chaotic cryptosystem has been developed, as a result of the interesting relationship between the two field chaos and cryptography phenomenological behavior. In this paper, an overview of cryptography, optimization algorithm and chaos theory is provided and a novel approach for encryption and decryption based on chaos and optimization algorithms is discussed. In this article, the basic idea is to encrypt and decrypt the information using the concept of genetic algorithm with the pseudorandom sequence further used as a key in genetic algorithm operation for encryption: which is generated by application of chaotic map. This attempt result in good desirable cryptographic properties as a change in key will produce undesired result in receiver side. The suggested approach complements standard, algorithmic procedures, providing security solutions with novel features.

scholarly journals Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Amer Awad Alzaidi ◽  
Musheer Ahmad ◽  
Hussam S. Ahmed ◽  
Eesa Al Solami
Keyword(s):  
Fitness Function ◽  
Chaotic Map ◽  
Search Space ◽  
Initial Population ◽  
Substitution Boxes ◽  
Novel Method ◽  
Sine Cosine Algorithm ◽  
And Performance ◽  
Optimization Mechanism ◽  
Independence Criterion

This paper proposes a novel method of constructing strong substitution-boxes (S-boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine-cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map, for generating initial population of S-boxes and facilitating the optimization mechanism of SCA. The proposed method applies the SCA with enhanced chaotic map to explore and exploit the search space for obtaining optimized S-boxes on the basis of maximization of nonlinearity as fitness function. The S-box construction involves three phases such as initialization of population, optimization, and adjustment. The simulation and performance analyses are done using standard measures of nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, and autocorrelation function. The obtained experimental results are compared with some immediate optimization-based and other S-boxes to show the strength of proposed method for constructing bijective S-boxes of salient cryptographic features.

A Method for Constructing Bijective S-Box with High Nonlinearity Based on Chaos and Optimization

2015 ◽  
Vol 25 (10) ◽  
pp. 1550127 ◽  
Author(s):  
Yong Wang ◽  
Peng Lei ◽  
Kwok-Wo Wong
Keyword(s):  
Chaotic Maps ◽  
Chaotic Map ◽  
Optimization Method ◽  
Second Phase ◽  
Local Optima ◽  
High Nonlinearity ◽  
Highly Nonlinear ◽  
Novel Method ◽  
High Level ◽  
Very High

Although chaotic maps possess useful properties, such as being highly nonlinear and pseudorandom, for designing S-box, the cryptographic performance of the chaos-based substitution box (S-box) cannot achieve a very high level, especially in nonlinearity. In this paper, two conditions of improving the nonlinearity of S-box are firstly given according to the process of calculating nonlinearity. A novel method combining chaos and optimization operations is proposed for constructing S-box with high nonlinearity. There are three phases in our method. In the first phase, the S-box is initialized by a chaotic map. Then, its nonlinearity is enhanced by an optimization method in the second phase. To avoid the result of falling into local optima, some adjustments are done in the final phase. Experimental results show that the S-boxes constructed by the proposed method have a much higher nonlinearity than those only based on chaotic maps. This justifies that our algorithm is effective in generating S-boxes with high cryptographic performance.

A modified method for image encryption based on chaotic map and genetic algorithm

2020 ◽  
Vol 79 (37-38) ◽  
pp. 26927-26950
Author(s):  
Mahdieh Ghazvini ◽  
Mojdeh Mirzadi ◽  
Negin Parvar
Keyword(s):  
Genetic Algorithm ◽  
Image Encryption ◽  
Chaotic Map ◽  
Modified Method
Sign in / Sign up

Export Citation Format

Share Document