搜索资源列表
RsaTool.自己写的RSA算法工具
- 自己写的RSA算法工具。支持RSA密钥产生（包括CRT）、RSA运算、强素数生成、大数运算等功能。用了的都说好。,Writing their own tools of the RSA algorithm. Support for RSA Key Generation [including CRT], RSA computation, strong prime number generation, large numbers computing functions. Use of that goo
5sourcecodes
- o-1 knapsack parallel implementaion in c, Begining socket pro in c.zip, rsa using crt in c, des in java, fuzzy string matching in c-o-1 knapsack parallel implementaion in c, Begining socket pro in c.zip, rsa using crt in c, des in java,
CRTRSA
- The variant of rsa CRT RSA which optimizes decryption time of original RSA
RSA
- original rsa as given by rivest,shamir , and adleman. Its problems in decryption are optimized using rsa variants like crt rsa, multiprime rsa, rebalanced rsa and rprime rsa. U should give the no. of bits to be 1024 and check it on netbeans 6.5 or la
CRYPTBAS.ZIP
- CRT Implementation in RSA and other cryptography algorithms.
RSAMultiPrimePrivateCrtKeySpec
- The key specification of a RSA multi-prime private key with the Chinese Remainder Theorem (CRT) information values used.
RSAPrivateCrtKeySpecTest
- Tests for RSA Private Crt Key Spec class fields and methods Source Code for Linux.
RSAPrivateCrtKeySpec
- The key specification of a RSA private key using Chinese Remainder Theorem (CRT) values.
RSAPrivateCrtKeyTest
- RSA Private Crt Key Test for Linux.
RSAMultiPrimePrivateCrtKeySpec
- The key specification of a RSA multi-prime private key with the Chinese Remainder Theorem (CRT) information values used.
Chinese_Remainder_Theorem
- 中国余数定理及Matlab代码实现,总共包括三个函数，eulerphi(p)函数用于计算the Euler s Totient Function of p，invmodn(x,p)函数计算the inverse modulo of x under p ，CRT(r,p)函数实现结果。-Descr iption eulerphi(p) computes the Euler s Totient Function of p where p is a positive integer and