Program2 - 2004 Summer COT 5937 Program #2 El Gamal and the...

This preview shows pages 1–2. Sign up to view the full content.

2004 Summer COT 5937 Program #2 El Gamal and the Discrete Log Problem Assigned: 7/13/04 (Tuesday) Due: 7/21/04 (Wednesdsay) The heart of the security of the El Gamal cryptosystem is the Discrete Log problem. Here is the specific problem statement: Given public values p, α and β where p is prime, α is a primitive root mod p, and β = α a mod p, determine the value of a. For this assignment, your goal is to use Shanks' Algorithm to solve the Discrete Log problem. For the entire class, I have chosen the public values p = 238191222949 α = 492 However, due to security reasons, I have chosen different values of β for the entire class. These are all listed on the next page. (Please don't do someone else's homework and find a for their β !!! If you happen to accidentally stumble across this information, DO NOT give it to them!!!) You should turn in an electronic copy of the code you write to the TA ([email protected]). Your code should allow the TA to enter in your value of Beta as the only input and should output the corresponding value of a. ( Thus, I am asking you to

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 07/14/2011.

Page1 / 2

Program2 - 2004 Summer COT 5937 Program #2 El Gamal and the...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online