2015
DOI: 10.5120/ijca2015907118
|View full text |Cite
|
Sign up to set email alerts
|

The Applicability of Genetic Algorithm in Cryptanalysis: A Survey

Abstract: The Cryptanalysis has been the most fascinating area for science fraternity. The application of Genetic Algorithm (GAs) to the field of cryptanalysis is rather unique as no robust model for cryptanalysis using Genetic Algorithm exists. Genetic Algorithm (GAs) are the class of heuristic algorithm which are known for optimization and search problem. The paper presents the systematic review of Genetic Algorithm applied to the Cryptanalysis.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 26 publications
0
2
0
Order By: Relevance
“…Each particle in the search space of a given problem is encrypted using a schema to display the given problem in the form of a series of fixed-length characters. The GA tries to find the best solution to the problem with the help of genetic fertilisation of members of a population over a number of generations (Hadji and Gaubert, 2015; Thengade and Dondal, 2012; Mukhopadadhyay and Balitanas, 2009). In this work, the objective function is defined as the reciprocal absolute value of the power difference, because the GA algorithm is defined as maximisation process, and its presentation is shown in equation (1): where = P mpp,GA is the calculated maximum power by the GA algorithm and P mpp,catalog is the experimentally determined value given by the producer for given conditions.…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Each particle in the search space of a given problem is encrypted using a schema to display the given problem in the form of a series of fixed-length characters. The GA tries to find the best solution to the problem with the help of genetic fertilisation of members of a population over a number of generations (Hadji and Gaubert, 2015; Thengade and Dondal, 2012; Mukhopadadhyay and Balitanas, 2009). In this work, the objective function is defined as the reciprocal absolute value of the power difference, because the GA algorithm is defined as maximisation process, and its presentation is shown in equation (1): where = P mpp,GA is the calculated maximum power by the GA algorithm and P mpp,catalog is the experimentally determined value given by the producer for given conditions.…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…In [3], Hameed, Asif, et al presents a methodical survey of Genetic Algorithm connected to the cryptanalysis. To comprehend the extent of GAs in cryptanalysis, it gives an efficient audit.…”
Section: Introductionmentioning
confidence: 99%