Date of Award
Master of Science
Paul N Balister
Alistair J Windsor
Vladimir S Nikiforov
We describe a method for creating a hash function from supersingular elliptic curves and expander graphs. In the graph, the vertices are represented by supersingular elliptic curves and the edges are represented by isogenies between the curves. We will construct the hash function from l-isogenies where l = 3 and l =/= p, for a prime number p. We also provide algorithms to implement the hash function.
dissertation or thesis originally submitted to the local University of Memphis Electronic Theses & dissertation (ETD) Repository.
Smith, Stephen Gene, "Hash Functions from Expander Graphs and Supersingular Elliptic Curves" (2013). Electronic Theses and Dissertations. 724.