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

The Chinese remainder theorem and its application in the Pohlig-Hellman algorithm for solving the discrete logarithm problem.
https://github.com/uofsc-fall-2022-math-587-001/homework6

cryptography discrete-logarithm go latex math

Last synced: about 14 hours ago
JSON representation

The Chinese remainder theorem and its application in the Pohlig-Hellman algorithm for solving the discrete logarithm problem.

• Host: GitHub
• URL: https://github.com/uofsc-fall-2022-math-587-001/homework6
• Owner: UofSC-Fall-2022-Math-587-001
• Created: 2022-09-23T20:38:27.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2022-09-29T17:37:45.000Z (about 2 years ago)
• Last Synced: 2024-05-18T01:51:45.988Z (6 months ago)
• Topics: cryptography, discrete-logarithm, go, latex, math
• Language: TeX
• Homepage:
• Size: 168 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
## Homework 6

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 you will implement the algorithm of the Chinese remainder theorem 

for solving a system of two congruences in Go. You may find it helpful to extend 

this to larger systems. Implementing the Pohlig-Hellman algorithm using this 

and Shanks' algorithm would also help with homework.