一个测试DES加密算法和测试程序

一个DES加密算法的实现-a DES encryption algorithm implementation

/* RSA Demo 1.0 版 * 版权所有 (C) 2004 赵春生 * 2004.04.25 * http://timw.yeah.net * http://timw.126.com * 本程序调用Miracl ver 4.82大数运算库，详见其附带手册。 * P,Q,N,D,E使用RSATool2生成。 */ 编译提示： 一：将Project-Settings-Settings For(All Configuration)-C/C++中Category项的 Precompiled Headers设置成：Automatic use of precompiled headers（图1）。 二：将ms32.lib添加到工程中（图2）。 三：MIRACL是C库。 extern "C" { #include "miracl.h" #include "mirdef.h" } #pragma comment( lib, "ms32.lib" )-/* RSA Demo version 1.0* Copyright (C) 2004 Zhao Chunsheng 2004.04.25*** http://timw.126.com http://timw.yeah.net* The procedures called Miracl ver 4. The majority of computing for 82, as detailed in its fringe manual.* P, Q, N, D, E use RSATool2 generation.*/Compiler Tip : 1 : Project-Settings- Settings For (All Configuration)- C/C Category, of OO Headers set : Automatic use of precompiled headers (Figure 1). 2 : ms32.lib added to the project (Figure 2). 3 : MIRACL C library. Extern "C" (# include "miracl.h"# include "mirdef.h")# pragma

RSA算法的实验报告，有源码、流程图、时间复杂度分析等。-RSA algorithm experimental reports, source code, flowcharts, time complexity analysis.

VC知识库文章 - C-S模式考试程序制作详解-VC-C-S model produced Elaborates on examination procedures

IEEE2008年文章An Image Encryption Scheme Based on Chaotic Map -An Image Encryption Scheme Based on Chaotic Map

VHDL实现128bitAES加密算法 LOW AREA节约成本的实现 DATA FLOW为8bits-VHDL realize 128bitAES encryption algorithm LOW AREA realize cost-saving DATA FLOW for 8 bits

这是一个完整的数字签名过程，包括密钥的分发管理，摘要的提取，在eclipse上测试成功。

UNICODE编码介绍-coding introduced UNICODE

使用C编写的DES, DESX, DES3(三层DES) 的加密算法, 本程序演示如何在Delphi中进行调用C编写的算法 DES 密匙长度 8 DESX 密匙长度 16 DES3 密匙长度 24 (加密强度高了很多)-C prepared by the use of DES, DESX, DES3 (three-DES) encryption algorithm, the program demonstrates how to call in Delphi in the preparation of the algorithm C key length DES key 8 DESX length 16 DES3 key length 24 (high strength encryption a lot)

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