https://github.com/uofsc-fall-2022-math-587-001/homework5

Diffie-Hellman key exchange and ElGamal cryptosystem. Plus Shanks' algorithm for solving the discrete logarithm problem.
https://github.com/uofsc-fall-2022-math-587-001/homework5

cryptography discrete-logarithm go latex math

Last synced: about 15 hours ago
JSON representation

Diffie-Hellman key exchange and ElGamal cryptosystem. Plus Shanks' algorithm for solving the discrete logarithm problem.

• Host: GitHub
• URL: https://github.com/uofsc-fall-2022-math-587-001/homework5
• Owner: UofSC-Fall-2022-Math-587-001
• Created: 2022-09-19T19:02:28.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2022-09-29T17:33:14.000Z (about 2 years ago)
• Last Synced: 2024-06-20T15:55:49.495Z (5 months ago)
• Topics: cryptography, discrete-logarithm, go, latex, math
• Language: TeX
• Homepage:
• Size: 104 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## Homework 5

This week we have a written part and an implementation part. 

### Written part 

Answer the questions found in `main.tex` and turn your answers in by uploading them 

back here before midnight on the due date. You may do this as many times as 

you want. Only your final submission counts.

Remember this is math class so be sure to justify your answers. You will be 

graded on correctness and 

Note: when you submit, your filename must be `solutions.pdf` and it must be a pdf. 

### Implementation part 

This week we start with the first algorithmic attempt at faster solution to 

solving the discrete logarithm problem: Shanks's algorithm. 

Make `hw5.go` pass the tests. The tests only check to see if you correctly 

compute the discrete log. Shanks's algorithm value is the speed up from 

a brute force search to O(N^{1/2} log N). Read the proof of Propositon 2.21 

and take a look at the documentation for [`sort.Search`](https://pkg.go.dev/sort#Search) 

and [`sort.Sort`](https://pkg.go.dev/sort#Sort).