Cryptanalysis and Types of Attacks
Cryptanalysis and Types of Attacks
Cryptology has two parts namely, Cryptography which focuses on creating secret codes and Cryptanalysis
which is the study of the cryptographic algorithm and the breaking of those secret codes. The person practicing
Cryptanalysis is called a Cryptanalyst. It helps us to better understand the cryptosystems and also helps us
improve the system by finding any weak point and thus work on the algorithm to create a more secure secret
code. For example, a Cryptanalyst might try to decipher a ciphertext to derive the plaintext. It can help us to
deduce the plaintext or the encryption key.
Parts Of Cryptology
To determine the weak points of a cryptographic system, it is important to attack the system. These attacks
are called Cryptanalytic attacks. The attacks rely on nature of the algorithm and also knowledge of the general
characteristics of the plaintext, i.e., plaintext can be a regular document written in English or it can be a code
written in Java. Therefore, nature of the plaintext should be known before trying to use the attacks.
Source: https://www.geeksforgeeks.org/cryptanalysis-and-types-of-attacks/
Differential Cryptanalysis − The main objective of differential cryptanalysis is to view for statistical
distributions and patterns in ciphertext to provide deduce element about the key used in the cipher.
Differential cryptanalysis is a section of study in cryptography that compares the method differences in input
associated to the differences in encrypted output. It can be used basically in the study of block ciphers to
decide if changes in plaintext result in any non-random outcomes in the encrypted ciphertext.
Related-Key Cryptanalysis − Related-key cryptanalysis consider that the attacker understands the encryption
of specific plaintexts not only under the original (unknown) key K, but also below some derived keys K0 = f
(K).
In a chosen-related key attack, the attacker defines how the key is to be modified and known-related-key
attacks are those where the key difference is acknowledged, but cannot be selected by the attacker.
It can emphasize that the attacker understands or select the relationship between keys, and not only the actual
key values.
Related-key cryptanalysis is a factual attack on key-exchange protocols that do not provide key-integrity an
attacker can be capable to ip bits in the key without understanding the keypad key-update protocols that update
keys utilizing a known function such as K, K + 1, K + 2, etc. Related-key attacks were also utilized against
rotor devices such as operators consistently set rotors incorrectly.
Linear Cryptanalysis − Linear cryptanalysis is a general form of cryptanalysis depend on discovering affine
approximations to the element of a cipher. Attacks have been produced for block ciphers and stream ciphers.
Linear cryptanalysis is one of the two most generally used attacks on block ciphers and the other being
differential cryptanalysis. Linear approximate equations is depend on the best (n-2) round expression, and
dependability of the key candidates changed from these equations. The former decrease the number of needed
plaintexts, whereas the latter enhance the success rate of the attack.
Brute Force Attack − In cryptanalysis, a brute force attack is an approach of defeating a cryptographic scheme
by attempting a huge number of possibilities.
For example, it can be exhaustively working through all possible keys in order to decode a message. The
selection of an appropriate key length based on the practical feasibility of implementing a brute force attack.
For symmetric-key ciphers, a brute force attack generally means a brute-force search of the key area; that is,
checking all possible keys in order to find the plaintext used to create a specific cipher text.
In a brute force attack, the expected number of trials before the proper key is discovered is similar to half the
size of the key space. For instance, if there are 264 possible keys, a brute force attack can generally be normal
to discover a key after 263 trials.
If keys are generated in a weak method. For example, it can be derived from a guessable-password, and it is
applicable to exhaustively search over a much smaller set, and keys generated from passwords in a dictionary.
Source: https://www.tutorialspoint.com/what-are-the-attacks-on-des-in-information-security