mash11_only_canary

BASE64编码的C实现，很精简，可以直接内嵌入工程-BASE64-coded C implementation, it is streamlined and can be directly embedded engineering

完整的EVRC压缩解压缩算法源码,附带一个简单的例子程序。-EVRC complete source compression decompression algorithms, with a simple example program.

ras加密实现,图形界面.源码附有注释，方便理解。欢迎下载(ras encryption to achieve, graphical interface. annotated source code to facilitate understanding. Welcome to download)

Diamond加密算法-A Diamond encrypt arithmetic

一本小书，-a book, huh

ElGamal算法不仅用于数据加密也能用于数字签名，其安全性依赖于有限域上离散对数问题的计算。该方法的关键。首先，选择一个素数P，两个随机数，G和G，X，X＜P，计算Y = G ^ X（MOD P），其公钥Y，G和P的私钥X G和P的一组用户共享。ElGamal数字签名。信息签署M，先选择一个

本实验为编程实现 UDP 协议下使用 RSA 算法对信息的加密解密，用于两端之间的通讯 功能，开发平台为 win8.1， 开发环境 Eclipse， 开发语言 Java。(This experiment under the UDP protocol for programming using the RSA algorithm for encryption and decryption of information, for communication between the two ends of Function development platform is win8.1, the Eclipse development environment, programming language Java.)

一个加密的算法。-An encryption algorithm.

DES算法源代码，这是自己书写的源代码，里面采用了非常多的技巧来提高编解码的效率，研究算法和源码的朋友们，我书写的这个代码可以作为你们很好的参考。-DES algorithm source code, which is writing its own source code, which uses a lot of skills to improve the efficiency of the codec to study the algorithms and source of my friends, I am writing you this code can be used as a good reference.

AML EFFICIENT APPROXIMATE MEMBERSHIP LOCALIZATION WITHIN A WEB-BASED JOIN FRAMEWORK ABSTRACT: In this paper, we propose a new type of Dictionary-based Entity Recognition Problem, named Approximate Membership Localization (AML). The popular Approximate Membership Extraction (AME) provides a full coverage to the true matched substrings from a given document, but many redundancies cause a low efficiency of the AME process and deteriorate the performance of real-world applications using the extracted substrings. The AML problem targets at locating non overlapped substrings which is a better approximation to the true matched substrings without generating overlapped redundancies. In order to perform AML efficiently, we propose the optimized algorithm P-Prune that prunes a large part of overlapped redundant matched substrings before generating them.