搜索资源列表
RSA解密和加密算法的实现和应用
- RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a,
rsa
- 1) 找出两个相异的大素数P和Q，令N＝P×Q，M＝（P－1）（Q－1）。 2) 找出与M互素的大数E，用欧氏算法计算出大数D，使D×E≡1 MOD M。 3) 丢弃P和Q，公开E，D和N。E和N即加密密钥，D和N即解密密钥。 -1) to identify two different large prime numbers P and Q, so N = P × Q, M = (P-1) (Q-1). 2) to identify and M large numbers cop
vbFangXiemimaxitiong
- 仿射密码是一种替换密码。它是一个字母对一个字母的。 它的加密函数是<math>e(x)=ax+b\pmod</math>，其中 <math>a</math>和<math>m</math>互质。 <math>m</math>是字母的数目。 译码函数是<math>d(x)=a^(x-b)\pmod</math>，其中<math>a^</ma
Euler
- 欧拉定理 对于互质的整数a和n，有aφ(n) ≡ 1 mod n -Euler' s theorem for coprime integers a and n, there is aφ (n) ≡ 1 mod n
Euler
- 设n是一正整数，小于n且与n互素的正整数的个数为n的欧拉函数，记为Euler(n)。-Set n is a positive integer less than n and coprime with n positive integer n the number for the Euler function, recorded as Euler (n).
zshz
- 判断输入的数字是否质数,再判断这两个数是否互质-Input to determine whether the number of prime number, and then determine whether or not these two the number of coprime
cata
- 利用大整数问题实现catalan数的求解，catalan数的计算涉及到互质问题-The use of large integer problems solving to achieve catalan number, catalan calculation of the number of issues related to coprime
dbcdecom
- 矩阵右互质分解程序 在鲁棒稳定性中有重要的应用-This function returns the result of double coprime decomposition.
main.cpp_1
- This program calculate if two numbers are coprimes For given integer N (1<=N<=10^4) find amout of positive numbers not greater than N that coprime with N. Let us call two positive integers (say, A and B, for example) coprime if (and only
niyuan
- 本程序实现判断两个大数之间是否互素，例如大数A和大数M，在程序运行之后会显示A和M是否互素，A是否存在模M的逆元，并且显示出程序运行所需要的时间。-This program is used to judge whether two large numbers are mutually prime numbers.For example,A and M are large numbers , when we run the program ,we will see whether A and M
Chap02.pdf
- This document gives a clear detail on coprime factorization.
yushu
- 余数定理用于多基线相位干涉仪的解模糊中要求基线关系互质-Remainder theorem for the solution of multi-baseline interferometer fuzzy requirements baseline relations coprime
a
- 在数论，对正整数n，欧拉函数是少于或等于n的数中与n互质的数的数目。 φ函数的值 通式：φ(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…..(1-1/pn) 其中p1, p2……pn为x的所有质因数，x是不为0的整数。φ(1)=1（唯一和1互质的数就是1本身）。 (注意：每种质因数只一个。比如12=2*2*3 那么φ（12）=12*（1-1/2）*(1-1/3)=4) 若n是质数p的k次幂，φ(n)=p^k-p^(k-1)=(p-1)p^(k-1)，因为除了
MUSCI_COPRIME
- doa,coprime。从2M+N-1根天线扩展到MN-1根天线。M、N均为互质，M小于N-doa, coprime, MUSIC
A-Search-free-DOA-Estimation-Algorithm-for-Coprim
- In this paper, a fast search-free method for direction-of-arrival (DOA) estimation with coprime arrays was proposed. It is based on the use of methods that operate on the uniform linear subarrays of the coprime array and that enjoy many proces
CRT
- 中国剩余定理（CRT)的实现，输入的模数需要互素，结果为原来的数。-Chinese Remainder Theorem (CRT) implementation, modulus entered Coprime needs, the result is the original number.
co_prime
- 互质阵列中稀疏表示理论完成DOA估计算法-Coprime complete array sparse representation theory DOA Estimation Algorithm
demo
- 基于互质采样-分段相参积累多项式相位变换的微弱线性调频信号检测算法。该代码的相关论文以oral presentation的形式发表于2018年10月在南京举行的IET国际雷达会议。(Multi-component LFM parameter estimation via order-2 DPT (overlapping and coprime) Author: Dr. Shengheng LIU)
sparse-coprime-
- sparse coprime array direction of arrival
separse-coprime
- sparse-coprime sparse-coprime-sensor-arrays-60ec3c9a1c2219ddfc896883c09933df546eb865, 0 , 2019-03-30 sparse-coprime-sensor-arrays-60ec3c9a1c2219ddfc896883c09933df546eb865\3rd party functions, 0 , 2019-03-30 sparse-coprime-sensor-arrays-60ec3c9a1c