Wednesday, February 02, 2011

Crypto codes: Chinese remainder theorem

For gcd and inverse code, see Crypto codes

Java implementation of Chinese remainder theorem, download from here
Matlab code here

For this particular example, output will look like the following:

Step:0->x=2+3*5=17
Step:1->x=17+21*7=164
Solution:164

3 comments:

Loginbd said...

Ato high level r code bojha koster...

sheetal said...

apner to bhai bujhar dorkar nai.
ami bujhlei hoise :D

Anonymous said...

tumhi kay boltay mala kahich kalat nahi plz marathit sanga plz