Title:
Chinese_Remainder_Theorem
Download
Description: Description
eulerphi(p) computes the Euler s Totient Function of p where p is a positive integer and eulerphi(1)=1 by definition.
invmodn(x,p) computes the inverse modulo of x under p using repeated multiplication technique.This function can work for a long range of numbers.
CRT(r,p) computes the value of the system of equations that is described in the summary.
invmodn funtion comes in handy for use in RSA algorithm.
To Search:
File list (Check if you may need any files):
CRT.m
eulerphi.m
invmodn.m
license.txt
