资源列表

« 1 2 ... .24 .25 .26 .27 .28 229.30 .31 .32 »

[CA认证Decryption-algorithmCPPcode

说明:常见的解密算法,包括详细的示例和算法注释-Common decryption algorithms, including detailed examples and algorithmic annotations
<张晓晓> 在 2024-06-03 上传 | 大小:334848 | 下载:0

[CA认证new

说明:LSB steganography Encoding
<Rupam> 在 2024-06-03 上传 | 大小:1024 | 下载:0

[CA认证calc

说明:CRC32 cyclic redundancy code table driven algorithm with 32 bits width
<Guillermo> 在 2024-06-03 上传 | 大小:2048 | 下载:0

[CA认证Hide_the_text_in_the_picture

说明:将文字隐藏于图片中; 只能加密英文字母; 详情请阅读压缩包里的readme.txt。-Hide the text in the picture Only English letters can be encrypted For more information, please read the readme.txt in the compressed package.
<open> 在 2024-06-03 上传 | 大小:1226752 | 下载:0

[CA认证SM3

说明:sm3算法源码,.c,.h,需要自己验证-sm3 source code
<zhangxiaodong> 在 2024-06-03 上传 | 大小:4096 | 下载:0

[CA认证SM3

说明:SM3密码杂凑算法.pdf及sm3算法源码,可以参考-sm3 source code
<zhangxiaodong> 在 2024-06-03 上传 | 大小:96256 | 下载:0

[CA认证aes

说明:C++ code of the Advanced Encryption Standard (AES). This program doesn t have any mode of operation.
<ashwini> 在 2024-06-03 上传 | 大小:3072 | 下载:0

[CA认证cryptanalyse

说明:Cryptanalyse vigenere
<Yahia> 在 2024-06-03 上传 | 大小:1024 | 下载:0

[CA认证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
<jitender grover> 在 2024-06-03 上传 | 大小:1024 | 下载:0

[CA认证4

说明:Cryptographic Hash Functions: A cryptographic hash function must have at least two security properties: collision free and Hiding. Collision free property ensures that for a given function H, no one can find x and y
<jitender grover> 在 2024-06-03 上传 | 大小:1024 | 下载:0

[CA认证discrete_log

说明:Solve descrete log problem using meet in the middle attack. More formally, write a program to compute discrete log modulo a prime p. Let g be some element in Z p and suppose you are given h in Z p such that h = gx
<jitender grover> 在 2024-06-03 上传 | 大小:1024 | 下载:0

[CA认证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
<jitender grover> 在 2024-06-03 上传 | 大小:1024 | 下载:0
« 1 2 ... .24 .25 .26 .27 .28 229.30 .31 .32 »

源码中国 www.ymcn.org