搜索资源列表
TEA
- 本加密程序基于著名的TEA加密算法,密钥长度为128位,安全性高于DES算法(56位). 该算法安全、简洁、高效,加密解密速度极快,占用内存极少，非常适合于嵌入式系统 的加密解密，也能胜任大系统的安全性能要求。算法能防止常见的密码学攻击。 本程序中待加密的明文、加密生成的密文皆按64位数据分组进行加解密。 密钥长度128位，与AES、IDEA相当，从而确保足够的安全性。-The encryption program is based on the famous TEA
UCAM-CL-TR-630
- 包括了非常有用和详尽的芯片级解密的方法.(英文版)-the file includes lot of method to attack the die of silicon chip
w1
- Weiner Attack is an attack on rsa cryptography system-Weiner Attack is an attack on rsa cryptography system
RSAttacker
- rs攻击lsb密写 检测图片中是否含有lsb 隐藏信息 -rs attack lsb steganography
antirsattack
- 一种抗RS攻击的隐写算法一种抗RS攻击的隐写算法-An anti-attack steganographic algorithm
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
aes_mini_project
- It is encryption and decryption algorithm. AES is a symmetric encryption algorithm processing data in block of 128 bits.Under the influence of a key, a 128-bit block is encrypted by transforming it in a unique way into a new block of the same s
RangeKutta
- 随着网络带宽和计算机处理能力的高速增长, 数字 图像在当今社会的各个领域被广泛使用. 由于网络的开 放性, 涉及国家安全、商业利益和个人隐私的图像需要 进行加密, 以保护其安全. 将传统的加密标准, 如IDEA 和AES 直接应用到图像的加密上存在一定的缺陷. 因 为传统的加密算法主要为一维的数据流设计, 没有考虑 二维图像的特性, 如空间有序性、视觉冗余性、相关性等 等. 这使得传统加密算法在加密数据量较大的图像时要 耗费较长的时间. 与一般的二进制数据不同
RSA-attack
- RSA attack with cyclic encryption, documentation is in slovak language
oaep
- oaep attack implemented in C
011
- Known-Plain-text Attack Against a Permutation Based Video Encryption Algorithm
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 where 1 ≤ x ≤ 240. Your goal
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,