Description: RSA公钥密钥生成程序,C++语言编写,采用了自己的大数类,可在短时间内生成1024位的RSA公钥和密钥,内有详细注解-RSA public key generation procedures, C language, the use of large numbers of its own category, during a 1024 production of the RSA public key and key, with detailed notes Platform: |
Size: 1012790 |
Author:liujin |
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: 91962 |
Author:明江 |
Hits:
Description: RSA算法的VC实现，其中包括超长整数类，素数检验算法，大素数生成器和一般的数论算法，例如中国剩余定理解密RSA密文-RSA algorithm VC, including long integer type, in a few test algorithm, large prime number generator and the general theory of numbers algorithm, for example, Chinese Remainder Theorem RSA decryption ciphertext Platform: |
Size: 258048 |
Author:陈建湘 |
Hits:
Description: RSA公钥密钥生成程序,C++语言编写,采用了自己的大数类,可在短时间内生成1024位的RSA公钥和密钥,内有详细注解-RSA public key generation procedures, C language, the use of large numbers of its own category, during a 1024 production of the RSA public key and key, with detailed notes Platform: |
Size: 1012736 |
Author:liujin |
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加密算法加密、解密图片。本程序仅作为RSA原理理解，所以没有实现大数运算部分，RSA选取n为15~16位，加密图片不要选太大，否则会很慢。-This procedure achieved the RSA encryption algorithm with encryption, decryption picture. This procedure only as a principle of understanding of RSA, there is no part of the realization of large numbers computing, RSA select n to 15 ~ 16, encryption, image and not too much, otherwise they will be very slow. Platform: |
Size: 3072 |
Author:涂进 |
Hits:
Description: this the ADD routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the ADD routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above. Platform: |
Size: 13312 |
Author:majid |
Hits:
Description: this the SUB routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the SUB routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above. Platform: |
Size: 11264 |
Author:majid |
Hits:
Description: this the MONTGOMERY INV routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the MONTGOMERY INV routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above. Platform: |
Size: 13312 |
Author:majid |
Hits:
Description: this the MUL routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the MUL routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above. Platform: |
Size: 12288 |
Author:majid |
Hits:
Description: this the PRNG routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the PRNG routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above. Platform: |
Size: 12288 |
Author:majid |
Hits:
Description: 用自己的大数类写成的RSA算法，有加密和解密，速度一般-Classes with large numbers written in their own RSA algorithm, with encryption and decryption speed of the general Platform: |
Size: 218112 |
Author:虎爷 |
Hits:
Description: 标准c语言大数运算函数库，并附应用实例rsa加密程序。参考afanty编写适用与MFC的BigInt库。-Standard library c language operator of large numbers, with application examples rsa encryption. Reference afanty prepared for the BigInt with the MFC library. Platform: |
Size: 7168 |
Author:李抒昌 |
Hits:
Description: 用RSA算法实现加解密的功能，可支持128-2048位，RELEASE版本，无问题。还有可支持大数运算的计算功能-RSA encryption algorithm with the functionality to support 128-2048 bit, RELEASE version, no problem. There can support large numbers of computing operations Platform: |
Size: 5671936 |
Author:张友乔 |
Hits:
Description: 用大数包实现RSA算法的加解密，可以实现很大的数啊-With large numbers packet encryption and decryption of the RSA algorithm, can achieve a great number Platform: |
Size: 2342912 |
Author:特战先锋 |
Hits:
Description: 利用C\C++实现RSA算法的加、解密运算。
具体包括：
1）利用扩展的Euclid计算 a mod n 的乘法逆元；
2）Miller-Rabin素性测试算法对一个给定的大数进行测试；
3）实现的运算，并计算；
4）利用Euler定理手工计算，并与3）计算的结果对比；
5）实现RSA算法。并对 I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS 加解密。说明：为了方便实现，分组可以小一点，比如两个字母一组。
字母及其数字编码 字母及其数字编码
空格 00 N 14
A 01 O 15
B 02 P 16
C 03 Q 17
D 04 R 18
E 05 S 19
F 06 T 20
G 07 U 21
H 08 V 22
I 09 W 23
J 10 X 24
K 11 Y 25
L 12 Z 26
M 13 -Use of C \ C++ implements the RSA algorithm encryption and decryption operations.
These include:
1) using the extended Euclid calculate a mod n multiplicative inverse
2) Miller-Rabin primality testing algorithm for a given test large numbers
3) to achieve the operation, and the calculation
4) the use of Euler Theorem manual calculation, and compared with the results of the calculation 3)
5) implement the RSA algorithm. And I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS encryption and decryption. Description: In order to facilitate the achievement of the packet may be smaller, for example, a group of two letters.
Alphabet letters and their digital encoding and digital encoding
Spaces 00 N 14
A 01 O 15
B 02 P 16
C 03 Q 17
D 04 R 18
E 05 S 19
F 06 T 20
G 07 U 21
H 08 V 22
I 09 W 23
J 10 X 24
K 11 Y 25 Platform: |
Size: 1024 |
Author:刘洋 |
Hits:
Description: A user of RSA creates and then publishes a public key based on two large prime numbers, along with an auxiliary value. The prime numbers must be kept secret. Anyone can use the public key to encrypt a message, but with currently published methods, and if the public key is large enough, only someone with knowledge of the prime numbers can decode the message feasibly.[2] Breaking RSA encryption is known as the RSA problem. Whether it is as difficult as the factoring problem remains an open question. Platform: |
Size: 18432 |
Author:minddz
|
Hits:
Description: the encryption key is public and it is different from the decryption key which is kept secret (private). In RSA, this asymmetry is based on the practical difficulty of the factorization of the product of two large prime numbers, the "factoring problem". The acronym RSA is made of the initial letters of the surnames of Ron .
A user of RSA creates and then publishes a public key based on two large prime numbers, along with an auxiliary value. The prime numbers must be kept secret. Anyone can use the public key to encrypt a message, but with currently published methods, and if the public key is large enough, only someone with knowledge of the prime numbers can decode the message feasibly.[2] Breaking RSA encryption is known as the RSA problem. Whether it is as difficult as the factoring problem remains an open question. Platform: |
Size: 10240 |
Author:minddz
|
Hits:
Description: 1．问题描述
RSA密码系统可具体描述为：取两个大素数p和q，令n=pq,N=(p-1)(q-1),随机选择整数d,满足gcd(d,N)=1,ed=1 modN。
公开密钥：k1=(n,e)
私有密钥：k2=(p,q,d)
加密算法：对于待加密消息m，其对应的密文为c=E(m)=me(modn)
解密算法：D(c)=cd(modn)
2．基本要求
p,q,d,e参数选取合理，程序要求界面友好，自动化程度高。
4． 实现提示
要实现一个真实的RSA密码系统，主要考虑对大整数的处理。P和q是1024位的，n取2048位。(1. problem description
The RSA cryptosystem can be specifically described as: take two large prime numbers P and Q, make n=pq, N= (p-1) (Q-1), select integer D randomly, and satisfy GCD (D, N) =1.
Public key: k1= (n, e)
Private key: k2= (P, Q, d)
Encryption algorithm: for the encrypted message M, its corresponding ciphertext is c=E (m) =me (MODN)
Decryption algorithm: D (c) =cd (MODN)
2. basic requirements
P, Q, D, e parameters are selected reasonably, the program requires friendly interface and high degree of automation.
4. realization hints
To implement a real RSA cryptosystem, the main consideration is to deal with large integers. P and Q are 1024 bits, and N takes 2048.) Platform: |
Size: 1108992 |
Author:Appoint |
Hits:
Search - RSA with large numbers