搜索资源列表
新建 Microsoft Word 文档
- RSA核心运算使用的乘模算法就是 M(A*B)。虽然M(A*B)并不是乘模所需要的真正结果，但只要在幂模算法中进行相应的修改，就可以调用这个乘模算法进行计算了。本软件起初未使用Montgomery 乘模算法时，加密速度比使用Montgomery乘模算法慢，但速度相差不到一个数量级。 将上述乘模算法结合前面叙述的幂模算法，构成标准Montgomery幂模算法，即本软件所使用的流程
CRYPTER_FICHIER_TXT_CPP
- un fichier et peut le cacher dans un autre. C eet original avec les chifres, c est m阭e tr鑣 bien invent? Bravo Pour un d閎utant c est bien trop
BCH_RS
- bch编解码MATLAB程序，可以直接计算M小于12的BCH码生成多项式-BCH codec MATLAB procedures, can be directly calculated M is less than 12 BCH code generated polynomial
HMAC-SHA
- hmac using SHA algorithm source code-hmac using SHA algorithm source code...
Matching_M-Commerce
- Matching M-Commerce Needs and Concerns - Wireless,Wlan,wifi,Configuration,and,Optimization Tips
watermarking
- CT based encryption 1. Open contourlet 5 and run aaa.m for image decomposition and for denoising 2. Open tsss and A_hidetext.m and set break point at line 109 and run 3. After selecting image ind text press F5 4. Now run H_finalextra
NSGAII
- [num,len] = size(y) Initialize all the distance of individuals as zero. for i = 1 : M for j = 2 : num - 1 distance(j).individual = 0 -[num,len] = size(y) Initialize all the distance of individuals as zero. for i = 1 : M fo
Mjiajiemi
- m序列加解密 m序列加解密 m序列加解密 -m-sequence encryption and decryption the m sequence encryption and decryption m sequence encryption and decryption the m sequence encryption and decryption m sequence encryption and decryption m sequence encryption and decryptio
riddhi
- I hereby declare that this thesis contains literature survey and original research work by the undersigned, as part of requirements of the Degree of M.Tech. (IT) in Software Engineering. All information in this document has been obtained and presente
m
- sh-1的加密解密算法的实现，有相关文件和代码-sh-1 encryption and decryption algorithm, related documents and code
456
- RSA算法的C语言实现 1.密钥的产生 (1)选两个安全的大素数p和q。 (2)计算n=p×q，φ(n)=(p-1)(q-1)，其中φ(n)是n的欧拉函数值。 (3)选一整数e，满足1<e<φ(n)，且gcd(φ(n),e)=1。 (4)计算d，满足de≡1 modφ(n)，即d是e在模φ(n)下的乘法逆元，因e与φ(n)互素，由模运算可知，它的乘法逆元一定存在。 (5)以{e,n}为公开钥，{d,n}为秘密钥。 2.加密 加密时首先将明文M比特串分组
lsb
- matlab运行的lsb隐写算法，附带实验报告，lsbget.m,lsbhide.m,jpgand.m-matlab running lsb steganography, with lab reports, lsbget.m, lsbhide.m, jpgand.m
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
vigenere
- 维基尼亚密码的matlab程序，解压m文件放在matlab工程目录即可！-matlab code for vigenere cipher
MerkleHellman
- The encryption algorithm using Merkle-Hellman knapsacks starts with a binary message. * The message is envisioned as a binary sequence P = [p1, p2, … ,pk]. * Divide the message into blocks of m bits, Po = [P1, P2, ... ,Pm], P1 = [Pm+1, .
hide_final.m.tar
- stegnography s hiding part of gray scale image within rgb image
diffeehellmanPROGRAM
- Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the answer. A handy standard no
RC4-Prog
- Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the answer. A handy standard no
prob3
- Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to