-
c++的基于openssl实现的简单aes文件加密类
c++的基于openssl实现的简单aes文件加密类
-c++ realize openssl based on a simple type of file encryption aes
- 2022-02-06 15:02:34下载
- 积分：1
-
md5src
这个是编译通过的MD5算法，使用的语言是C++，非常好用。(MD5 C++ source code
)
- 2011-12-09 15:51:58下载
- 积分：1
-
密码学文献有一个奇妙的发展历程，当然，密而不宣总是扮演主要角色。第一次世界大战前，重要的密码学进展很少出现在公开文献中，但该领域却和其它专业学科一样向前发展。...
密码学文献有一个奇妙的发展历程，当然，密而不宣总是扮演主要角色。第一次世界大战前，重要的密码学进展很少出现在公开文献中，但该领域却和其它专业学科一样向前发展。-cryptography literature has a wonderful history, of course, close does not declare always played the leading role. Before the First World War, it was important to cryptography little progress emerged in the open literature. However, the area has other professional disciplines and the development of the same.
- 2022-03-30 19:34:10下载
- 积分：1
-
自己敲的混沌加密
说明： 简单的混沌加密，在网易云课堂听课，做的笔记，简单的几个混沌加密，数字水印混沌加密，混沌加密生成二值图像、灰度图像、RGB图像(Simple chaos encryption, in the netease cloud class, take notes, a few simple chaos encryption, digital watermark chaos encryption, chaos encryption generated binary image, gray image, RGB image)
- 2019-11-09 10:31:56下载
- 积分：1
-
常用的密码算法，如RSA，MD2，MD5等，还包括简单的例程，很久以前写着玩的...
常用的密码算法，如RSA，MD2，MD5等，还包括简单的例程，很久以前写着玩的-commonly used cryptographic algorithms, such as RSA, MD2, MD5, also includes a simple routine, a long time ago wrote a play
- 2022-05-24 11:44:52下载
- 积分：1
-
matlab实现AES加解密和基于AES的CMAC
说明： 基于matlab实现AES加解密和基于AES的cmac(AES encryption and decryption based on MATLAB and CMAC based on AES)
- 2020-12-14 20:49:13下载
- 积分：1
-
RSA
RSA算法的解密和加密，用扩展的欧几里得算法求乘法逆元(rsa)
- 2010-06-20 13:05:12下载
- 积分：1
-
myecho
利用人耳朵的时域掩蔽效应，实现回声隐藏。(Using human ear temporal masking, to achieve echo hiding.)
- 2010-05-20 11:31:03下载
- 积分：1
-
jjm
帮助开发出来的程序加密和解密！采用MD5算法，即时数据库中被人盗窃，也不能得到用户登录密码(Developed procedures to help encrypt and decrypt! Using MD5 algorithm, real-time database which has been stolen, nor can the user login password)
- 2007-12-12 22:47:24下载
- 积分：1
-
山排序算法：基本思想：全序无序分离…
希尔排序算法:
基本思想：将整个无序序列分割成若干小的子序列分别进行插入排序。 序列分割方法：将相隔某个增量h的元素构成一个子序列。在排序过程中，逐次减小这个增量，最后当h减到1时，进行一次插入排序，排序就完成。增量序列一般采用：ht=2t-1,1≤t≤[log2n]，其中n为待排序序列的长度。-Hill sorting algorithm: the basic idea: the whole sequence disorder is separated into a number of small sub-sequences respectively Insertion Sort. Sequence segmentation method: h will be separated by an incremental elements constitute a subset of sequences. In the sort process, the successive decrease of the increment, and finally reduced to one when h when an insertion sort, sort completed. Incremental sequence generally use: ht = 2t-1, 1 ≤ t ≤ [log2n], in which n is the length of sequence to be sorted.
- 2022-02-06 21:23:34下载
- 积分：1
