搜索资源列表
kzojldsf
- 扩展欧几里得算法 和大数模运算算法 自己写的注释，绝对好用。-expansion Euclid algorithm and computation algorithm for Modular himself wrote the notes, definitely handy.
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
HMAC-SHA1
- 比较好的代码，可以进行ＨＭＡＣ运算，大家看看啊-Relatively good code, can be HMAC computation, let us look at ah
20060424
- 与传统的PKI相比，IBC在诸如密钥生成、分发、管理等方面有着明显的优势。使用基于身份的密码系统，可以有效的减少计算量和存储量。-PKI, compared with the traditional, IBC such as key generation, distribution, and management has a clear advantage. The use of identity-based password system, can effectively reduce the
cuda_wordpassword_crack
- 暴力破解word2003所需的计算量极其大，耗费时间长！本作品利用CUDA的高速并行能力进行破解，以时间换空间及成本， 适合普通用户使用。-Word2003 brute force computation required is extremely large, time-consuming long! This works using CUDA' s ability to break high-speed parallel to the time for space and cost,
Efficient_Tweakable_Enciphering_Schemes
- We present several constructions of tweakable enciphering schemes which use a single encryption layer between two layers of universal hash function computation. The earliest known construction of this type is due to Naor and Reingold, where the e
RSA-Final
- 基本RSA加密/解密算法的C++实现，带有大整数运算功能-Fundamental RSA En/Decoding algorithm with Big integer computation function
RSA_TST
- 实现RSA1024加密采用大数运算，测试通过-RSA1024 encryption computation of large numbers, and tested
06168353
- The Fast Fourier Transform (FFT) is one of the rudimentary operations in field of digital signal and image processing. Some of the very vital applications of the fast fourier transform include Signal analysis, Sound filtering, Data compressio
RSA
- RSA加解密算法的简易实现，有详细的注释，适合初学者。不过不是基于大数运算的。-Simple realization of the RSA encryption algorithm, a detailed notes, suitable for beginners. But is not based on the computation of large numbers.