Electronic Theses and Dissertations

Identifier

866

Date

2013

Date of Award

4-23-2013

Document Type

Thesis

Degree Name

Master of Science

Major

Mathematical Sciences

Concentration

Mathematics

Committee Chair

Paul N Balister

Committee Member

Alistair J Windsor

Committee Member

Vladimir S Nikiforov

Abstract

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.

Comments

Data is provided by the student.

Library Comment

dissertation or thesis originally submitted to the local University of Memphis Electronic Theses & dissertation (ETD) Repository.

Share

COinS