加密算法源代码应用

mina is nice tool for java script deobfuscation

this DES made by verilog

jcrypt加密，看看有没有人需要，分享给大家-jcrypt encryption, see no need for everyone to share

椭圆曲线加密算法源代码，用VC＋＋编写，很好的东西-Elliptic curve encryption algorithm source code, using VC to prepare, good things

高级加密标准AES优胜算法Rijndael c语言源代码。-Advanced Encryption Standard algorithm Rijndael winning c language source code.

使用的是BCB5开发的一个简单的3DES的DEMO，对文件采用的是密文挪用来处理短块。-Using BCB5 developed a simple 3DES of DEMO, the document is used ciphertext diverted to deal with the short block.

1.本程序将所有可能出现的英文和符号定义在ASCII表中的“000--255”中的256个常用字符 2.在实现2的基础上，实现控制台对英文文本文件（注意明文和密文都以文件形式存在）的加解密 形式：cipher 源文件名 目的文件名 密钥 E/D（标示加解密）说明：对于加密来说，源文件名就是明文，对于解密来说，源文件名就是密文-1. This program will all possible symbols in English and in the definition of the ASCII table, "000-- 2 55 "of 256 commonly used characters in two. in achieving two on the basis of Console achieve the English text files (and expressly close attention to the text of a document form) encryption forms : cipher source document file names Key E/D (marked increase declassified) Note : For encryption, source file name is expressly for declassification, the source file name is ciphertext

一个免费实用的DELPHI AES 加密算法函数包及演示文件,给有需要的朋友-a free practical DELPHI AES encryption algorithm function package and demonstrate the documents to a friend in need

Simple steganography program written in Python. The program writes and reads information to/from 24 bits bitmaps.

希尔排序算法: 基本思想：将整个无序序列分割成若干小的子序列分别进行插入排序。 序列分割方法：将相隔某个增量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.