This paper presents research on various encryption schemes and their applications in securing data. Specifically, I discuss their vulnerabilities, implementations (both logically and mathematically), and briefly mention their durability against cryptanalysis attacks. I also present their mathematical properties, and theories that are assumed to hold within a security parameter. In particularly, I focus my attention on the RSA (Rivest, Shamir, and Adelman) Encryption Algorithm and AES (Advanced Encryption Standard) Algorithm in CBC mode (Cipher Block Chaining) against chosen-plaintext attacks  due to their popularity. I also introduce BB84 (Benett and Brassard 1984) and its relation to the one-time pad encryption scheme. Finally, by analyzing the pros and cons of all of the algorithms, I explain why the use of the one-time pad and BB84 key exchange are inherently superior to other approaches.
Jacob W. Adkins is a sophomore at Kent State Stark. She is completing a double major in computer science and mathematics. After he graduates, he plans to enter cyber security or database security. He enjoys research, music, and running when he is not busy with school work.