Euclid Algorithm

I have a cryptography assignement and  I have to find Bob's secret key based on Euclid algorithm. In my Lecture Notes is written:
Given two numbers (r,s), the algorithm outputs a number x such that r*x=1(mod s)

I'm using Java to write the app to solve this. I have r and s and I have to find x.
There is a method in Java to do this, or can anyoane to give any ideas?
edi02Asked:
Who is Participating?
 
oBdACommented:
Here's an explanation of the Euclid algorithm: http://www.maths.lse.ac.uk/Courses/MA314/euclid.pdf. Based on this, you should be able to understand the principle, and to create your program. The former is more important: if someone gives you a piece of code, and you present it, you'll probably be asked why it produces the correct output; if you start stuttering away, chances are this will not be recognized as a valid solution ...
0
 
luv2smileCommented:
You may want to post your question in the programming section so the appropriate experts will see it. This is the Windows 2000 operating system section.
0
 
Danny ChildIT ManagerCommented:
... and experts can't do assignments for users...
http://www.experts-exchange.com/Operating_Systems/Win2000/help.jsp#hi105

you'll have to figure the solution yourself, but feel free to ask for "pointers"
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.