Symmetrickey encryption provides a very fast and efficient way for encrypting messages, but does pose a number of security flaws. The key for unlocking the message must be shared with both parties in secure fashion before the message is sent. If an attacker were to gain access to the key, they would easily be able to decipher each party’s messages. Due to its speed, symmetrickey encryption is useful for encrypting large amounts of data. The problem that symmetric key encryption faces is how to share the key in a secure way. This flaw is what led to the creation of publickey cryptography 40 years later.
PublicKey Cryptography
Unlike with symmetrickey cryptography, like its name suggests, publickey cryptography uses a public key for encrypting data (Fig. 3). In a publickey encryption system, each communicating party has a pair of keys. The public key, used for encrypting messages, can be distributed to anyone, while the user’s private key must be kept a secret. In this system, if party A wanted to send a secure message to party B, party A would first encrypt their message using party B’s public key. The only way to decrypt a message which uses party B’s public key is by using B’s private key [2].
www.tutorialspoint.com/www.tutorialspoint.com
Encryption methods such as symmetric or public key cryptography are designed to be provably secure. That is to say, the cryptographic algorithm can be mathematically proven to resist certain types of attacks. The security of an algorithm is usually based off a number of assumptions about the attacker’s ability. It is assumed that the attacker does not possess unlimited computational power, and that certain underlying assumptions in mathematics remain to be true. One of the most widely used publickey cryptographic algorithms, RSA, is based off of the idea that computing the prime factors of large integers is infeasible. Therefore, when calculating the security of RSA, it is presumed that the attacker is incapable of doing such a task.
Future of Cryptography and Encryption
Cryptography is constantly trying to stay ahead of attackers in order to provide a secure way of transferring data. As computers become more powerful, cryptographic algorithms must be complex enough to make brute force decryption attempts unfeasible. Quantum cryptography has been suggested as a solution to the security risk of sharing the key in symmetrickey cryptography. Quantum mechanics can be used to generate a key to encrypt data, just like with normal computing. But unlike with typical encryption keys, measuring a quantum system disturbs the system. If an attacker tries to read the key while it is being generated the system will abort its communication attempts [8]. This theoretically provides unconditional security in communication, as symmetric keys can be shared without fear of being intercepted by a hacker. Quantum computers and quantum cryptography are still in research development; it will take many years before quantum technology sees widespread use. As quantum computers move closer to becoming a technological reality, the future of cryptography is headed towards creating systems that are resistant to attacks by quantum computers.
Conclusion
It is easy to overlook cryptography’s impact on keeping our information secure. Not too long ago, in the “dark ages,” consumers were unable to purchase goods online or check their bank statements from their home computer. With the introduction of more advanced cryptography and security protocols such as HTTP, the World Wide Web has become a much safer place for providing sensitive information. It may be some time before cryptography provides unconditional security; however, the field of cryptography has made great strides in creating secure communication methods over the last several decades. Ecommerce websites, cellphones, credit cards, and password security innovation have flourished with cryptography. Only time will tell what new inventions cryptography will give rise to.
References

 [1] B. M. Metzger and M. D. Coogan, The Oxford companion to the bible. Oxford [etc.]: Oxford University Press, 2004.
 [2] S. Vaudenay, A classical introduction to Cryptography: Applications for communications security. New York: SpringerVerlag New York, 2005
 [3] P. Thorsteinson and G. A. G. Ganesh, .NET security and cryptography. United States: Prentice Hall PTR, 2003.
 [4] H. Delfs and H. Knebl, Introduction to cryptography: Principles and applications, 3rd ed. 2015.
 [5] K. Krishnan, "SFWR 4C03: Computer Networks and Computer Security," in North Carolina State University, 2004. [Online]. <http://www4.ncsu.edu/~kksivara/sfwr4c03/lectures/lecture9.pdf>.
 [6] "Public key Encryption," www.tutorialspoint.com, 2016. [Online]. Available: http://www.tutorialspoint.com/cryptography/public_key_encryption.htm. Accessed: Sep. 7, 2016.
 [7] T. Dierks, "The transport layer security (TLS) protocol version 1.2," 2008. [Online]. Available: https://tools.ietf.org/html/rfc5246. Accessed: Sep. 8, 2016.
 [8] H.K. Lo, M. Curty, and K. Tamaki, "Secure quantum key distribution," Nature Photonics, vol. 8, no. 8, pp. 595–604, Jul. 2014.