Exploring the Discrete Logarithm with Random Ternary Graphs Public

http://ir.library.oregonstate.edu/concern/honors_college_theses/w9505239h

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Encryption is essential to the security of transactions and communications, but the algorithms on which they rely might not be as secure as we all assume. In this paper, we investigate the randomness of the discrete exponentiation function used frequently in encryption. We show how we used exponential generating functions to gain theoretical data for mapping statistics in ternary functional graphs. Then, we compare mapping statistics of discrete exponentiation functional graphs, for a range of primes, with mapping statistics of the respective ternary functional graphs.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Non-Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2008-06-17T21:37:35Z (GMT). No. of bitstreams: 1max brugger thesis.pdf: 212884 bytes, checksum: 065adf800db45e9fe02cf2ca640c8104 (MD5)
  • description.provenance : Submitted by Heather Boren (borenh) on 2008-06-17T21:07:13ZNo. of bitstreams: 1max brugger thesis.pdf: 212884 bytes, checksum: 065adf800db45e9fe02cf2ca640c8104 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items