搜索资源列表
s-zhihuan
- 从一个随机文件读取256字节数据形成数据区DArea，再应用洗牌法所给的方法生成0~255的一个全排列DTab。试分别写出\"求DArea中全部数据经 （1）以DTab为S-盒； （2）以DTab为P置换 -from a random file read 256 byte data area DArea form data, re-shuffling in law application to the formation of 0 ~ 255 DTab a full array. T
BigInteger_src
- C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random ran
S_P盒的产生
- 置换代换密码体制的S-P盒的发生器，能随机产生S盒和P盒，用于置换代换密码体制的加密解密-replacement substitution Cryptosystem S-P boxes of generators, can generate random boxes S and P boxes for the replacement substitution Cryptosystem encryption and decryption
SPN加密
- 此代码实现S-P密码的加密解密，在这个实验中用到了S盒和P盒随机发生器-this code to achieve S-P password encryption and decryption, in this experiment uses S boxes and boxes of random generator P
RSA_java
- 带界面的RSA算法，软件包中含有可执行程序，功能有自动生成随机素数P、Q，公钥，密钥，对数字进行加密解密。-Interface with the RSA algorithm, packages containing executable programs, automatic generation of random functions of prime numbers P, Q, a public key, keys for encryption and decryption of digit
ElGamal
- Elgamal签名是基于离散对数问题的，首先选择p，g计算出B，作为公钥（p，g，B），在选择一个a作为私钥，给出明文m，对明文机型加密，计算出x，y，得到签名，接收方就可以进行验证。签名过程中必须使用Hash函数，否则的话容易受到存在性伪造攻击，并且签名长度是明文长度的二倍。 -Obtained by the Elgamal discrete logarithm problem cryptographic algorithms, first, Elgamal key generation,
javaRSA
- 带界面的RSA算法，软件包中含有可执行程序，功能有自动生成随机素数P、Q，公钥，密钥，对数字进行加密解密。-Interface with the RSA algorithm, packages containing executable programs, automatic generation of random functions of prime numbers P, Q, a public key, keys for encryption -of random functions of
Elgamal
- ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two rando
sjqpl
- 编制生成0~n（n≤255）的一个全排列的程序，可选择下列两个方法之一或自行设计另外方法： 方法1：从一个随机文件读取n+1字节数据d0, d1, L, dn。由预先取定的一个0~n的全排列P（比如，可为0~n的自然排列）开始，依次对i=n, n-1, L, 1，计算：j=di-1+di (mod i)交换P的第i项第j项（在此注意我们假定P从第0项开始）。 方法2：用一个随机函数产生m（m>n）字节数据d1, d2, L, dm。对d1(mod (n+1)), d2(mod (n
tr_103265v010102p0
- FEC MBMS LTE uation ETSI The attached java code LossGenerator.java and Random.java may be used to generate the loss traces independently. The java trace file can be d as follows: java LossVectorGenerator p q gBLER bBLER subsamp n seed offse
New-folder-(4)
- We begin with choosing two random large distinct primes p and q. We also pick e, a random integer that is relatively prime to (p-1)*(q-1). The random integer e is the encryption exponent. Let n = p*q. Using Euclid s greatest common divisor a
diffie_hellman
- Implement Diffie-Hellman Key exchange protocol and demonstrate that at the end, both person will have a common Key. Do the following: 1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5). 2. Generate a, a random number mod p. Now generate A,