搜索资源列表
公钥加密算法
- rsa加密解密是一种公钥加密算法，广泛应用于信息安全领域-rsa encryption and decryption is a public key encryption algorithm widely used in the field of information security
基于密码技术的MobileAgent系统安全问题解决方案
- Agent技术的研究起源于人工智能领域。由于Agent具有自治性、智能性、反应性、主动性等优点，因此越来越受到人们的重视，并被广泛应用于网络技术和分布式计算。Agent技术很好的解决了网络间任务分配及合作的问题，但Agent系统实际应用时的安全问题一直没有得到很好的解决。本文设计了一个可实际应用的Mobile Agent系统安全问题解决方案，该方案可以有效解决实际运行中Agent系统的安全认证及安全通信问题。最后介绍了该方案在个性化E-learning系统中的实际应用情况。-Agent tech
yC1.3src
- I think this the first time every one can look at a PE crypter source in top level language such VC++. So as I promised ... if some one sent me one nice compress source I would publish my source. I dedicate this source to all people who invo
PrimeGenAndTester
- Very large (tested for more than 2048 bits) prime number generator and tester program. This is well written and based on solid algorithms in this field. Source code is my own, used for Masters course in Cryptography. Program has easily readable and
kasumi
- 实现KASUMI算法的加密解密,可以应用于密码学领域-Implementation of the KASUMI encryption algorithm, can be applied to the password field of study
GF_MUL
- Galois域乘法器的Verilog源码 广泛用于信道编码、计算机代数及椭圆曲线加密等-Galois field multipliers are widely used in the Verilog source channel coding, computer algebra and elliptic curve encryption
GFP_MOD_ADD_Project
- this the ADD routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the ADD routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.
GFP_MOD_SUB_Project
- this the SUB routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the SUB routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.
GFP_MONT_INV_Project
- this the MONTGOMERY INV routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the MONTGOMERY INV routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or a
GFP_MUL_Project
- this the MUL routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the MUL routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.
PRNG_Project
- this the PRNG routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.-this is the PRNG routine for the prime field and large numbers for ECC or RSA algorithms. with IAR version 5 or above.
GF
- table generation for Rijndael/AES finite field GF(256) with various generator polynomials
AES-Crypto-SN-Generator
- AES 是一种使用安全码进行信息加密的标准。 它支持 128 位、192 位和 256 位的密匙。 加密算法的实现在 ElAES.pas 单元中。 本人将其加密方法封装在 AES.pas 单元中， 只需要调用两个标准函数就可以完成字符串的加密和解密。 (* 密匙长度 *) 128 位支持长度为 16 个字符 192 位支持长度为 24 个字符 256 位支持长度为 32 个字符 所有加密和解密操作在默认情况下为 128 位密匙。-
CRC16
- The class has a methode named make_CRC that gets a byte stream and start/end offsets then calculate and return a 16 bit CRC according to determined POLYNAMIAL.The POLYNAMIAL is a private field of the class.
freehdl-0.0.6.tar
- inplementation of AES vhdl The use of a list of law, VHDL language based polynomial-based finite field multiplier, for the AES algorithm
RSAESRCI.ZIP
- RSA算法的具体实现，用于信息安全技术领域的加密算法。-Concrete realization of RSA algorithm is used in the field of information security technology, encryption algorithm.
good_galois_all_operations
- Galois field is used in ECC( elliptic curve cryptography). This is a brief introdustion about the prime field and its related concepts
crypt-1.17
- crypt-1.17 libtom库 文件加解密库，内有test工程源码，对那些尚对加密解密领域有很大的帮助！-crypt-1.17 libtom library file encryption and decryption libraries, within the test project source code, for those still on the field of encryption and decryption of great help!
rtl
- 基于脉动结构的有限域乘法器，verilog代码-Based on the pulse of the structure of finite field multipliers, verilog code
finite-field
- 有限域英文版 有限域是研究现代密码学网络安全的基础课程，有很重要的应用-finite field