文件名称:Chinese_Remainder_Theorem
介绍说明－－下载内容均来自于网络，请自行研究使用
中国余数定理及Matlab代码实现,总共包括三个函数，eulerphi(p)函数用于计算the Euler s Totient Function of p，invmodn(x,p)函数计算the inverse modulo of x under p ，CRT(r,p)函数实现结果。-Descr iption
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.
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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
CRT.m
eulerphi.m
invmodn.m
license.txt