Location:
Search - RSA 1024-bit
Search list
Description: 这个程序是网络信息安全概论课的课程实践,自己动手编写一个具于1024位大数
运算的ELGamal加密系统。
ELGamal 依赖大数运算，目前主流ELGamal算法都建立在512 到1024位的大数运算之上。
而大多数的编译器只能支持到64位的整数运算，即我们在运算中所使用的整数必须小
于等于64位，即：0xffffffffffffffff，也就是18446744073709551615，这远远达不
到RSA 的需要，于是需要专门建立大数运算库来解决这一问题-network information security Introduction of the course in practice, personally prepared with a majority in the 1024 operations ELGamal encryption system. ELGamal rely on large numbers efficiently, Currently mainstream ELGamal algorithms are built on 512-1024 Operators of large numbers above. Most of the compiler can only support 64-bit integer operations, Operators that we are used to be rounded up to less than 64, namely : 0xffffffffffffffff. 18446744073709551615 is, it is far less than the needs of the RSA, therefore need to establish specialized majority of the operation to resolve this problem
Platform: |
Size: 91962 |
Author: 明江 |
Hits:
Description: rsa加密算法的vc实现，可以实现1024位的加密-the source code of rsa algorithm in vc,which can do 1024bits encryption.
Platform: |
Size: 148480 |
Author: 李 |
Hits:
Description: 这个程序是网络信息安全概论课的课程实践,自己动手编写一个具于1024位大数
运算的ELGamal加密系统。
ELGamal 依赖大数运算，目前主流ELGamal算法都建立在512 到1024位的大数运算之上。
而大多数的编译器只能支持到64位的整数运算，即我们在运算中所使用的整数必须小
于等于64位，即：0xffffffffffffffff，也就是18446744073709551615，这远远达不
到RSA 的需要，于是需要专门建立大数运算库来解决这一问题-network information security Introduction of the course in practice, personally prepared with a majority in the 1024 operations ELGamal encryption system. ELGamal rely on large numbers efficiently, Currently mainstream ELGamal algorithms are built on 512-1024 Operators of large numbers above. Most of the compiler can only support 64-bit integer operations, Operators that we are used to be rounded up to less than 64, namely : 0xffffffffffffffff. 18446744073709551615 is, it is far less than the needs of the RSA, therefore need to establish specialized majority of the operation to resolve this problem
Platform: |
Size: 92160 |
Author: 明江 |
Hits:
Description: RSA 1024位加密算法封装，算法使用big-endian编码方式。用于Windows Mobile下-RSA 1024-bit encryption algorithm package algorithm uses big-endian encoding. Used under Windows Mobile
Platform: |
Size: 1256448 |
Author: test |
Hits:
Description: 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 computing categories, can be directly transplanted to use.
Platform: |
Size: 20480 |
Author: 曹鹏 |
Hits:
Description: 大数运算库源文件：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) Description: applicable to MFC, 1024 bit RSA operations
Platform: |
Size: 5120 |
Author: 梁增健 |
Hits:
Description: 支持大整数的RSA算法，还可以自动生成随机大素数-Support for large integer RSA algorithm, can also automatically generate random large prime numbers
Platform: |
Size: 62464 |
Author: 明 |
Hits:
Description: RSA加密算法的实现
2^1024大的素数实现-implement the RSA
Platform: |
Size: 3462144 |
Author: runnery |
Hits:
Description: 安全性大大改进,可算做能完全代替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 intermediate (chaining) value root truncated to desired final length? Location (level,index) input to each node
6. Root bit ?(aka “z-bit” or “pumpkin bit”) input to each compression function
7. Operations on 64-bit words The following operations only: –XOR–AND–SHIFT by fixed amounts:
Platform: |
Size: 10240 |
Author: haec |
Hits:
Description: 使用vc编写的1024位rsa算法，能高效地实现对任意文件的加解密功能，欢迎下载-Vc prepared using 1024-bit rsa algorithm can efficiently realize arbitrary file encryption and decryption functionality, please download the
Platform: |
Size: 1071104 |
Author: 刘琦 |
Hits:
Description: rsa algorithm .... works fine for 1024 bit prime numbers
Platform: |
Size: 7168 |
Author: stane |
Hits:
Description: RSA加密算法的实现，1024位
是贷款累计发生了科技发达拉斯卡积分-RSA Encryption Algorithm, 1024 is the cumulative incidence of credit points of science and technology developed Raska
Platform: |
Size: 651264 |
Author: 崔哥 |
Hits:
Description: 实现了蒙哥马利算法，能够对2048，1024.512位的RSA进行加解密运算，能够自动生成密钥-Montgomery algorithm is implemented, can 2048,1024.512 bit RSA encryption and decryption operations to automatically generate the keys
Platform: |
Size: 1530880 |
Author: 曾健林 |
Hits:
Description: 编程实现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 ciphertext m. Note: The actual application, the 512-bit n is not secure, it is recommended that companies with 1024-bit n, and the important occasion with a 2048-bit n. Therefore, we should choose a large integer n.
Platform: |
Size: 45056 |
Author: semmir |
Hits:
Description: 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 use.
Platform: |
Size: 19456 |
Author: wangrui |
Hits:
Description: documentation of Implementing a 1024-bit RSA on FPGA
Platform: |
Size: 121856 |
Author: Lakshman |
Hits:
Description: 摘 要: 1982年，Quisquate和Couvreur提出了一种RSA的变型算法，称为RSA–CRT算法，这是一种基于中国剩余定理的能够加速RSA解密的算法。1990年，Wiener提出了另外一种RSA的变型算法，称为重新平衡–RSA，进一步通过把解密成本转移到加密成本上来加速RSA解密。但是，因为公开指数e通常和RSA系数是同一量级，所以这种方法实质上最大化了加密时间。在本文中，我们介绍两种重新平衡–RSA变型算法，它们的公开指数e比模量更加的小，因此能够在保持较低解密成本的同时有效地减少加密成本。对于一个1024位的RSA模量，我们的第一种变型算法（方案Ａ）的加密时间比原始的重新平衡–RSA算法的加密时间快至少2.6倍，而第二种变型算法（方案Ｂ）提供的加密时间至少比原来快３倍。在两种变型算法中，降低加密成本是以轻微地增加解密成本和增加核心生产成本为代价的。因此，这里提出的变型算法式是最适合应用在需要降低加密和解密成本的地方。关键字：RSA CRT 加密 数字签名 格基减化 密码分析学
-Abstract: In 1982, Quisquater and Couvreur proposed an RSA variant, called RSA-CRT, based on the Chinese Remainder Theorem to speed up RSA decryption. In 1990, Wiener suggested another RSA variant, called Rebalanced-RSA, which further speeds up RSA decryption by shifting decryption costs to encryption costs. However, this approach essentially maximizes the encryption time since the public exponent e is generally about the same order of magnitude as the RSA modulus. In this paper, we introduce two variants of Rebalanced-RSA in which the public exponent e is much smaller than the modulus, thus reducing the encryption costs, while still maintaining low decryption costs. For a 1024-bit RSA modulus, our fi rst variant (Scheme A) offers encryption times that are at least 2.6 times faster than that in the original Rebalanced-RSA, while the second variant (Scheme B) offers encryption times at least 3 times faster. In both variants, the decrease in encryption costs is obtained at the expe
Platform: |
Size: 561152 |
Author: huhui |
Hits:
Description: 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 inner fuction like multiplicatin,addition,mod,power,subtaction , greater,less,equal etc .all opetaion for 1024 bit data.
Platform: |
Size: 13312 |
Author: jitendra singh |
Hits:
Description: 基于crypto++实现RSA密钥对生成，密钥长度1024，vs2010实现-generate RSA key pair based on Crypto++，and save the key pairs which is 1024 bit in txt file
Platform: |
Size: 9454592 |
Author: dingkaimeng |
Hits:
Description: 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 public key can be
// decrypted with the private key. The reverse is
// also true: anything encrypted using the private
// key can be decrypted using the public key.
// Generate a 1024-bit key. Chilkat RSA supports
// key sizes ranging from 512 bits to 40
Platform: |
Size: 1176576 |
Author: asdgggg
|
Hits: