搜索资源列表
RsakitT
- RSA算法,大素数生成,加密解密-RSA algorithm, generating large prime numbers, encryption and decryption
大素数生成
- 大素数生成算法的实现,很不错的一段程序-large prime number generation algorithm to achieve a very good procedures
BigInterger
- C# 实现的大整数类,生成一个伪大素数,大整数之间的运算以及转化成不同编码的输出
大素数生成
- 这是一个利用Java编写的超大素数生成程序!
大素数生成
- 大素数生成算法的实现,很不错的一段程序-large prime number generation algorithm to achieve a very good procedures
RSAVC
- RSA算法的VC实现,其中包括超长整数类,素数检验算法,大素数生成器和一般的数论算法,例如中国剩余定理解密RSA密文-RSA algorithm VC, including long integer type, in a few test algorithm, large prime number generator and the general theory of numbers algorithm, for example, Ch
blackeye_elgamalkeygenerator10beta3
- 大素数生成器,根据用户的设置自动生成一个符合要求的大素数,计算速度较快。-large prime number generator, according to the automatic generation to meet the requirements of a large prime numbers, the fast calculation.
BigIntC
- 一个生成大素数的文件,效率很高。可以在C++或VC++工程里直接引用-generate a large number of paper-and high efficiency. In C or VC works directly invoked Lane
RsakitT
- RSA算法,大素数生成,加密解密-RSA algorithm, generating large prime numbers, encryption and decryption
bigint_computation_tool
- RSA的应用需要用到很多大素数。如何生成大素数,将成为是否能实现RSA的关键技术。-Application of RSA requires a lot of large prime numbers. How to generate large prime numbers, will become the target of RSA key technologies.
RSAtool
- 这学期刚学密码学,RSA算法相对简单,于是写了这个小软件.开发环境:VC++6.0。 RSA的安全性依赖于大数分解。公钥和私钥都是两个大素数。据猜测,从一个密钥和密文推断出明文的难度等同于分解两个大素数的积。 数据加密算法RSA的关键在于大素数的生成,本软件采取数组形式解决大素数的存储和运算问题,可生成超过1024位的十进制数的大素数,以应用于数据加密。 RSA的缺点主要有:产生密钥很麻烦,受到素数产生技术的限制,因
1024RSA
- 支持大整数的RSA算法,还可以自动生成随机大素数-Support for large integer RSA algorithm, can also automatically generate random large prime numbers
bigint
- 大素数生成。用于加密解密。具体内容:用C或C++语言编写的一个生成二进制为1024位的大素数的程序。-Generate large prime numbers. For encryption and decryption. Specific elements: using C or C++ Language to prepare a generation of binary for the 1024 program of large p
PrimeNumber
- 大素数生成器,很好用的程序,可以快速的生成,并可以用TXT文档表示出来~-Large prime number generator, a good procedure to use, can be quickly generated, and TXT files that can be used by the ~
RSA56778
- 用VC实现的rsa加密解密算法,本人经过测试,可以 直接使用 生成任意多位和任意多个的大素数,十六进制表示 -VC achieved using rsa encryption and decryption algorithm, I tested and can be directly used to generate any number and any number of large prime numbers, hexadeci
rsa
- 1、编写程序构造一RSA密钥; 2、编写程序实现快速指数算法; 3、编写程序生成大素数; 4、实现RSA密码体制 -1, the preparation of procedures for constructing a RSA key 2, the preparation of procedures for fast index algorithm 3, the preparation process to gene
prime
- 产生大素数。以时间作为随机数生成的种子,随机生成大素数。-Generate large prime numbers. With time as the random number generator seeds, randomly generated large prime numbers.
RSA_FINAL
- RSA加密 大素数生成 运算符重载 -RSA encryption large prime number generator operator overloading
BigPrimerGen
- 大数的运算的类和大素数生成的算法,用C++实现。-Big number computing and big primer generating algorithm.
素数判断
- 生成大素数,利用了时间随机种子。并且用Miller_Rabin测试法,判定素数(Generating large prime numbers takes advantage of temporal random seeds. And the Miller_Rabin test is used to determine the prime number)