Algorithm For Cryptanalysis Research Articles

Hardware Implementation of Algorithm for Cryptanalysis

Hardware Implementation of Algorithm for Cryptanalysis

A Novel Binary Hybrid PSO-EO Algorithm for Cryptanalysis of Internal State of RC4 Cipher

Cryptography protects privacy and confidentiality. So, it is necessary to guarantee that the ciphers used are secure and cryptanalysis-resistant. In this paper, a new state recovery attack against the RC4 stream cipher is revealed. A plaintext attack is used in which the attacker has both the plaintext and the ciphertext, so they can calculate the keystream and reveal the cipher’s internal state. To increase the quality of answers to practical and recent real-world global optimization difficulties, researchers are increasingly combining two or more variations. PSO and EO are combined in a hybrid PSOEO in an uncertain environment. We may also convert this method to its binary form to cryptanalyze the internal state of the RC4 cipher. When solving the cryptanalysis issue with HBPSOEO, we discover that it is more accurate and quicker than utilizing both PSO and EO independently. Experiments reveal that our proposed fitness function, in combination with HBPSOEO, requires checking 104 possible internal states; however, brute force attacks require checking 2128 states.

Knapsack Cipher-based metaheuristic optimization algorithms for cryptanalysis in blockchain-enabled internet of things systems

The integration of the Internet of Things (IoT) and blockchain demand the use of public-key cryptography systems to secure network communications. In this study, one of those public-key algorithms, known as Merkle–Hellman Knapsack Cryptosystem (MHKC), is employed to cryptographically analyze its utilization for blockchain technology using a metaheuristic algorithm. To do so, eight well-known metaheuristic algorithms are employed to determine the trustworthiness of MHKC against cryptoanalysis attacks using various knapsack lengths, ranging from 8 to 32 bits. The experimental findings showed that pathfinder algorithm (PFA) and slime mold optimizer (SMA) could exploit MHKC under 8-bit ASCII code, and their performance gradually deteriorates with higher bit representations, while the performance of manta ray foraging optimization (MRFO) could be superior for the knapsack lengths higher than 8-bit. Additionally, MRFO would not attack MHKC under 32-bit; thus, some genetic operators have been integrated to manipulate the binary solutions obtained by this algorithm to promote its exploration capability in a variant, namely HMRFO. The experimental findings revealed that HMRFO is a better alternative to the existing ones for attacking the MHKC with knapsack lengths higher than 8-bit to appear their fragility points, while both SMA and PFA are competitive for 8-bit ASCII code and superior to the other algorithms.

Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography

The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP). Various cryptanalysis algorithms such as (Pro)GaussSieve, HashSieve, ENUM, and BKZ have been proposed to solve these hard problems. Several implementations of these algorithms have been developed. On the other hand, the implementations of these algorithms are expected to be efficient in terms of run time and memory space. In this paper, a modular software package/library containing efficient implementations of GaussSieve, ProGaussSieve, HashSieve, and BKZ algorithms is developed. These implementations are considered efficient in terms of run time. While constructing this software library, some modifications to the algorithms are made to increase the performance. Then, the run times of these implementations are compared with the others. According to the experimental results, the proposed GaussSieve, ProGaussSieve, and HashSieve implementations are at least 70%, 75%, and 49% more efficient than previous ones, respectively.

A Binomial Crossover Based Artificial Bee Colony Algorithm for Cryptanalysis of Polyalphabetic Cipher

A Binomial Crossover Based Artificial Bee Colony Algorithm for Cryptanalysis of Polyalphabetic Cipher

Hardware Implementation of Algorithm for Cryptanalysis

Hardware Implementation of Algorithm for Cryptanalysis

Key Exchange Protocol Defined over a Non-Commuting Group Based on an NP-Complete Decisional Problem

In this paper we present a cryptographic primitive based on non-commutative cryptography. This primitive is used for key exchange protocol (KEP) construction. We prove that the security of this primitive relies on a nondeterministic polynomial complete (NP-Complete) decisional problem. Recently there are no known quantum cryptanalysis algorithms effectively solving NP-Complete problems. So far, KEPs are widely used in secure communication channel creation, e.g., in hypertext transfer protocol secure (https://) and are based on traditional cryptographic primitives representing commutative cryptography. However, the security of these protocols does not rely on NP-Complete problems and hence, according to P. W. Shorr, they are vulnerable to quantum cryptanalysis. We use one of seven non-commuting groups of order 16 which is not isomorphic to any other group to define a platform group for a key exchange protocol based on previously considered matrix power function (MPF). By investigating basic properties on the group M16 and their implementation for our goals we fix the order of actions in MPF from left to right. Furthermore, we define a special form of the base matrix and separate templates for left and right power matrices. Using properties of the specified templates and Schaeffer criteria we prove that the security of the proposed key exchange relies on an NP-Complete decisional problem.

An application of Euclidean algorithm in cryptanalysis of RSA

An application of Euclidean algorithm in cryptanalysis of RSA

SMT Solver-Based Cryptanalysis of Block Ciphers

Satisfiability modulo theories (SMT) is a powerful framework for solving constraint satisfaction problem expressed in first-order logic and mainly used for software and hardware verification. In this article, we demonstrate the power of SMT solvers in cryptanalysis. We propose an algorithm for cryptanalysis of block ciphers using SMT solvers. In the cryptanalytic attack, we represent a block cipher in terms of Boolean equations and convert them into a suitable format (i.e. SMT-LIB). Finally, we use SMT solvers to find the key. An important feature of our attack is that it requires a few plaintext-ciphertext pairs to recover the secret key. We use the propose algorithm to demonstrate the cryptanalysis of International Data Encryption Algorithm (IDEA). We use various serial and parallel SMT solvers to apply known plaintext attack on IDEA and compare their performances. SMT solver can recover full key for three round of IDEA and 32 unknown key bits for full IDEA cipher, assuming 96 key bits are known. Furthermore, we compare our results with existing attacks on IDEA.

Cracking PURPLE: cryptanalysis of the Angooki Taipu B switch tables

Eighty years after the US Army’s Signal Intelligence Service (SIS) cracked PURPLE, the famous WWII-era Japanese cipher machine, there still has been little technical information published about how it was done. This paper offers a detailed description of how SIS could have done it. The techniques described here would all have been available to SIS in their pre-computer era of the early 1940s, and are based on cryptanalysis using plaintext and matching ciphertext. This paper derives the system architecture, determines the sixes and twenties switch tables, shows how to convert them to wiring diagrams, explains how to handle the complication of the plugboards, extends the information that can be mined from the famous patterns in PURPLE data, corrects a deficiency in the usage of the one published algorithm for cryptanalysis of the twenties, and shows that neither the sixes nor the twenties switch tables are unique.

Comparative analysis of cryptoprimitives on canonical elliptic curves and Edwards curves

The article provides a comparative analysis of the basic transformations on canonical elliptic curves and Edwards curves. Comparisons of the performance of group operations in groups of points of elliptic curves and Edwards curves are given. The possibility of using the Pollard algorithm for cryptanalysis of Edwards curves, as well as the acceleration of the sequence generation for the ro-Polard algorithm for Edwards curves is shown, which allows to accelerate the execution of cryptanalysis. The paper proposes an assessment of the resistance of Edwards curves against attacks of the type “full disclosure” using the discrete logarithm in the Edwards curve point group.

УЗАГАЛЬНЕНА МОДЕЛЬ КРИПТОСИСТЕМИ ФРЕДГОЛЬМА

The problem of cyber security in the era of the creation of quantum computers is of particular relevance. Specifically, the data are at risk which are confidential or whose value depends on their integrity. In order to find a way out of the situation which happened in the article, a thorough comprehensive analysis of the current state of the known cryptosystems was carried out, based on a systematic approach. In particular, the advantages and disadvantages of models of cryptosystems which were created on the basis of cognitive cryptography are stated, the theory of dynamic chaos, constructive, quantum and post-quantum cryptography. The issue of cryptosystem models based on DNA algorithms is also raised, proxy cryptosystem models, attribute cryptosystems, packet and non-commutative cryptography. As a result of the research, it was found out that the greatest interest in terms of security today is integral cryptography. The lack of scientifically justified models of cryptosystems based on integrated cryptography has led to the development of one of these models. The model is developed on the basis of the proposed concept, which is based on the main principals of integral cryptography. As a result of the research, a generalized model of the cryptosystem was developed, which in the future is proposed to be called the cryptosystem of Fredholm. It is shown that the essence of the encryption and decryption procedures is reduced to solving the direct and inverse problem, which is described by the integral equation of Fredholm of the first-order. The article emphasizes in particular that compared to the known models of cryptosystems, the proposed model has a number of significant advantages. The first advantage is the guaranteed theoretical and practical cryptostability, which is due to the incorrectness of the inverse decryption problem. The second advantage of the proposed model is the absence of effective algorithms for cryptanalysis due to the lack of prevalence of integral cryptography in modern cyber security systems. The developed model serves the theoretical basis for the further development of appropriate cryptographic algorithms and research of their security parameters.

Quantum Cryptanalysis: Shor, Grover, and Beyond

Some recently discovered quantum algorithms have resulted in complete breaks of cryptosystems previously expected to be secure against quantum attack. Although several strong candidates for postquantum cryptography remain standing, continued attention to quantum algorithms for cryptanalysis is warranted. Here we survey these recent developments, focusing on those most likely to be of relevance to cryptanalysis.

Research Trends in Quantum Computational Algorithms for Cryptanalysis

Research Trends in Quantum Computational Algorithms for Cryptanalysis

Swarm intelligence algorithms in cryptanalysis of simple Feistel ciphers

Recent cryptosystems constitute a hard task for cryptanalysis algorithms due to the nonlinearity of their structure. This problem can be formulated as NP-hard. It has long been subject to various attacks; related results remain insufficient especially when handling wide instances due to resources requirement which increase with the size of the problem. On another side, heuristic methods are techniques able to investigate large spaces of candidate solutions. Swarm intelligence algorithms, part of heuristic methods represent a set of approaches characterised by their fast convergence and easy implementation. The purpose of this paper is to provide a detailed study about the performance of two swarm intelligence algorithms, BAT algorithm and wolf pack search (WPS) algorithm for cryptanalysis of some variant of Feistel ciphers. Experiments were accomplished in order to study the effectiveness of such algorithms in solving the considered problem. Moreover, a comparison with VMMAS, PSO and DE algorithms establishes this advantage.

Swarm intelligence algorithms in cryptanalysis of simple Feistel ciphers

Recent cryptosystems constitute a hard task for cryptanalysis algorithms due to the nonlinearity of their structure. This problem can be formulated as NP-hard. It has long been subject to various attacks; related results remain insufficient especially when handling wide instances due to resources requirement which increase with the size of the problem. On another side, heuristic methods are techniques able to investigate large spaces of candidate solutions. Swarm intelligence algorithms, part of heuristic methods represent a set of approaches characterised by their fast convergence and easy implementation. The purpose of this paper is to provide a detailed study about the performance of two swarm intelligence algorithms, BAT algorithm and wolf pack search (WPS) algorithm for cryptanalysis of some variant of Feistel ciphers. Experiments were accomplished in order to study the effectiveness of such algorithms in solving the considered problem. Moreover, a comparison with VMMAS, PSO and DE algorithms establishes this advantage.

Application of Genetic Algorithm in Cryptanalysis of Mono-alphabetic Substitution Cipher

Application of Genetic Algorithm in Cryptanalysis of Mono-alphabetic Substitution Cipher

The Applicability of Genetic Algorithm in Cryptanalysis: A Survey

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.

On vulnerability analysis of several password authentication protocols

In this work, we argue that the usage of computationally intensive mathematical operations in password authentication protocols can lead to security vulnerability in the protocol. We formulate a generalized algorithm for cryptanalysis to perform clogging attack (a form of denial of service) on protocols which use the computationally intensive modular exponentiation to guarantee security. We then apply this technique to cryptanalyze four recent password authentication protocols, and observe all four of them to be prone to the clogging attack. The first one by Yang et al. is a password-based authentication scheme to preserve identity privacy. This protocol does not use timestamps. The second protocol we consider for analysis is by Islam. This is a smart card-based remote user password authentication protocol that uses timestamps. The third protocol by Jiang et al. is a password-based authentication protocol that does not use smart cards. Finally, the last protocol we consider for analysis is by Wang et al. This is a recent smart card-based authentication protocol claimed to be immune to the DoS attack. The protocols differ in either their usage of factors (smart cards, memory drives etc.), or their way of communications (usage of encryption, nonces, timestamps etc.). But their similarity lies in their usage of the computationally intensive modular exponentiation as a medium of authentication. We conclude that the strengths of all the protocols, e.g., Yang et al. (usage of nonce, and encryption), or, e.g., Islam (usage of timestamps) can be combined to prevent the clogging attack on the protocols.

BAT algorithm for Cryptanalysis of Feistel cryptosystems

Recent cryptosystems constitute an effective task for cryptanalysis algorithms due to their internal structure based on nonlinearity. This problem can be formulated as NP-Hard. It has long been subject to various attacks; available results, emerged many years ago remain insufficient when handling large instances due to resources requirement which increase with the amount of processed data. On another side, optimization techniques inspired by swarm intelligence represents a set of approaches used to solve complex problems. This is mainly due to their fast convergence with a consumption of reduced resources. The purpose of this paper is to provide, and for a first time, a more detailed study about the performance of BAT algorithm in cryptanalysis of some variant of Data encryption standard algorithms. Experiments were performed to study the effectiveness of the used algorithm in solving the considered problem and underline the difficulties encountered.