搜索资源列表
aa
- 凯撒密码的过程,再用配对字母取代讯息里的原始字母位移加密法(shift cipher)：模数计算。Ek(x)=(x+k)mod 26，Dk(y)=(y –k)mod 26 如：k=5 “hello world”加密为：mjqqt….
DSA
- Digital Signature Algorithm (DSA)是Schnorr和ElGamal签名算法的变种，被美国NIST作为DSS(DigitalSignature Standard)。算法中应用了下述参数： p：L bits长的素数。L是64的倍数，范围是512到1024； q：p - 1的160bits的素因子； g：g = h^((p-1)/q) mod p，h满足h < p - 1, h^((p-1)/q) mod p > 1； x：x
RSA
- 本软件围绕小模数RSA的实现这一主题，用图形化界面实现了密钥的随机产生、加密数据、解密数据等功能。所用语言：C# -This software around the small modulus RSA implementation of this theme, graphical interface to achieve a randomly generated key to encrypt data, decrypt data and other functions.
en2_src
- 基于二进制模2除法的简单流加解密算法。要求被加密的数据至少8字节，字节数能被4整除。 --pclion -Binary mode based on division 2 of the easy encryption and decryption algorithm flow. Require encryption of data at least 8 bytes, number of bytes to be divisible by 4.- pclion
IDEA
- Markov密码的(差分链)转移概率矩阵是双随机矩阵，其第二大（模）特征值对于确定Markov密码必要的迭代轮数有重要价值。该程序由本人编写，实现了求IDEA密码的缩小模型IDEA(8)的转移概率矩阵П0第二大（模）特征值-Markov password (differential chain) transition probability matrix is a doubly stochastic matrix, its second largest (modulus) eigenvalue
Affine-password
- 一个经典的古典加密算法（仿射变换加密算法）的设计与实现，里面包含了一个求模数的逆的算法-A classic classical encryption algorithms (affine transform encryption algorithm) design and implementation, which includes a number of inverse modulus algorithm
extendedeuclid
- 作者身份：华南理工大学知识产权学院王桂林，这是我自己编写的拓展欧几里得算法，用于实现RSA加密中的求模数乘法逆元，适合初学者作参考代码。文件内容是VS C++项目文件。(I am a student who is from South China University of Technology.This is a realization of the extended Euclid calculation, which can be used to do the RSA. I suggest