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

2020 ◽  
Vol 70 (6) ◽  
pp. 612-618
Author(s):  
Maiya Din ◽  
Saibal K. Pal ◽  
S. K. Muttoo ◽  
Sushila Madan

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.

2020 ◽  
Vol 10 (1) ◽  
pp. 42-47
Author(s):  
Tosin P. Adewumi ◽  
Marcus Liwicki

AbstractIn this paper, the authors propose to increase the efficiency of blockchain mining by using a population-based approach. Blockchain relies on solving difficult mathematical problems as proof-of-work within a network before blocks are added to the chain. Brute force approach, advocated by some as the fastest algorithm for solving partial hash collisions and implemented in Bitcoin blockchain, implies exhaustive, sequential search. It involves incrementing the nonce (number) of the header by one, then taking a double SHA-256 hash at each instance and comparing it with a target value to ascertain if lower than that target. It excessively consumes both time and power. In this paper, the authors, therefore, suggest using an inner for-loop for the population-based approach. Comparison shows that it’s a slightly faster approach than brute force, with an average speed advantage of about 1.67% or 3,420 iterations per second and 73% of the time performing better. Also, we observed that the more the total particles deployed, the better the performance until a pivotal point. Furthermore, a recommendation on taming the excessive use of power by networks, like Bitcoin’s, by using penalty by consensus is suggested.


Author(s):  
Ravichander Janapati ◽  
Ch. Balaswamy ◽  
K. Soundararajan

Localization is the key research area in wireless sensor networks. Finding the exact position of the node is known as localization. Different algorithms have been proposed. Here we consider a cooperative localization algorithm with censoring schemes using Crammer Rao bound (CRB). This censoring scheme  can improve the positioning accuracy and reduces computation complexity, traffic and latency. Particle swarm optimization (PSO) is a population based search algorithm based on the swarm intelligence like social behavior of birds, bees or a school of fishes. To improve the algorithm efficiency and localization precision, this paper presents an objective function based on the normal distribution of ranging error and a method of obtaining the search space of particles. In this paper  Distributed localization of wireless sensor networksis proposed using PSO with best censoring technique using CRB. Proposed method shows better results in terms of position accuracy, latency and complexity.  


Nature ◽  
2018 ◽  
Vol 560 (7718) ◽  
pp. 293-294
Author(s):  
Davide Castelvecchi

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3011
Author(s):  
Drishti Yadav

This paper introduces a novel population-based bio-inspired meta-heuristic optimization algorithm, called Blood Coagulation Algorithm (BCA). BCA derives inspiration from the process of blood coagulation in the human body. The underlying concepts and ideas behind the proposed algorithm are the cooperative behavior of thrombocytes and their intelligent strategy of clot formation. These behaviors are modeled and utilized to underscore intensification and diversification in a given search space. A comparison with various state-of-the-art meta-heuristic algorithms over a test suite of 23 renowned benchmark functions reflects the efficiency of BCA. An extensive investigation is conducted to analyze the performance, convergence behavior and computational complexity of BCA. The comparative study and statistical test analysis demonstrate that BCA offers very competitive and statistically significant results compared to other eminent meta-heuristic algorithms. Experimental results also show the consistent performance of BCA in high dimensional search spaces. Furthermore, we demonstrate the applicability of BCA on real-world applications by solving several real-life engineering problems.


Author(s):  
Rajesh Prasad

Word matching problem is to find all the exact occurrences of a pattern P[0...m-1] in the text T[0...n-1], where P neither contains any white space nor preceded and followed by space. In the parameterized word matching problem, a given word P[0...m-1] is said to match with a sub-word t of the text T[0...n-1], if there exists a one-to-one correspondence between the symbols of P and the symbols of t. Exact Word Matching (EWM) problem has been previously solved by partitioning the text into number of tables in the pre-processing phase and then applying either brute force approach or fast hashing during the searching process. This paper presents an extension of EWM problem for parameterized word matching. It first split the text into number of tables in the pre-processing phase and then applying prev-encoding and bit-parallelism technique, Parameterized Shift-Or (PSO) during the searching phase. Experimental results show that this technique performs better than PSO.


2020 ◽  
Vol 10 (5) ◽  
pp. 6187-6190
Author(s):  
A. S. Alshammari

The keyspace of a cryptography system must be long enough in order to protect it from brute force attacks. The One-Time Pad (OTP) encryption is unconditionally secure because of its truly random keystream that is used only once. This paper proposes a new chaotic symmetric cryptosystem approach, comparable to OTP. The proposed system utilizes two Lorenz generators, a main and an auxiliary, where the aim of the second one is to make one of the main Lorenz generator’s parameters to vary continually with time in a chaotic manner. This technique was built on digitizing two Lorenz chaotic models to increase the security level. The scrambling scheme was developed and the Lorenz stream cipher binary stream successfully passed the NIST randomness test. The cryptosystem showed a high degree of security, as it had a keyspace of 2576, and it was compared with existing symmetric key cryptography systems, such as DES, 3DES, AES, Blowfish, and OTP.


2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.


2020 ◽  
Vol 8 (5) ◽  
pp. 4456-4459

Today’s time is of artificial intelligence. We are trying to reduce the search space by some methods as uncertain data is also used in the system to solve problems. To manage our database we use hybrid techniques. Like Fuzzy expert system, fuzzy genetic system, in this paper we will see how can we use such system in solving an application.


2021 ◽  
Author(s):  
Charles R. Krouse ◽  
Grant O. Musgrove ◽  
Taewoan Kim ◽  
Seungmin Lee ◽  
Muhyoung Lee ◽  
...  

Abstract The Chaboche model is a well-validated non-linear kinematic hardening material model. This material model, like many models, depends on a set of material constants that must be calibrated for it to match the experimental data. Due to the challenge of calibrating these constants, the Chaboche model is often disregarded. The challenge with calibrating the Chaboche constants is that the most reliable method for doing the calibration is a brute force approach, which tests thousands of combinations of constants. Different sampling techniques and optimization schemes can be used to select different combinations of these constants, but ultimately, they all rely on iteratively selecting values and running simulations for each selected set. In the experience of the authors, such brute force methods require roughly 2,500 combinations to be evaluated in order to have confidence that a reasonable solution is found. This process is not efficient. It is time-intensive and labor-intensive. It requires long simulation times, and it requires significant effort to develop the accompanying scripts and algorithms that are used to iterate through combinations of constants and to calculate agreement. A better, more automated method exists for calibrating the Chaboche material constants. In this paper, the authors describe a more efficient, automated method for calibrating Chaboche constants. The method is validated by using it to calibrate Chaboche constants for an IN792 single-crystal material and a CM247 directionally-solidified material. The calibration results using the automated approach were compared to calibration results obtained using a brute force approach. It was determined that the automated method achieves agreeable results that are equivalent to, or supersede, results obtained using the conventional brute force method. After validating the method for cases that only consider a single material orientation, the automated method was extended to multiple off-axis calibrations. The Chaboche model that is available in commercial software, such as ANSYS, will only accept a single set of Chaboche constants for a given temperature. There is no published method for calibrating Chaboche constants that considers multiple material orientations. Therefore, the approach outlined in this paper was extended to include multiple material orientations in a single calibration scheme. The authors concluded that the automated approach can be used to successfully, accurately, and efficiently calibrate multiple material directions. The approach is especially well-suited when off-axis calibration must be considered concomitantly with longitudinal calibration. Overall, the automated Chaboche calibration method yielded results that agreed well with experimental data. Thus, the method can be used with confidence to efficiently and accurately calibrate the Chaboche non-linear kinematic hardening material model.


Sign in / Sign up

Export Citation Format

Share Document