Show simple item record

dc.contributor.authorVasiga, Troy Michael John
dc.date.accessioned2008-08-26 18:46:06 (GMT)
dc.date.available2008-08-26 18:46:06 (GMT)
dc.date.issued2008-08-26T18:46:06Z
dc.date.submitted2008
dc.identifier.urihttp://hdl.handle.net/10012/3895
dc.description.abstractCPU's are unreliable: at any point in a computation, a bit may be altered with some (small) probability. This probability may seem negligible, but for large calculations (i.e., months of CPU time), the likelihood of an error being introduced becomes increasingly significant. Relying on this fact, this thesis defines a statistical measure called robustness, and measures the robustness of several number-theoretic and algebraic algorithms. Consider an algorithm A that implements function f, such that f has range O and algorithm A has range O' where O⊆O'. That is, the algorithm may produce results which are not in the possible range of the function. Specifically, given an algorithm A and a function f, this thesis classifies the output of A into one of three categories: 1. Correct and feasible -- the algorithm computes the correct result, 2. Incorrect and feasible -- the algorithm computes an incorrect result and this output is in O, 3. Incorrect and infeasible -- the algorithm computes an incorrect result and output is in O'\O. Using probabilistic measures, we apply this classification scheme to quantify the robustness of algorithms for computing primality (i.e., the Lucas-Lehmer and Pepin tests), group order and quadratic residues. Moreover, we show that typically, there will be an "error threshold" above which the algorithm is unreliable (that is, it will rarely give the correct result).en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectalgorithm analysisen
dc.subjecterror detectionen
dc.subjectprimality testingen
dc.titleError Detection in Number-Theoretic and Algebraic Algorithmsen
dc.typeDoctoral Thesisen
dc.comment.hiddenUsed the latex e-version of the template in LaTeX in creating the PDF.en
dc.pendingfalseen
dc.subject.programComputer Scienceen
uws-etd.degree.departmentSchool of Computer Scienceen
uws-etd.degreeDoctor of Philosophyen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages