A generalization of the Goresky-Klapper conjecture

dc.contributor.authorRichardson, CJ
dc.date.accessioned2018-07-25T20:29:16Z
dc.date.available2018-07-25T20:29:16Z
dc.date.graduationmonthAugust
dc.date.issued2018-08-01
dc.description.abstractFor a fixed integer n ≥ 2, we show that a permutation of the least residues mod p of the form f(x) = Ax[superscript k] mod p cannot map a residue class mod n to just one residue class mod n once p is sufficiently large, other than the maps f(x) = ±x mod p when n is even and f(x) = ±x or ±x [superscript (p+1)/2] mod p when n is odd. We also show that for fixed n the image of each residue class mod n contains every residue class mod n, except for a bounded number of maps for each p, namely those with (k −1, p−1) > (p−1)/1.6n⁴ and A from a readily described set of size less than 1.6n⁴. For n > 2 we give O(n²) examples of f(x) where the image of one of the residue classes mod n does miss at least one residue class mod n.
dc.description.advisorChristopher G. Pinner
dc.description.degreeDoctor of Philosophy
dc.description.departmentDepartment of Mathematics
dc.description.levelDoctoral
dc.identifier.urihttp://hdl.handle.net/2097/39058
dc.language.isoen_US
dc.publisherKansas State University
dc.rights© the author. This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectNumber theory
dc.subjectGoresky-Klapper
dc.subjectCryptography
dc.titleA generalization of the Goresky-Klapper conjecture
dc.typeDissertation

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ChristopherRichardson2018.pdf
Size:
376.51 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description: