Practicality of algorithmic number theory

Simple item page
dc.contributor.advisorLuecke, John Edwin
dc.creatorTaylor, Ariel Jolishiaen
dc.date.accessioned2013-12-12T16:50:04Zen
dc.date.issued2013-08en
dc.date.submittedAugust 2013en
dc.date.updated2013-12-12T16:50:04Zen
dc.descriptiontexten
dc.description.abstractThis report discusses some of the uses of algorithms within number theory. Topics examined include the applications of algorithms in the study of cryptology, the Euclidean Algorithm, prime generating functions, and the connections between algorithmic number theory and high school algebra.en
dc.description.departmentMathematicsen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/2152/22665en
dc.language.isoen_USen
dc.subjectNumber theoryen
dc.subjectMathematicsen
dc.subjectAlgorithmen
dc.subjectAlgorithmicen
dc.subjectGaussianen
dc.subjectCryptographyen
dc.subjectEncryptionen
dc.subjectCryptanalysisen
dc.titlePracticality of algorithmic number theoryen
thesis.degree.departmentMathematicsen
thesis.degree.disciplineMathematicsen
thesis.degree.grantorThe University of Texas at Austinen
thesis.degree.levelMastersen
thesis.degree.nameMaster of Artsen

Access full-text files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TAYLOR-MASTERSREPORT-2013.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.84 KB
Format:
Plain Text
Description:
Download

Collections

UT Electronic Theses and Dissertations