Location:
Search - rsa-to
Search list
Description: 用RSA加密IP，下载后拷下来运行后就能用，可以自己事实！-use RSA to add password to IP,please download and copy and run it,you can try it!
Platform: |
Size: 4886 |
Author: 邓伟 |
Hits:
Description: RSA的加密算法的应用DEMO 也是用来加密的。-RSA encryption algorithm application DEMO also is uses for to
encrypt.
Platform: |
Size: 249856 |
Author: 江智勇 |
Hits:
Description: rsa加密算法的实现，很详细-rsa encryption algorithm to achieve great detail
Platform: |
Size: 4096 |
Author: 刘淘 |
Hits:
Description: C++编写的实现RSA加密算法的程序-prepared by the RSA encryption algorithm to achieve the procedure
Platform: |
Size: 2048 |
Author: wang |
Hits:
Description: RSA加密算法在VB中的实现.可以更好的了解RSA加密算法.-RSA encryption algorithm in VB realized. To better understand the RSA encryption algorithm.
Platform: |
Size: 2048 |
Author: 曹 |
Hits:
Description: 用RSA加密IP，下载后拷下来运行后就能用，可以自己事实！-use RSA to add password to IP,please download and copy and run it,you can try it!
Platform: |
Size: 4096 |
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加密算法，界面操作，可以很方便的对文件的内容进行加密，而且为了能加密更长的内容，算法中采用了分段加密的手段。其算法步骤如下：1. 读取公钥e和n，作加密之用。 2. 从DecText中读取一大段明文，转化成明文字节数组Byte[]。 3. 再把Byte[]分成若干小段明文字节数组sectByte[]。 4. 使用e和n对所有的sectByte[]进行加密，并合成一大段密文,添加到EncText。 5. 读取下一大段明文，若明文为空，完成加密；否则转2-RSA encryption algorithm, interface operation, it is convenient to the contents of the documents for encryption, but in order to longer content encryption algorithm used in the sub-encryption tools. The algorithm steps are as follows : 1. Read public key e and n, for encryption purposes. 2. DecText from reading a big specifically, into an express byte array Byte []. 3. Byte [] then divided into pieces expressly sectByte byte [] array. 4. The use of e and n of all sectByte [] encryption and synthesis of a large dense text to be added EncText. 5. The next major reading of the express, if expressly for the space, complete encryption; Otherwise turn 2
Platform: |
Size: 75776 |
Author: 何泽荣 |
Hits:
Description: RSA加长分段解密算法，界面操作。算法步骤如下：1. 读取私钥d和n，作解密之用。 2. 从EncText中读取一大段密文，再把该大段密文分成若干小段密文。 3. 使用d和n把所有小段密文进行解密成对应的小段密文sectByte[]，再合成一大段明文字节数组Byte[]，并转化成大段明文添加到DecText。 4. 读取下一大段密文，若密文为空，完成解密；否则转2-RSA decryption algorithm lengthened section, the interface operation. Algorithm steps are as follows : 1. Read private key d and n, used for decryption. 2. EncText from reading a big secret of the text, and then the big secret of the text is divided into a number of subparagraphs ciphertext. 3. The use of d and n all subparagraph declassified secret text into corresponding sections ciphertext sectByte [], then synthesis of a large expressly byte array Byte [], and conversion of the university to express DecText added. 4. The next major reading of dense text, if ciphertext empty, completed decryption; Otherwise turn 2
Platform: |
Size: 33792 |
Author: 何泽荣 |
Hits:
Description: 密码学中极重要的RSA算法的C编程实现。希望对一些喜欢C的朋友有用-cryptography very important RSA algorithm in C programming. Some like to hope that the friends useful C
Platform: |
Size: 4096 |
Author: 陈生 |
Hits:
Description: 适用于systemC环境的rsa算法程序的源代码-applicable to the environment rsa algorithm source code
Platform: |
Size: 4096 |
Author: 张燕 |
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的文章，希望对大家有所帮助！-This is a very good article on the RSA, and I hope to help you!
Platform: |
Size: 97280 |
Author: |
Hits:
Description: RSA的实现，可以根据文章来实现RSA算法-RSA realized, according to the article to achieve RSA algorithm
Platform: |
Size: 294912 |
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 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: 使用NTL大整数库实现RSA公钥密码算法,可用于对文本文件进行加密和解密.
平台Windows98以上,VC++6.0, 内部文件路径均为相对路径,不存在无法编译的Bub.-use of the NTL large integer achieve RSA public key cryptography algorithm, can be used to text file encryption and decryption. Windows98 platform above, VC 6.0, trails are internal documents relative path, we can not compile Bub.
Platform: |
Size: 1916928 |
Author: 李刚 |
Hits:
Description: 1、使用MIRCL大整数库开发的，支持最高4096位。
2、加密时原文的长度一旦超过密钥长度，就会解密错误。
这里不实现任意长度字串的加密原因有二：
1）。便于观察及测试用
2）。偷懒
3、如果在使用时发现原文和密码不一样的时候，就说明出现了第二点的情况
4、如果在生成素数及密钥的时候，如果原文已经存在，则会自动加密及解密；
但当密钥长度大于1024的时候，则想要加密及解密都需要点击按钮。
现在想到的就这几点了，以后想到了再补。-1, the use of the large integer MIRCL development, support the highest 4096. 2, encryption at the original length exceeding key length, will be declassified wrong. Here is not to achieve arbitrary length of the encrypted string two reasons : 1). Facilitate observation and tests using 2). 3 lazy, if found in the use of the original and a password is not the same time, it reflects the emergence of the second of four points. If the production-number and keys, if the original has been in existence, will be automatically encrypted and decrypted. But key length of more than 1024 when it wants to encryption and decryption require Click the button. Now think of these suggestions, and stop thinking of the future.
Platform: |
Size: 39936 |
Author: 李大叶 |
Hits:
Description: rsa 加密算法的实现使用vc实现可以调试要的就下-rsa encryption algorithm implementation can be achieved using vc debugging to the next
Platform: |
Size: 104448 |
Author: 刘六流 |
Hits:
Description: 利用RSA对大数进行加密和解密，同时对大数进行计算，如大数相加、相减、及相乘(Using RSA to encrypt and decrypt large numbers, and calculate the number of large numbers, such as adding, subtracting, and multiplying large numbers.)
Platform: |
Size: 367616 |
Author: lala_
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
48
»