搜索资源列表
OpenCA-0.8.1.tar.gz
- Perl写的CA认证程序，用到了OpenSSL
cert.tar
- 用JAVA构建企业CA中心.包括制作企业根证书，制作服务器端证书，用CA根证书签发服务器端根证书，客户端证书的颁发，客户端证书的验证等等。-with Java build enterprise CA Center. Including the production of enterprises root certificate, a certificate production server with CA-issued certificate of the root certificate s
minicadllsrc
- 一小型CA系统的动态库实现源程序,无解压密码.-a small CA system for realizing the dynamic source, without extracting passwords.
数字签名1
- 作者学习CA的时候写的练习程序，比较简单。谢谢！-CA study authors wrote when he was a practicing procedures, relatively simple. Thank you!
bcprov-jdk14-131src
- bouncycastle 是一个JAVA安全提供者，EJBCA就调用了这个包。-bouncycastle Java is a security provider, EJBCA call on this package.
A-key
- 在cdma2000移动通信系统中使用A-Key实现空中接口部分无线接入的身份验证和加密密钥的产生。
RunAsDate
- RunAsDate 1.05 汉化绿色特别版（破解有时间限制的工具） 软件类别：系统增强 软件大小：21 KB 软件授权：特别版 软件语言：简体中文 应用平台：Win2003, WinXp, Win2000, Nt, WinMe, Win9x 界面预览： 软件介绍： RunAsDate是一个用来破解有时间限制软件的小工具，该软件的使用那是相当的简单，甚至还可以建立运行在特定日期时间的快捷方式，方便以后的使用-Speaking of green Ru
Cryptanalysis-INCrypt32-of-iCLASS
- Cryptanalysis of INCrypt32 in HID s iCLASS Systems ChangKyun Kim, Eun-Gu Jung, Dong Hoon Lee, Chang-Ho Jung, and Daewan Han Category / Keywords: secret-key cryptography / INCrypt32, HID s iCLASS, RFID, reverse engineering, chosen message at
CaesarCipher
- A means of attaining secure communications over insecure channels • Protection of data by transformations that turn useful and comprehensible plain text into scrambled and meaningless cipher text under control of secret keys- A means of att
A-Brief-Study-of-Video-Encryption-Algorithms
- A Brief Study of Video Encryption Algorithms
1-s2.0-S0952197602000878-main
- The paper presents an in situ parameter estimation method to determine the equivalent circuit parameters of the three-winding transformer (TWT). The suggested method also estimates geometrically a complex parameter that is mutual leakage between
A
- 2015说摸fdg fdg g fg -sdf a fds sf sfg sf dfg sfd
diffeehellmanPROGRAM
- Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the answer. A handy standard no
RC4-Prog
- Example 1. To find 1537 x 4248 modulo 10, you could multiply out and take the last digit, but a better way would be to replace 1537 by 7 and 4248 by 8 to start, find 7 x 8 = 56, and then take 56 mod 10 to get 6 as the answer. A handy standard no
ChaosEncryptionJavaAnbeirar
- Modern symmetrical encryption systems use a starting “key” that is up to 256 bits long (for us civilians anyway) and combine this with an initialization-vector (also up to 256 bits long). By applying the vector to the key through some scary mathemati
On-the-Security-of-a-RSA-basede
- On the Security of a RSA-based Certificateless Signature
A-New-Chaotic-Algorithm-for-Image-Encryption
- A New Chaotic Algorithm for Image Encryption
A-Multi-Scale-Bilateral-Structure-Tensor
- A Multi-Scale Bilateral Structure Tensor
BLAKE2-master
- BLAKE2 are cryptographic hash functions based on Dan Bernstein s Cha stream cipher, but a permuted copy of the input block, XORed with some round constants, is added before each Cha round. Like SHA-2, there are two variants differing in the word size
diffie_hellman
- Implement Diffie-Hellman Key exchange protocol and demonstrate that at the end, both person will have a common Key. Do the following: 1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5). 2. Generate a, a random number mod p. Now generate A,