A Hybrid Computational Intelligence based Technique for Automatic Cryptanalysis of Playfair Ciphers

The Playfair cipher is a symmetric key cryptosystem-based on encryption of digrams of letters. The cipher shows higher cryptanalytic complexity compared to mono-alphabetic cipher due to the use of 625 different letter-digrams in encryption instead of 26 letters from Roman alphabets. Population-based techniques like Genetic algorithm (GA) and Swarm intelligence (SI) are more suitable compared to the Brute force approach for cryptanalysis of cipher because of specific and unique structure of its Key Table. This work is an attempt to automate the process of cryptanalysis using hybrid computational intelligence. Multiple particle swarm optimization (MPSO) and GA-based hybrid technique (MPSO-GA) have been proposed and applied in solving Playfair ciphers. The authors have attempted to find the solution key applied in generating Playfair crypts by using the proposed hybrid technique to reduce the exhaustive search space. As per the computed results of the MPSO-GA technique, correct solution was obtained for the Playfair ciphers of 100 to 200 letters length. The proposed technique provided better results compared to either GA or PSO-based technique. Furthermore, the technique was also able to recover partial English text message for short Playfair ciphers of 80 to 120 characters length

Application of Pigeon Inspired Optimization for Multidimensional Knapsack Problem

The multidimensional knapsack problem (MKP) is a generalization of the classical knapsack problem, a problem for allocating a resource by selecting a subset of objects that seek for the highest profit while satisfying the capacity of knapsack constraint. The MKP have many practical applications in different areas and classified as a NP-hard problem. An exact method like branch and bound and dynamic programming can solve the problem, but its time computation increases exponentially with the size of the problem. Whereas some approximation method has been developed to produce a near-optimal solution within reasonable computational times. In this paper a pigeon inspired optimization (PIO) is proposed for solving MKP. PIO is one of the metaheuristic algorithms that is classified in population-based swarm intelligent that is developed based on the behavior of the pigeon to find its home although it had gone far away from it home. In this paper, PIO implementation to solve MKP is applied to two different characteristic cases in total 10 cases. The result of the implementation of the two-best combination of parameter values for 10 cases compared to particle swarm optimization, intelligent water drop algorithm and the genetic algorithm gives satisfactory results

Firefly Algorithm: Recent Advances and Applications

Nature-inspired metaheuristic algorithms, especially those based on swarm intelligence, have attracted much attention in the last ten years. Firefly algorithm appeared in about five years ago, its literature has expanded dramatically with diverse applications. In this paper, we will briefly review the fundamentals of firefly algorithm together with a selection of recent publications. Then, we discuss the optimality associated with balancing exploration and exploitation, which is essential for all metaheuristic algorithms. By comparing with intermittent search strategy, we conclude that metaheuristics such as firefly algorithm are better than the optimal intermittent search strategy. We also analyse algorithms and their implications for higher-dimensional optimization problems.Comment: 15 page

Facial Expression Recognition Using Uniform Local Binary Pattern with Improved Firefly Feature Selection

Facial expressions are essential communication tools in our daily life. In this paper, the uniform local binary pattern is employed to extract features from the face. However, this feature representation is very high in dimensionality. The high dimensionality would not only affect the recognition accuracy but also can impose computational constraints. Hence, to reduce the dimensionality of the feature vector, the firefly algorithm is used to select the optimal subset that leads to better classification accuracy. However, the standard firefly algorithm suffers from the risk of being trapped in local optima after a certain number of generations. Hence, this limitation has been addressed by proposing an improved version of the firefly where the great deluge algorithm (GDA) has been integrated. The great deluge is a local search algorithm that helps to enhance the exploitation ability of the firefly algorithm, thus preventing being trapped in local optima. The improved firefly algorithm has been employed in a facial expression system. Experimental results using the Japanese female facial expression database show that the proposed approach yielded good classification accuracy compared to state-of-the-art methods. The best classification accuracy obtained by the proposed method is 96.7% with 1230 selected features, whereas, Gabor-SRC method achieved 97.6% with 2560 features

EEG-based person identification through binary flower pollination algorithm

Electroencephalogram (EEG) signal presents a great potential for highly secure biometric systems due to its characteristics of universality, uniqueness, and natural robustness to spoofing attacks. EEG signals are measured by sensors placed in various positions of a person’s head (channels). In this work, we address the problem of reducing the number of required sensors while maintaining a comparable performance. We evaluated a binary version of the Flower Pollination Algorithm under different transfer functions to select the best subset of channels that maximizes the accuracy, which is measured by means of the Optimum-Path Forest classifier. The experimental results show the proposed approach can make use of less than a half of the number of sensors while maintaining recognition rates up to 87%, which is crucial towards the effective use of EEG in biometric applications

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

Parameter optimization of evolving spiking neural networks using improved firefly algorithm for classification tasks

Evolving Spiking Neural Network (ESNN) is the third generation of artificial neural network that has been widely used in numerous studies in recent years. However, there are issues of ESSN that need to be improved; one of which is its parameters namely the modulation factor (Mod), similarity factor (Sim) and threshold factor (C) that have to be manually tuned for optimal values that are suitable for any particular problem. The objective of the proposed work is to automatically determine the optimum values of the ESNN parameters for various datasets by integrating the Firefly Algorithm (FA) optimizer into the ESNN training phase and adaptively searching for the best parameter values. In this study, FA has been modified and improved, and was applied to improve the accuracy of ESNN structure and rates of classification accuracy. Five benchmark datasets from University of California, Irvine (UCI) Machine Learning Repository, have been used to measure the effectiveness of the integration model. Performance analysis of the proposed work was conducted by calculating classification accuracy, and compared with other parameter optimisation methods. The results from the experimentation have proven that the proposed algorithms have attained the optimal parameters values for ESNN