Show simple item record

dc.contributor.advisorWendt, Theodore
dc.contributor.advisorAyers, Kimberly
dc.contributor.advisorScott, Shaun
dc.contributor.authorKyriacos, Nicolas
dc.date.accessioned2021-07-07T17:45:24Z
dc.date.available2021-07-07T17:45:24Z
dc.date.issued2021
dc.identifier.urihttps://scholars.carroll.edu/handle/20.500.12647/10473
dc.description.abstractToday the internet is being used more than ever in order to store, transfer and access information. As a result, our private information is vulnerable to malicious parties who wish to use it for their own personal benefit. Cryptography uses mathematics in order to hide our private data so that it cannot be accessed by anybody other than ourselves. We begin this paper by exploring the most basic kinds of cryptosystems such as shift transformations, linear transformations and affine transformations as well as the how these cryptosystems are cracked using frequency analysis. We then take a look at how these concepts translate to enciphering matrices. Furthermore, we explain the differences between private and public key cryptography and investigate the RSA cryptosystem which is one of the most common types of public key cryptosystems in use today.en_US
dc.language.isoen_USen_US
dc.titleUnderstanding the Mathematics Behind Cryptographyen_US
dc.typeThesisen_US
carrollscholars.object.degreeBachelor'sen_US
carrollscholars.object.departmentMathematicsen_US
carrollscholars.object.departmentComputer Scienceen_US
carrollscholars.object.seasonSpringen_US
carrollscholars.object.majorMathematicsen_US
carrollscholars.object.majorComputer Scienceen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record