Location:
Search - Rsa.d
Search list
Description: /* RSA Demo 1.0 版 * 版权所有 (C) 2004 赵春生 * 2004.04.25 * http://timw.yeah.net * http://timw.126.com * 本程序调用Miracl ver 4.82大数运算库，详见其附带手册。 * P,Q,N,D,E使用RSATool2生成。 */ 编译提示： 一：将Project-Settings-Settings For(All Configuration)-C/C++中Category项的 Precompiled Headers设置成：Automatic use of precompiled headers（图1）。 二：将ms32.lib添加到工程中（图2）。 三：MIRACL是C库。 extern \"C\" { #include \"miracl.h\" #include \"mirdef.h\" } #pragma comment( lib, \"ms32.lib\" )-/ * RSA Demo version 1.0 * Copyright (C) 2004 Zhao Chunsheng 2004.04.25 * * * http://timw.126.com http://timw.yeah.net * The procedures called Miracl ver 4. The majority of computing for 82, as detailed in its fringe manual. * P, Q, N, D, E use RSATool2 generation. * / Compiler Tip : 1 : Project-Settings - Settings For (All Configuration) - C / C Category, of OO Headers set : Automatic use of precompiled headers (Figure 1). 2 : ms32.lib added to the project (Figure 2). 3 : MIRACL C library. Extern "C" (# include "miracl.h" # include "mirdef.h") # pragma comment (lib, "ms32.lib")
Platform: |
Size: 172963 |
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: 33550 |
Author: 何泽荣 |
Hits:
Description: /* RSA Demo 1.0 版 * 版权所有 (C) 2004 赵春生 * 2004.04.25 * http://timw.yeah.net * http://timw.126.com * 本程序调用Miracl ver 4.82大数运算库，详见其附带手册。 * P,Q,N,D,E使用RSATool2生成。 */ 编译提示： 一：将Project-Settings-Settings For(All Configuration)-C/C++中Category项的 Precompiled Headers设置成：Automatic use of precompiled headers（图1）。 二：将ms32.lib添加到工程中（图2）。 三：MIRACL是C库。 extern "C" { #include "miracl.h" #include "mirdef.h" } #pragma comment( lib, "ms32.lib" )-/* RSA Demo version 1.0* Copyright (C) 2004 Zhao Chunsheng 2004.04.25*** http://timw.126.com http://timw.yeah.net* The procedures called Miracl ver 4. The majority of computing for 82, as detailed in its fringe manual.* P, Q, N, D, E use RSATool2 generation.*/Compiler Tip : 1 : Project-Settings- Settings For (All Configuration)- C/C Category, of OO Headers set : Automatic use of precompiled headers (Figure 1). 2 : ms32.lib added to the project (Figure 2). 3 : MIRACL C library. Extern "C" (# include "miracl.h"# include "mirdef.h")# pragma comment (lib, "ms32.lib")
Platform: |
Size: 342016 |
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基本原理
对明文分组M和密文分组C，加密与解密过程如下：
C = POW (M , e) mod n
M = POW(C , d) mod n = POW(POW( M ,e), d) mod n=POW( M,e*d)
其中POW是指数函数，mod是求余数函数。
其中收发双方均已知n，发送放已知e，只有接受方已知d，因此公钥加密算法的公钥为
KU={ e , n},私钥为KR={d , n}。该算法要能用做公钥加密，必须满足下列条件：
1. 可以找到e ，d和n，使得对所有M<n ,POW(M ,e*d)=M mod n .
2. 对所有 M<n,计算POW (M , e)和POW(C , d)是比较容易的。
3. 由e 和n确定d是不可行的
-one, the basic tenets of RSA expressly group M and cipher block C, encryption and decryption process is as follows : C = POW (M, e) mod n = M POW (C, d) mod n = POW (POW (M, e), d) mod n = POW (M, e* d), which is an exponential function POW, mod is the pursuit of the remaining functions. Transceivers which both known n, send e Fang known, the only known recipient d, therefore the public key encryption algorithm for public key e KU = (n), private key for KR = (d, n). The algorithm could be used to be a public key encryption, must meet the following conditions : 1. E can be found, and d n, making all the right M
Platform: |
Size: 1965056 |
Author: |
Hits:
Description: rsa算法，这里将给出一个简单加密模块的全部源程序（源代码）
至于RSA的理论网上一大把，它是基于公钥加密体制的一种算法。这个实例主要是用来将某一重要文件绑定到一个IP地址上。把它拷贝下来，存为CODE.C，然后执行
GCC –O CODE CODE.C
然后用./ CODE E [IP ADDRESS] [FILENAME]对文件进行加密。或用
./CODE D [IP ADDRESS] 进行解密整个过程中产生了两个中间文件,至于什么文件,你去试一试就知道啦!
-rsa algorithm, Here is a simple encryption of all source modules (source code) As for the theory RSA online a lot, it is based on public key encryption algorithm a system. This example was mainly used to a certain important document to a bundled IP addresses. Copy it down, depositors to CODE.C. before the implementation of GCC-O CODE CODE.C then./CODE E [IP ADDRESS] [FILENAME] document encryption. Or use./CODE D [IP ADDRESS] declassified whole process created the two intermediary file, As to what documents you try to know!
Platform: |
Size: 1024 |
Author: 潘伟波 |
Hits:
Description: 加密算法
Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives:
- To generate an RSA key
cryptest g
- To encrypt and decrypt a string using RSA
cryptest r
- To calculate MD5, SHS, and RIPEMD-160 message digests:
cryptest m file
- To encrypt and decrypt a string using DES-EDE in CBC mode:
cryptest t
- To encrypt or decrypt a file
cryptest e|d input output
- To share a file into shadows:
cryptest s <pieces> <pieces-needed> file
(make sure file has no extension, if you re running this under DOS)
- To reconstruct a file from shadows:
cryptest j output file1 file2 [....]
- To gzip a file:
cryptest z <compression-level> input output
- To gunzip a file:
cryptest u input output
- To run validation tests:
cryptest v
- To run benchmarks:
cryptest b [time for each benchmark in seconds]
-encryption algorithm Test Driver for Crypto. a Class C Library of spreadsheets Primitives :- To generate an RSA key cryptest g-To encrypt an d decrypt a string using RSA cryptest r-To calcu late MD5, SHS, and RIPEMD algorithms-160 message digests : cryptest m file-To encrypt and decrypt a string using DES-EDE in CBC mode : cryptest t-To encrypt or decrypt a file cryptes t e | d input output- To share a file into shadows : cryptest's
Platform: |
Size: 389120 |
Author: Nikii |
Hits:
Description: 利用MIRACL大数运算库实现的RSA加密的动态链接库，读者在编译时需要重新加载MIRACL库。-MIRACL library to use computing to achieve large numbers of RSA encryption dynamic-link library, readers need to reload when compiling MIRACL library.
Platform: |
Size: 421888 |
Author: gengqin |
Hits:
Description: 1) 找出两个相异的大素数P和Q，令N＝P×Q，M＝（P－1）（Q－1）。
2) 找出与M互素的大数E，用欧氏算法计算出大数D，使D×E≡1 MOD M。
3) 丢弃P和Q，公开E，D和N。E和N即加密密钥，D和N即解密密钥。
-1) to identify two different large prime numbers P and Q, so N = P × Q, M = (P-1) (Q-1). 2) to identify and M large numbers coprime E, Euclidean algorithm used to calculate lump sum for the D, so that D × E ≡ 1 MOD M. 3) disposed of P and Q, the open E, D and N. E and N that encryption keys, D and N that the decryption key.
Platform: |
Size: 6144 |
Author: 阿达悟 |
Hits:
Description: RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, public key and private key. Public key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (public key), n=pq Descryption (D) . D=C° mod(n), o = d (private key- RSA ( Rivest Shamir Adleman )is crypthograph system that used to give a secret information and digital signature . Its security based on Integer Factorization Problem (IFP). RSA uses an asymetric key. RSA was created by Rivest, Shamir, and Adleman in 1977. Every user have a pair of key, public key and private key. Public key (e) . You may choose any number for e with these requirements, 1< e <Æ (n), where Æ (n)= (p-1) (q-1) ( p and q are first-rate), gcd (e,Æ (n))=1 (gcd= greatest common divisor). Private key (d). d=(1/e) mod(Æ (n)) Encyption (C) . C=Mª mod(n), a = e (public key), n=pq Descryption (D) . D=C° mod(n), o = d (private key
Platform: |
Size: 5120 |
Author: nb |
Hits:
Description: 用VHDL求rsa加密系统的密钥D（辗转相除法）-Using VHDL for rsa key encryption system D（Division algorithm）
Platform: |
Size: 2384896 |
Author: 齐娜 |
Hits:
Description: RSA算法实验报告和代码
1.选取两个素数p,q（不可相差悬殊）
2.计算n=pq,f(n)=(p-1)(q-1)
3.选取e,满足1<e<f(n),则gcd(e,f(n))=1
4.计算d，满足de=1 mod f(n)。一般d>=[n的四分之一方],(e,n)为公钥，(p,q,d)为私钥，将明文0，1序列分组，使每组十进制小于n。c=[m的e次方] mod n,m=[c的d次方] mod n。-RSA algorithm and code an experimental report. Choose two primes p, q (non-significant differences between) 2. Calculate n = pq, f (n) = (p-1) (q-1) 3. Select the e, to satisfy a <e<f(n),则gcd(e,f(n))=1
4.计算d，满足de=1 mod f(n)。一般d> = [n the fourth side], (e, n) for the public key, (p, q, d) for the private key will be expressly 0,1 sequence packet, so that each of the decimal is less than n. c = [m of the e-th power] mod n, m = [c of the d-th power] mod n.
Platform: |
Size: 81920 |
Author: jhp627 |
Hits:
Description: encrypt-decrypt with RSA algorithm. implementation encryption algorithm with RSA method. using public key and private key. first, generate public and private key with generate.php. you will get e,d, and n. for encrypt, use the e and n for private and public key. and using d and n as private and public key to decrypt your text
Platform: |
Size: 8192 |
Author: wahyu |
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 原理：
选取两个不同的大素数p、q，并计算N=p*q
选取小素数d，并计算e，使d*e (p-1)(q-1)=1 -RSA works: select two different large prime numbers p, q, and compute N = p* q Select the small prime d, and calculate the e, so d* e (p-1) (q-1) = 1
Platform: |
Size: 1024 |
Author: 董然 |
Hits:
Description: downlad aja gan gratis kok :D
Platform: |
Size: 74752 |
Author: eswete |
Hits:
Description: RSA 金鑰
用以下的方式來產生一個公開金鑰和一個私密金鑰：
1. 隨機選擇兩個的質數p和q，p不等於q，計算N=p*q。
2. 選擇一個整數e，e與(p-1)*(q-1)互質，並且e小於(p-1)*(q-1) 。
3. 求一個值 d，d<(p-1)*(q-1)，且(d*e)除以((p-1)*(q-1)) 的結果，其餘數為 1。
4. 將p和q的記錄銷毀。-RSA keys in the following way to generate a public key and a private key: 1. Randomly selected two quality numbers p and q, p does not equal q calculate N = p* q. 2 Select an integer e, e (p-1)* (q-1) are relatively prime, and e is less than (p-1)* (q-1). 3. Find a value d, d < (p-1)* (q-1), and (d* e) divided by ((p-1)* (q-1)) of the results, the remaining number of 1. 4 records destruction of p and q.
Platform: |
Size: 369664 |
Author: vicky |
Hits:
Description: RSA 数字签名的基本思想
RSA数字签名的安全性依赖于大数分解的困难性。
1、参数与密钥生成
首先选取两个大素数p和q，计算
n=pq
其欧拉函数值
（p-1）*（q-1）
然后选取随机整数e，满足
gcd（e，（p-1）*（q-1））)=1
并计算
d=e^-1 mod（（p-1）*（q-1））
则公钥为（e，n），私钥为d；p，q是秘密参数，需要保密。如不需要
保存，计算出e，d后可销毁。
2、签名算法
设待签名消息为m，对消息m的签名为
S=Sigk（m）=m^d mod n
3、签名的验证算法
当签名接受者收到签名（s，m）时，检验m=s^e mod n是否成立，以确定签名是否有效。-The basic idea of the RSA digital signatures RSA digital signature security depends on the difficulty of factoring large integers. 1, the parameters and the key generated by first selecting two large primes p and q, the calculated N = PQ the Euler function values (p-1)* (q-1) and then select a random integer e, satisfy the GCD (e, (p-1)* (q-1))) = 1 and calculate d = e ^-1 Mod ((p-1)* (q-1)) the public key (e, N), the private key D p, q is the secret parameters, the need for confidentiality. If do not want to save, calculate e, d can be destroyed. 2, the signature algorithm provided to be signed message m, the signature of the message m S = Sigk (m) = m ^ d mod n 3, when the signature verification of the signature algorithm when receiving the signature (s, m), testing m = s ^ e mod n is set up to determine whether the signature is valid.
Platform: |
Size: 1024 |
Author: zzq |
Hits:
Description: RSA D-H加密与解密算法，C语言实现-RSA DH encryption and decryption algorithm, C language
Platform: |
Size: 5120 |
Author: 刘思琪 |
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: