Location:
Search - rsa c
Search list
Description: RSA(C++
Platform: |
Size: 26464 |
Author: ami2011 |
Hits:
Description: RSA算法C++实现，在VC6.0下编译通过
Platform: |
Size: 134508 |
Author: 458686683@qq.com |
Hits:
Description: 一个关于密码算法RSA的实现程序- About crypto-algorithm RSA realization procedure
Platform: |
Size: 1975296 |
Author: 李素芝 |
Hits:
Description: rsa加密算法的实现，很详细-rsa encryption algorithm to achieve great detail
Platform: |
Size: 4096 |
Author: 刘淘 |
Hits:
Description: RSA算法的C语言源代码-RSA algorithm in C language source code
Platform: |
Size: 36864 |
Author: 曾式 |
Hits:
Description: RSA C++代码-RSA C code
Platform: |
Size: 134144 |
Author: 施向东 |
Hits:
Description: C++编写的实现RSA加密算法的程序-prepared by the RSA encryption algorithm to achieve the procedure
Platform: |
Size: 2048 |
Author: wang |
Hits:
Description: rsa加密算法实例-rsa encryption algorithm examples
Platform: |
Size: 16384 |
Author: 张飞 |
Hits:
Description: 用C#中RSACryptoServiceProvider类型，实现RSA算法的加密，和解密，用控制台实现-C# RSACryptoServiceProvider type, achieving RSA encryption, and decryption using Console
Platform: |
Size: 1024 |
Author: 张立 |
Hits:
Description: RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a, 将其看成是一个大整数, 假设 a < n.... 如果 a >= n 的话, 就将 a 表成 s 进位 (s <= n, 通常取 s = 2^t), 则每一位数均小于 n, 然後分段编码...... 接下来, 计算 b == a^m mod n, (0 <= b < n), b 就是编码后的资料。解码的过程是, 计算 c == b^r mod pq (0 <= c < pq), 于是, 解码完毕-RSA algorithm : First, find a few 3, p, q, r, p, q is the two different prime number, with the r (p-1) (q-1) coprime several ... p, q, r it person_key number is three, and then find m, making r ^ m == a mod (p-1) (q-1 m ...................................... this must exist, because r (p-1) (q- 1) coprime, with the division algorithm can be a ..... Next, calculate n = pq ....... m, n is the number two public_key, coding process is that if a data and to treat it as a big Integer assuming a <n. ... If a> = n, a table will be rounding into s (s <= n, usually from 2 ^ s = t), each n is less than the median, and then sub-coding ..... . Next, calculate a == b ^ m mod n, (0 <= b <n), b is encoded information. Decoding is the process of calculating c == b ^ r mod pq (0 <= c &
Platform: |
Size: 1024 |
Author: 胡康康 |
Hits:
Description: 这是一个RSA的简单实现算法,用的是C++语言实现的.-This is a simple realization of the RSA algorithm is used in the C language.
Platform: |
Size: 53248 |
Author: 杜立涛 |
Hits:
Description: 信息安全中的RSA算法，界面简单明了，功能齐全-information security of the RSA algorithm, simple interface, the full range of functions
Platform: |
Size: 1914880 |
Author: sun |
Hits:
Description: 某位朋友"用C#做的加密解密的东西，做在一起，有点乱，只是作为交流学习"-certain friends "with C# to do encryption and decryption of things to do together, a little bit chaotic, but as the exchange of learning"
Platform: |
Size: 229376 |
Author: 宏伟 |
Hits:
Description: RSA算法实现(经典)
1.
首先要把文件夹中的rsa.c文件拷贝到运行工具（如TURBOC2）下文件夹名为INCLUDE的文件夹中。
（在本机上已经做过，所以不需要做）
2.
RSA的加密对象为C盘下文件名为CODE.txt的前8位（如果没有一定要在C盘下建立一个文件名为CODE.txt的文件，
把要加密的数据写到文件里），加密后在C盘下生成一个文件名为RSACIPER.txt文件。
（在本机上已经做过，所以不需要做以上二步）
但在其它机子上一定得完成以上二步，方可运行。
3.
RSA的解密对象为C盘下文件名RSACIPER.txt文件，解密后在C盘下生成为End＿CODE.txt文件。
运行步骤 （计算PK SK R）－－＞（A_RSA加密）－－＞（A_RSA解密）。-RSA algorithm (classic) 1. First, it is necessary folder of documents copied to rsa.c running tools (eg TURBOC2) folder called INCLUDE of folders. (In this plane has been done, so there was no need to do) 2. RSA encryption target for the C-CODE.txt document, entitled under the former eight (if not necessarily in the C- to establish a document titled CODE.txt documents, the encrypted data to document wrote), encryption in the next generation C-1 document, entitled RSACIPER.txt document. (In this plane has been done, so there was no need to do the above two-step) but on the other machine had to complete the above two steps before running. 3. RSA decryption target for the C-under File Name RSACIPER.txt documents, declassified after the C-Descent into End_CODE.txt document. Run steps (PK calc
Platform: |
Size: 8192 |
Author: 杨 |
Hits:
Description: 1.
首先要把文件夹中的rsa.c文件拷贝到运行工具（如TURBOC2）下文件夹名为INCLUDE的文件夹中。
（在本机上已经做过，所以不需要做）
2.
RSA的加密对象为C盘下文件名为CODE.txt的前8位（如果没有一定要在C盘下建立一个文件名为CODE.txt的文件，
把要加密的数据写到文件里），加密后在C盘下生成一个文件名为RSACIPER.txt文件。
（在本机上已经做过，所以不需要做以上二步）
但在其它机子上一定得完成以上二步，方可运行。
3.
RSA的解密对象为C盘下文件名RSACIPER.txt文件，解密后在C盘下生成为End＿CODE.txt文件。
运行步骤 （计算PK SK R）－－＞（A_RSA加密）－－＞（A_RSA解密）。
-1. First, it is necessary folder of documents copied to rsa.c running tools (eg TURBOC2) folder called INCLUDE of folders. (In this plane has been done, so there was no need to do) 2. RSA encryption target for the C-CODE.txt document, entitled under the former eight (if not necessarily in the C- to establish a document titled CODE.txt documents, the encrypted data to document wrote), encryption in the next generation C-1 document, entitled RSACIPER.txt document. (In this plane has been done, so there was no need to do the above two-step) but on the other machine had to complete the above two steps before running. 3. RSA decryption target for the C-under File Name RSACIPER.txt documents, declassified after the C-Descent into End_CODE.txt document. Run steps (PK calculated SK R )-->( A_R
Platform: |
Size: 3072 |
Author: 杨 |
Hits:
Description: rsa c的实现
用C语言开发高性能RSA加密算法-the realization of C language development of high-performance RSA encryption algorithm
Platform: |
Size: 15360 |
Author: w |
Hits:
Description: RSA MD5加解密算法,用c++实现,核心部分是c的代码,完全跨平台-RSA encryption and decryption algorithms, used to achieve c, c is the core part of the code, completely cross-platform
Platform: |
Size: 103424 |
Author: 张晓博 |
Hits:
Description:
RSA算法的C++源程序,喜欢的下，-RSA algorithm in C source files, like, thank you
Platform: |
Size: 5120 |
Author: lxm |
Hits:
Description: C++ 源代码实现 非对称算法（RSA）-C++ Source code to achieve asymmetric algorithms (RSA)
Platform: |
Size: 26624 |
Author: crazyme |
Hits:
Description: RSA c 源码 可用于密钥加密 数字签名-RSA C source code
Platform: |
Size: 9216 |
Author: yuyulai |
Hits:
« 12
3
4
5
6
7
8
9
10
...
36
»