搜索资源列表
RSA
- 使用rsa算法实现数据的加密解密和数据验证验签-Using the data of the rsa algorithms realize encrypt, decrypt and data validation check signing
credit_card_checker_with_luhn_algorithm
- check validation of smart card with luhn algorithm
Animated_C2123858182008
- Usually we see static Captcha, now we will make an imated Captcha. Now this cool. What does the captcha look like? It just like the ordinary Captcha, the difference is the letters are moving and animated. You can set your Captcha setting quickly suc
ISO9797
- this is document driscrble about ISO9797 to explain about padding for DES. Please check and con firm it s very easy.
v6conlson0602
- RSA 大数运算 部分源码，附说明,详细查看-RSA big number with comment resource，please check
Fermat
- Fermats test to check for primality. Code is in java. takes a e=random number and gives whether it is prime or not.
secure-file-encdec
- here is a ca file check this
pkcsSharp11SignVerify
- 使用pkcs#11的KEY中公私钥进行签名验签操作-Use pkcs# KEY 11 in public and private key for signing inspection check operation
crc_rec_fin
- A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.
crc_sen_rec_fin_matlab
- A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.
simplest-S
- A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data.
getperformanceLDPCchecknodetable
- Returns check node table for LDPC coding in DVB.S2 standard. R code rate. switch R case 1/4- Returns check node table for LDPC coding in DVB.S2 standard. R code rate. switch R case 1/4
prob3
- Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to
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,
数字签名、数字证书分析与Java实现
- 创建数字证书，更新数字证书，RSA私钥签名，公钥解密，验证数字签名，合并图章到另找一张图片(Create CER;Edit CER;RSASignature;Check Signature;Combine Pics)