Exploring the Discrete Logarithm with Random Ternary Graphs

Honors College Thesis

Öffentlich Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/honors_college_theses/w9505239h

Descriptions

Attribute Name	Values
Creator	Brugger, Max Francis Josef
Abstract	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	All rights reserved
Resource Type	Honors College Thesis
Date Available	2008-06-17T21:37:35+00:00
Date Issued	2008-05-29
Degree Level	Bachelor's
Degree Name	Honors Bachelor of Science (H.B.S.)
Degree Field	Mathematics
Degree Grantor	Oregon State University
Commencement Year	2008
Advisor	Cull, Paul
Committee Member	Holden, Joshua
Non-Academic Affiliation	Oregon State University. Honors College
Urheberrechts-Erklärung	In Copyright
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]
Replaces	http://hdl.handle.net/1957/8777

Parents:

This work has no parents.

In Collection:

Miniaturansicht	Titel	Hochladedatum	Sichtbarkeit	Aktionen
	max_brugger_thesis.pdf	2017-07-30	Öffentlich	Herunterladen