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.
Josh Holden, Mathematics Department, Rose-Hulman Institute of Technologyholden@rose-hulman.edu
Frederick, Christina and Brugger, Max
"The Discrete Logarithm Problem and Ternary Functional Graphs,"
Rose-Hulman Undergraduate Mathematics Journal: Vol. 8
, Article 8.
Available at: http://scholar.rose-hulman.edu/rhumj/vol8/iss2/8