Abstract
Internet security and data protection should be guaranteed for all users. Therefore, security is a major concern when exposing information to networks. In todays world, the information is never enough protected the way it should be. Cryptography is one of the most effective and efficient components of network security. Cryptography is a technique to apply ensure the secure and reliable transaction between the sender and the receiver when transferring unintelligible information. Moreover, only the authorized receiver can have the right to decrypt the information that was sent and encrypted by the sender. The cryptography plays an essential role in order to provide security to these networks. In this paper, we observe encryption as well as decryption time of different algorithms with the random size of data packets. Firstly, this work introduces the fundamental concepts of Cryptography: encryption and decryption operations. Secondly, compares between the most popular algorithms RSA, EI-Gamal and Elliptic Curve (ECC). Our comparison is based on key size length that affects the running time. Finally, we conclude our survey by focusing on the different outcomes between the RSA and Elliptic curve algorithms.