搜索资源列表
ELGamaltool
- 这个程序是网络信息安全概论课的课程实践,自己动手编写一个具于1024位大数 运算的ELGamal加密系统。 ELGamal 依赖大数运算，目前主流ELGamal算法都建立在512 到1024位的大数运算之上。 而大多数的编译器只能支持到64位的整数运算，即我们在运算中所使用的整数必须小 于等于64位，即：0xffffffffffffffff，也就是18446744073709551615，这远远达不 到RSA 的需要，于是需要专门建立大数运算库来解决这一问题-network
RSA RSA公钥加解密算法源码
- RSA公钥加解密算法源码，VC++语言开发， 可生成最长1024比特密钥对，里面包含大数运算类，可直接移植使用。-RSA public key encryption algorithm source code, VC++ language development, can generate up to 1024-bit key pair, which contains large numbers operation classes can be directly transplanted to
BigInt.rar
- 大数运算库源文件：BigInt.cpp 作者：afanty@vip.sina.com 版本：1.2 (2003.5.13) 说明：适用于MFC，1024位RSA运算,Large numbers computing library source files: BigInt.cpp Author: afanty@vip.sina.com Version: 1.2 (2003.5.13) Descr iption: applicable to MFC, 1024 bit RSA operatio
refine_RSA
- 实现了蒙哥马利算法，能够对2048，1024.512位的RSA进行加解密运算，能够自动生成密钥-Montgomery algorithm is implemented, can 2048,1024.512 bit RSA encryption and decryption operations to automatically generate the keys
1024RSA
- 支持大整数的RSA算法，还可以自动生成随机大素数-Support for large integer RSA algorithm, can also automatically generate random large prime numbers
RSA(3)
- RSA加密算法的实现 2^1024大的素数实现-implement the RSA
rsa
- 安全性大大改进,可算做能完全代替MD5的散列验证算法.-1.Large input message block size 2.provably resistant to differential attacks 3.Alternative sequential mode 4.Key input K??of up to 512 bits?? K is input to every compression function 5.1024-bit interm
rsa_file
- 使用vc编写的1024位rsa算法，能高效地实现对任意文件的加解密功能，欢迎下载-Vc prepared using 1024-bit rsa algorithm can efficiently realize arbitrary file encryption and decryption functionality, please download the
rsa.tar
- rsa algorithm .... works fine for 1024 bit prime numbers
RSA
- RSA加密算法的实现，1024位 是贷款累计发生了科技发达拉斯卡积分-RSA Encryption Algorithm, 1024 is the cumulative incidence of credit points of science and technology developed Raska
RSA
- 编程实现RSA算法。包括：生成公钥(e, n)和私钥d，对明文m加密，对密文m解密。 注：实际应用中，512比特的n 已经不够安全，所以建议公司用1024比特的n，及其重要的场合用2048比特的 n。所以大家要选择大整数n。-Programming RSA algorithm. Include: Creation of a public key (e, n) and private key d, m the plaintext encryption, decryption of cipher
project-report
- documentation of Implementing a 1024-bit RSA on FPGA
Abstract
- 摘 要: 1982年，Quisquate和Couvreur提出了一种RSA的变型算法，称为RSA–CRT算法，这是一种基于中国剩余定理的能够加速RSA解密的算法。1990年，Wiener提出了另外一种RSA的变型算法，称为重新平衡–RSA，进一步通过把解密成本转移到加密成本上来加速RSA解密。但是，因为公开指数e通常和RSA系数是同一量级，所以这种方法实质上最大化了加密时间。在本文中，我们介绍两种重新平衡–RSA变型算法，它们的公开指数e比模量更加的小，因此能够在保持较低解密成本的同时有效地减少
RSA_algo
- this RSA algorithm which run for 1024 bits data. which have inner fuction like multiplicatin,addition,mod,power,subtaction , greater,less,equal etc .all opetaion for 1024 bit data. -this is RSA algorithm which run for 1024 bits data. which have inn
GenerateKey
- 基于crypto++实现RSA密钥对生成，密钥长度1024，vs2010实现-generate RSA key pair based on Crypto++，and save the key pairs which is 1024 bit in txt file
OpenSourceCaptchaSolver
- This example also generates the public and private // keys to be used in the RSA encryption. // Normally, you would generate a key pair once, // and distribute the public key to your partner. // Anything encrypted with the pub