加密算法模块delphi源码

对文件加密的试验程序。-document encryption testing procedures.

加密作业,实现简单的DES加密,完全实现DES加密的工作流程-encryption operations, the simple DES encryption, completely DES encryption workflow

EXE二合一源代码!不用多说了!用tasm编译!-source code! Needless to say! With Tasm compiler!

Base64 加密算法（Author 蒋柏良 Jerry Jiang)-* * DESCRIPTION * Base64 processes input in 24bit chunks by converting each chunk into 4 * bytes of output. It does so by splitting input into four 6bit groups and * using these as indexes in the following substitution table- * const char base64_map[] = * "ABCDEFGHIJKLMNOPQRSTUVWXYZ" * "abcdefghijklmnopqrstuvwxyz" * "0123456789+/" * If an input is not a multiple of 3 bytes, it s padded with zeros. In * this case the output bytes that consist entirely of the pad data are * replaced with = . * * Example * An input of 0x00 0x45 0xF2 is equivalent to 00000000 01000101 11110010 * bit sequence, which s then split into 000000 000100 010111 110010 * and these are substituted to produce the following base64 encoding * A E X y * * RETURN VALUE * b64_length() should return output length for the input of len bytes. * b64_encode() should encode len bytes from src int

简单的加密算法 简单的加密算法 vb-simple encryption algorithm is simple encryption algorithm vb

著名的l0pht代码！-famous l0pht code!

DES算法实现，非常有用，对于研究加密的朋友希望回有帮助-DES algorithm, very useful for research encryption friends want to return to help

关于NSEA算法的一个小程序-NSEA algorithm on a small program

OPT一次性动态口令验证算法。根据动态支持TOTP和HOTP验证。-A one-time dynamic password authentication algorithm OPT. According to dynamic support for TOTP and HOTP authentication.

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