Location:
Search - RSA.P
Search list
Description: 基于java的完整的RSA算法实现 /** * <p>Titre : RSA </p> * <p>Description : Encodage de donn閑s selon le protocole RSA </p> * <p>Copyright : Copyright (c) 2004</p> * @author Fran鏾is Bradette * @version 1.1 * version originale de Robert Sedgewick and Kevin Wayne.Copyright ? 2004 * pris sur le site http://www.cs.princeton.edu/introcs/104crypto/RSA.java.html * Modifier par Fran鏾is Bradette */-on the integrity of the RSA algorithm / ** * lt; Pgt; Part : RSA lt; / Pgt; * Lt; Pgt; Description : Encodage de donn idle s selon le protocole RSA lt; / Pgt; * Lt; Pgt; Copyright : Copyright (c) 2004lt; / pgt; * @ author Fran is continuing Bradette * * @ version 1.1 version originale de Robert Sedgewick and Kevin Wayne.Copyright 2004 * pris sur le site http://www.cs.princeton. * Modifier edu/introcs/104crypto/RSA.java.html par Fran is continuing Bradette * /
Platform: |
Size: 15588 |
Author: 某男 |
Hits:
Description: RSA公钥加密算法基于大整数因式分解困难这样的事实。
选择两个素数，p，q。（一般p,q选择很大的数）
然后计算 z=p*q f=(p-1)(q-1) 选择一个n，使gcd(n,f)=1（gcd代表greatest common divider,一般n也选择一个素数）， n和z就作为公钥。
选择一个s,0<s<f,满足n*s ％ f=1，s就作为私钥。-RSA public key encryption algorithm based on the integer factorization great difficulties to the fact. Choice of two prime numbers, p, q. (General p, q very few options) and then calculate the z = p * q = f (p-1) (q-1) Choose a n, so gcd (n, f) = a (gcd representatives greatest common divider. n general also choose a prime number), n and z on as a public key. One's choice, 0
Platform: |
Size: 81637 |
Author: fasf |
Hits:
Description: Digital Signature Algorithm (DSA)是Schnorr和ElGamal签名算法的变种，被美国NIST作为DSS(DigitalSignature Standard)。算法中应用了下述参数：
p：L bits长的素数。L是64的倍数，范围是512到1024；
q：p - 1的160bits的素因子；
g：g = h^((p-1)/q) mod p，h满足h < p - 1, h^((p-1)/q) mod p > 1；
x：x < q，x为私钥 ；
y：y = g^x mod p ，( p, q, g, y )为公钥；
H( x )：One-Way Hash函数。DSS中选用SHA( Secure Hash Algorithm )。
p, q, g可由一组用户共享，但在实际应用中，使用公共模数可能会带来一定的威胁。签名及验证协议如下：
1. P产生随机数k，k < q；
2. P计算 r = ( g^k mod p ) mod q
s = ( k^(-1) (H(m) + xr)) mod q
签名结果是( m, r, s )。
3. 验证时计算 w = s^(-1)mod q
u1 = ( H( m ) * w ) mod q
u2 = ( r * w ) mod q
v = (( g^u1 * y^u2 ) mod p ) mod q
若v = r，则认为签名有效。
DSA是基于整数有限域离散对数难题的，其安全性与RSA相比差不多。DSA的一个重要特点是两个素数公开，这样，当使用别人的p和q时，即使不知道私钥，你也能确认它们是否是随机产生的，还是作了手脚。RSA算法却作不到。
Platform: |
Size: 136954 |
Author: wildkaede |
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: 342787 |
Author: 李湘 |
Hits:
Description: Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be because of the difficulty to prove that any given arbitrary number is prime. This is call the primality test. Most of the test for primality are probalistic rather than deterministic,because probalistic test are much more quicker than the deterministic ones. When testing the primality of a given number,one of the theorem that is very largely used is Fermat s little theorem: if "p" is a prime number that is not a factor of a given integer "a",then pow(a, p - 1) = 1 (mod p) or pow(a, p - 1) p = 1 One of the main application of prime numbers nowadays is chryptography,the RSA algorithm for encrypting and decrypting messages is based on prime numbers.- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be because of the difficulty to prove that any given arbitrary number is prime. This is call the primality test. Most of the test for primality are probalistic rather than deterministic,because probalistic test are much more quicker than the deterministic ones. When testing the primality of a given number,one of the theorem that is very largely used is Fermat s little theorem: if "p" is a prime number that is not a factor of a given integer "a",then pow(a, p- 1) = 1 (mod p) or pow(a, p- 1) p = 1 One of the main application of prime numbers nowadays is chryptography,the RSA algorithm for encrypting and decrypting messages is based on prime numbers.
Platform: |
Size: 11264 |
Author: kbing |
Hits:
Description: 带界面的RSA算法，软件包中含有可执行程序，功能有自动生成随机素数P、Q，公钥，密钥，对数字进行加密解密。-Interface with the RSA algorithm, packages containing executable programs, automatic generation of random functions of prime numbers P, Q, a public key, keys for encryption and decryption of digital.
Platform: |
Size: 23552 |
Author: xuxu |
Hits:
Description: DES算法
DSA算法
ElGamal算法
Kohonen的SOFM(自组织特征映射)
LAM（线性联想记忆）算法
LZW 压缩算法
MD5算法
PGP的安全性(一)
PKCS #7
RSA算法
SSL是怎样工作的？
Ternary Search Trees
产生组合的非递归算法
大整数的乘法
对LZW算法的改进及其在图象无损压缩中的应用
复数快速傅立叶变换算法
加密算法与密钥管理
经典加密算法在VB中的实现（1）- Rsa
经典加密算法在VB中的实现（2）- MD5
经典加密算法在VB中的实现（3）- RC4
经典加密算法在VB中的实现（4）- DES
经典字符串HASH函数测试
离散的Hopfield算法
秘密天窗加密方法C++源程序
浅谈图像压缩算法
求全排列的非递归算法
如何实现DES算法
神经元网络 LVQ(学习矢量量化)算法
神经元网络的经典B-P算法1
神经元网络的经典B-P算法2
神经元网络的经典B-P算法3
实数快速fft变换算法
实数快速fft算法二
使用ASP加密算法加密你的数据
手写体数据变换成像素位图的算法
-DES algorithm
DSA algorithm
ElGamal algorithm
Kohonen s SOFM (Self Organizing Map)
LAM (Linear Associative Memory) algorithm
LZW compression algorithm
MD5 Algorithm
PGP Security (a)
PKCS# 7
RSA algorithm
SSL How does it work?
Ternary Search Trees
Produce combinations of non-recursive algorithm
Large integer multiplication
On the LZW algorithm and its application in image lossless compression
Complex fast Fourier transform algorithm
Encryption and Key Management
Classical encryption algorithm implementation in VB in (1)- Rsa
Classical encryption algorithm implementation in VB in (2)- MD5
Classical encryption algorithm implementation in VB in (3)- RC4
Classical encryption algorithm implementation in VB in (4)- DES
Classical string HASH function test
Discrete Hopfield algorithm
Secret Window encryption C++ source code
Of image compression algorithm
Perfectionist ordered non-recursive algorithm
How to implement DES algorithm
Neural network LVQ (learning vector qu
Platform: |
Size: 209920 |
Author: 蟲子 |
Hits:
Description: RSA加密算法的VC++代码实现。
由选定的P,Q以及E来计算私钥D-RSA encryption algorithm VC++ code. Selected by the P, Q and E to calculate the private key D
Platform: |
Size: 12288 |
Author: zsycloud |
Hits:
Description: 带界面的RSA算法，软件包中含有可执行程序，功能有自动生成随机素数P、Q，公钥，密钥，对数字进行加密解密。-Interface with the RSA algorithm, packages containing executable programs, automatic generation of random functions of prime numbers P, Q, a public key, keys for encryption -of random functions of prime numbers P, Q, a public key, keys for encryption and decryption of digital.
Platform: |
Size: 2048 |
Author: 王波 |
Hits:
Description: 简单的针对rsa的解密密钥攻击的程序，即已知加密时使用的n、k1、k2和m，以概率算法求出加密时使用的大素数p和q-Simple attack against rsa decryption key procedures, which are known to use encryption when n, k1, k2, and m, in order to find the encryption algorithm used when the probability of large prime numbers p and q
Platform: |
Size: 354304 |
Author: 彭湘 |
Hits:
Description: C语言，大素数域上的椭圆曲线加密解密算法
[ibe_dec.rar] - 椭圆曲线加密算法，解密一步的源代码，有详细注释
[DES.rar] - 各种加密算法的源代码，包括DES，RSA，DAS，RC4,RC5等
[mulf2m.rar] - 椭圆曲线加密算法中的乘法器的生成，主要功能是实现在素域上的多项式模P(大素数）乘的运算。
[AesCode.rar] - AES c++实现 有图形界面对话框 简单易用
[2745ecc.rar] - 椭圆曲线加密算法
[JXARM9-2410-1.rar] - 创维特arm9开发板使用详解，包含arm9交叉编译环境的搭建，bootloader的烧写，内核的下载，绝对的一本好资料！
[ECDSA.rar] - 椭圆曲线数字签名算法的VC实现，包括大整数类的实现和ecc算法的实现。
[ApplicationofCryptography.rar] - 一本关于密码学应用的学习参考书，内有对称密钥加密、数字签名、认证、公钥加密、哈希算法等内容，内容全面。
[ecc加密算法入门介绍 .rar] - ecc加密算法入门介绍
文件列表(日期：2007050206)(点击判断是否您需要的文件，如果-
C language, elliptic curve encryption and decryption algorithm
[ ibe_dec.rar]- elliptic curve encryption algorithm, encryption step in the source code, there are detailed notes
[ DES.rar]- encryption algorithm source code, including DES, RSA, DAS, RC4, RC5 etc.
[ mulf2m.rar]- elliptic curve encryption algorithm to generate the multiplier, the main function is to achieve the prime field of polynomial modulo P ( large prime numbers) by the operator.
[AesCode.rar]- AES c++ to achieve a simple and easy to use graphical interface dialog box
[ 2745ecc.rar]- elliptic curve encryption algorithm
[ JXARM9-2410-1.rar]- special Skyworth ARM9 development board detailed, including the ARM9 cross compiler environment to build, bootloader programmer, kernel download, is a good information!
[ ECDSA.rar]- elliptic curve digital signature algorithm VC implementation, including the realization of an integer type and ECC algorithm.
[ ApplicationofCryptography.rar]- on the applicat
Platform: |
Size: 4096 |
Author: clint |
Hits:
Description: c rsa key dec ma hoa giai ma
Platform: |
Size: 43008 |
Author: huy |
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算法实现对字符串的加密及解密。其中质数p q以及私钥都可以自行设定。-String encryption and decryption using the RSA algorithm. Primes pq, and the private key can set their own.
Platform: |
Size: 753664 |
Author: WalyLing |
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加密，指定p,q,e，程序找到密钥，用户输入数字形式的明文，然后加密生成密文，打开解密程序，输入密文，输出明文-RSA encryption
Platform: |
Size: 10240 |
Author: 郑振龙 |
Hits:
Description: RSA算法非常简单，概述如下： 找两素数p和q 取n=p*q 取t=(p-1)*(q-1) 取任何一个数e,要求满足e<t并且e与t互素（就是最大公因数为1） 取d*e t==1 这样最终得到三个数： n d e 设消息为数M (M <n) 设c=(M**d) n就得到了加密后的消息c 设m=(c**e) n则 m == M，从而完成对c的实现-RSA algorithm is very simple, are summarized as follows: find two primes p and q take n = p* q taking t = (p-1)* (q-1) take on any of a number e, required to meet e <t并且e与t互素（就是最大公因数为1） 取d*e t==1 这样最终得到三个数： n d e 设消息为数M (M <n) 设c=(M**d) n就得到了加密后的消息c 设m=(c**e) n则 m == M，从而完成对c的实现
Platform: |
Size: 2048 |
Author: wang |
Hits:
Description: 特殊情况下（|p-q|<2*N开4次方）破解RSA，因式分解大数-RSA crack under special circumstances, factoring large numbers
Platform: |
Size: 26624 |
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: Source code to recover P and Q encryption parameters for rsa
Platform: |
Size: 4096 |
Author: concrete |
Hits: