Matching Items (1)
Description
In the modern world with the ever growing importance of technology, the challenge of information security is of increasing importance. Cryptographic algorithms used to encode information stored and transmitted over the internet must be constantly improving as methodology and technology for cyber attacks improve. RSA and Elliptic Curve cryptosystems such as El Gamal or Diffie-Hellman key exchange are often used as secure asymmetric cryptographic algorithms. However, quantum computing threatens the security of these algorithms. A relatively new algorithm that is based on isogenies between elliptic curves has been proposed in response to this threat. The new algorithm is thought to be quantum resistant as it uses isogeny walks instead of point addition to generate a shared secret key. In this paper we will analyze this algorithm in an attempt to understand the theory behind it. A main goal is to create isogeny graphs to visualize degree 2 and 3 isogeny walks that can be taken between supersingular elliptic curves over small fields to get a better understanding of the workings and security of the algorithm.
ContributorsLoucks, Sara J (Author) / Jones, John (Thesis director) / Bremner, Andrew (Committee member) / Computer Science and Engineering Program (Contributor) / School of Film, Dance and Theatre (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05