文件名称:Chinese_Remainder_Theorem
-
所属分类：
- 标签属性：
- 上传时间：2016-06-23
-
文件大小：1.71kb
-
已下载：4次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
中国余数定理及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
eulerphi.m
invmodn.m
license.txt
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。