搜索资源列表
RPrintPrimes
- 用概率算法寻找1到10000之间的素数，该算法比确定性算法的运行时间大大缩小-Probabilistic algorithm to find prime between 1 to 10,000 the number of the algorithm running time than the deterministic algorithm greatly reduced
shanks
- 求离散对数的shanks算法，要求如下： 实现计算 Zp 中计算离散对数的 Shanks 算法，基本要求如下： 1）p 是一个小素数( 小于 32 bit )，a 是一个本原元。程序的输入为(p, a, b), 输出为 logab ( mod p) (可以用 log3525 (mod 809)等作为测试)； 2）采用快速模指数算法求幂（如am），采用扩展欧几里得算法求逆（ 如a-i (mod p) ）； 3）采用一种好的排序算法对 L1、L2 排序； 4）采用概率算
RSA-Attack
- RSA加密算法的基于概率算法的攻击，由N求出PQ。-RSA encryption algorithm based on probabilistic algorithms attack, obtained by N the PQ.
BGC
- Blum-Goldwasser Probabilistic Cipher (BGC) Function and Blum-Goldwasser Probabilistic Decipher (BGC) Function
acient
- 古典密码，通过概率统计判断加密算法是单表替代或是多表替代并初步估计是由几重替代-Classical cryptography, encryption algorithms via probabilistic judgment is replaced or a single table and multi-table alternative initial estimate is replaced by a few heavy
paa-master
- 概率原型分析软件，语言matlab，属于数据分析软件，非监督学习方法，类似于PCA,NMF等-Archetypal analysis represents a set of observations as convex combinations of pure patterns, or archetypes. The original geometric formulation of finding archetypes by approximating the convex hull of