Analysis Of Asymmetric Encryption

1118 Words3 Pages

1. INTRODUCTION Two simple techniques for encrypting information are: symmetric encryption (also called secret key encryption) and asymmetric encryption (also called public key encryption). Symmetric algorithms are faster, but the main problem associated with this algorithm is key distribution. On the other hand, asymmetric encryption eliminates key security problem, but these algorithms take too much time for encryption and decryption. Certain systems use asymmetric encryption for secure key exchange joined with symmetric algorithms for rapid data encryption. One of highly regarded symmetric algorithms is AES (Advanced Encryption Standard), AES is encryption standard recognized by the U.S. National Institute of Standards and Technology (NIST) …show more content…

Other asymmetric algorithms, such as DSA, are suitable only for realizing digital signatures. The asymmetric algorithms are much slower and less secure than symmetric algorithms for a similar key size. To get desired result, asymmetric algorithms should be used with a larger key size, and, to achieve acceptable performance, they are mainly applied to small data sizes. Therefore, asymmetric algorithms are generally used to encrypt hash values and symmetric session keys, both of which tend to be rather small in size when compared to plaintext …show more content…

In such a cryptosystem, the encryption key is public and the decryption key is kept secret. In RSA, this asymmetry is based on the practical difficulty of factoring the product of two large prime numbers, the factoring problem. RSA is the abbrevation for Ron Rivest, Adi Shamir and Leonard Adleman, who first described the algorithm in 1977. Clifford Cocks, an English mathematician, had developed an equivalent system in 1973, but it was not declassified until 1997.
A handler of RSA creates and then distributes a public key based on the two large prime numbers, along with an add-on value. The prime numbers must be kept confidential. Anybody can use the public key to encrypt a message, but with presently published methods, if the public key is huge enough, only somebody with knowledge of the prime numbers can decode the message. Breaking RSA encryption is known as the RSA problem. It is an open query whether it is as hard as the factoring problem.
2.2 DES

Open Document