Skip to content

Latest commit

 

History

History
16 lines (10 loc) · 647 Bytes

README.md

File metadata and controls

16 lines (10 loc) · 647 Bytes

Computer and Network Security (CS529)

Abstract

In this report, we will explore discrete log-based elliptic curve cryptography. We first examine the elliptic curve over finite fields and different cryptosystems build upon them. Then we will examine the discrete log problem on these curves and algorithms that attempt to solve it. We will also be implementing attacks where these algorithms can potentially lead to partial or total break of the cryptosystem.

Group Members

  1. Avneet Singh Channa, 170101015
  2. Aranya Aryaman, 170101011

A good repo to watch performance of different algos https://github.com/Telariust/pollard-kangaroo