Scribd
Upload
62 views2 pages

Chinese Remainder Theorem-Project 2020-21

The document describes a method for calculating a value x given values for b, n, and N. It involves taking x modulo n for each value, multiplying the results by N/n, and summing the products. Two examples are shown applying the method and obtaining a final value of x modulo N both times.

Uploaded by

Dane Sinclair
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
62 views2 pages

Chinese Remainder Theorem-Project 2020-21

The document describes a method for calculating a value x given values for b, n, and N. It involves taking x modulo n for each value, multiplying the results by N/n, and summing the products. Two examples are shown applying the method and obtaining a final value of x modulo N both times.

Uploaded by

Dane Sinclair
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Method bi Ni xi biNixi

x= b1 mod n1 b1 n2n3=N/n1 x1 b1N1x1


x= b2 mod n2 b2 n1n3=N/n2 x2 b2N2x2
x= b3 mod n3 b3 n1n2=N/n3 x3 b3n3x3

N= n1*n2*n3

x= 3 mod 5 3 56 1 168
x= 1 mod 7 1 40 3 120
x= 6 mod 8 6 35 3 630

N= n1*n2*n3 = 280 Total = 918

x= 918 mod 280


= 78 mod 280

x= 78
Method bi Ni xi biNixi
x= b1 mod n1 b1 2n3=N/n1 x1 b1N1x1
x= b2 mod n2 b2 1n3=N/n2 x2 b2N2x2
x= b3 mod n3 b3 1n2=N/n3 x3 b3n3x3

N= n1*n2*n3

x= 2 mod 3 2 20 1 40
x= 1 mod 4 1 15 3 45
x= 3 mod 5 3 12 3 108

N= n1*n2*n3 = 60 Total = 193

x= 193 mod 60
= 13 mod 60

x= 13

You might also like