The Mathematics of Cryptography & Data Compression

carrollscholars.legacy.contextkey10998402
carrollscholars.legacy.itemurlhttps://scholars.carroll.edu/mathengcompsci_theses/27
carrollscholars.object.degreeBachelor's
carrollscholars.object.departmentMathematics, Engineering & Computer Science
carrollscholars.object.disciplinesApplied Mathematics; Mathematics
carrollscholars.object.seasonSpring
dc.contributor.authorAnderson, Jennings
dc.date.accessioned2020-04-30T10:07:43Z
dc.date.available2020-04-30T10:07:43Z
dc.date.embargo12/31/1899 0:00
dc.date.issued2012-04-01
dc.description.abstractThis honors thesis focuses on Cryptography, Data Compression, and the link between the two in modern applications. Beginning with the notion that a link could exist due to the similar structure of the general methods, chapters individually explore the processes. An analysis of classical cryptography starts in the classical age and describes methods used until World War II. Shifting to modern computer implementations, the call for National standards introduced a new generation of consumer computer based cryptographic methods that needed to be strong enough for world-wide use. Switching focus to data compression, compression methods from the 1950s through current day are explored and demonstrated. Ultimately, the original question is answered by accepting that a link does exist, but not in the form of a combination it was originally thought to be. Rather, when used in series: compression then encryption, the compression adds to the overall security of the data and yields a smaller encrypted file.
dc.identifier.urihttps://scholars.carroll.edu/handle/20.500.12647/3403
dc.subjectCryptography, Data Compression
dc.titleThe Mathematics of Cryptography & Data Compression
dc.typethesis
Files