Show simple item record

dc.contributor.authorAgboola, Titilayo
dc.date.accessioned2023-04-14T12:45:03Z
dc.date.available2023-04-14T12:45:03Z
dc.date.issued2023-04-13
dc.identifier.urihttp://hdl.handle.net/10222/82406
dc.description.abstractFermat quotients are based on Fermat’s little theorem. They possess properties that make them suitable for generating pseudo-random numbers. They can also be used to generate Boolean functions. This thesis presents an overview of major milestones in the study of Fermat quotients and related concepts. In particular, applications of Fermat quotients in cryptography are discussed.en_US
dc.language.isoenen_US
dc.subjectcryptographyen_US
dc.subjectpseudorandomnessen_US
dc.subjectLegendre sequenceen_US
dc.subjectwell-distribution measureen_US
dc.subjectcorrelation measureen_US
dc.subjectBoolean functionen_US
dc.subjectFermat quotienten_US
dc.titleThe use of Fermat quotients in cryptographyen_US
dc.date.defence2023-04-12
dc.contributor.departmentDepartment of Mathematics & Statistics - Math Divisionen_US
dc.contributor.degreeMaster of Scienceen_US
dc.contributor.external-examinern/aen_US
dc.contributor.graduate-coordinatorTheo Johnson-Freyden_US
dc.contributor.thesis-readerKeith Johnsonen_US
dc.contributor.thesis-readerPeter Selingeren_US
dc.contributor.thesis-supervisorKarl Dilcheren_US
dc.contributor.ethics-approvalNot Applicableen_US
dc.contributor.manuscriptsNoen_US
dc.contributor.copyright-releaseNot Applicableen_US
 Find Full text

Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record