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?

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

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

Featured Post

Capture your entire system, including the host, with patented disk imaging integrated with VMware VADP / Microsoft VSS and RCT. RTOs is as low as 15 seconds with Acronis Active Restore™. You can enjoy unlimited P2V/V2V migrations from any source (even from a different hypervisor)

NTFS file system has been developed by Microsoft that is widely used by Windows NT operating system and its advanced versions. It is the mostly used over FAT file system as it provides superior features like reliability, security, storage, efficienc…