Key Based Cryptanalysis of DES, AES and RSA and analysis of RSA using Randomization

Abstract

Network security means providing Confidentiality, Integrity, and Authentication of sensitive data while storing,
processing or transmitting. The network needs security against attackers and hackers. Network Security includes two basic
domains. The first is the information security i.e. to protect the information from unauthorized access, alteration and loss.
And the second is devices security i.e. to protect data stored in devices and to resist hackers. Data security can be provided
by using encryption system, and for encrypting any of the two types of keys can used namely, Public Key and Private Key.
Public Key is the key used to encrypt a plain text and which is available for everyone and Private Key is the key used to
decrypt the cipher text in order to make it readable and it is kept private as the name suggests. Cryptanalysis basically
depends on key and algorithm. Even after knowing the encrypting algorithm it is not feasible to break the code. But, for any
encrypted form, by any means if key could be found it becomes easy to decode. Complexity of Brute force attack depends on
the key length. As longer key gives greater search spaces, it will take much more time to break the code. After a point brute
force becomes impractical as it may lead to extensive search spaces.
As per current scenario it is necessary to send a key in a secured manner which ensures privacy even if the channel is
unsecured one and as we know internet is not a perfect secured channel. This makes it important, cryptosystems to be more
powerful to work against cryptanalysis.
In this paper, we have discussed how to speculate the key in efficient way and hence reduce the complexity of breaking the
code encrypted using most well-known modern algorithms DES, AES and RSA.