Search - c B - CodeBus

Search - c B - List

[Crack Hack] loki加密算法C语言源代码 DL : 1: loki加密算法 /* This is an independent implementation of the encryption algorithm: */ /* */ /* LOKI97 by Brown and Pieprzyk */ /* */ /* which is a candidate algorithm in the Advanced Encryption Standard */ /* programme of the US National Institute of Standards and Technology. */ /* */ /* Copyright in this implementation is held by Dr B R Gladman but I */ /* hereby give permission for its free direct or derivative use subject */ /* to acknowledgment of its origin and compliance with any conditions */ /* that the originators of the algorithm place on its exploitation. */ /* */ /* Dr Brian Gladman (gladman@seven77.demon.co.uk) 14th January 1999 */
Date : 2012-03-17 Size : 101.93kb User :
[Crack Hack] 300_encrypt DL : 0: 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds] -encryption algorithm Test Driver for Crypto. a Class C Library of spreadsheets Primitives : - To generate an RSA key cryptest g-To encrypt an d decrypt a string using RSA cryptest r-To calcu late MD5, SHS, and RIPEMD algorithms-160 message digests : cryptest m file-To encrypt and decrypt a string using DES-EDE in CBC mode : cryptest t-To encrypt or decrypt a file cryptes t e | d input output - To share a file into shadows : cryptest's
Date : 2008-10-13 Size : 379.94kb User : Nikii
[Crack Hack] v5395_iword DL : 0: Iword2004 文档控件源码 1，控件支持全部Office菜单，支持Office的打印预览，控件强大的B/S通讯技术。 2，能够将服务器数据库中的数据或者用户自定义的数据插入当前文档的指定位置。 3，可以将文档中的指定数据随时保存到服务器数据库或者指定的目录中。 4，控件能够在浏览器窗口中直接编辑Word文档并保存到Web服务器上，实现文档和数据库的统一管理。 5，控件同时支持痕迹保留，手写签名，电子印章等办公自动化系统必备的功能。 6，控件采用标准HTTP协议，支持任意后台Web服务器。 7，任意后台编程语言（Asp,c,c++, Jsp,vb, Php，VB.NET,C#.NET等） 8，大量的接口函数，全面支持二次开发 -Iword2004 a source document control, the control supports all the Office menu, Office support the Print Preview Control powerful B / S communications technology. 2, the database server to the data or user-defined data into the current document, the designated location. 3, the document can be specified at any time to preserve data to the database server or the designated directory. 4, the controls in the browser window directly edit and save Word documents to the Web server, Documents and databases to achieve the unified management. 5, traces control while supporting reservations, handwritten signatures, electronic seals of office automation system and other necessary functions. 6, controls the use of standard HTTP protocol support arbitrary background of a Web server. 7, arbitrary backgrou
Date : 2008-10-13 Size : 251.09kb User : 宋雅彧
[Crack Hack] BigInteger_src DL : 0: C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random rand) , genRandomBits(int bits, Random rand) , isProbablePrime(int confidence) , isProbablePrime() , Jacobi(BigInteger a, BigInteger b) , LucasSequence(BigInteger P, BigInteger Q, BigInteger k, BigInteger n) ,max(BigInteger bi) , min(BigInteger bi) , modInverse(BigInteger modulus) , RabinMillerTest(int confidence) , -C# BigInteger class. BigInteger.cs is a cs harp program. It is the BIgInteger class. It has methods : abs (), FermatLittleTest (int confidence). gcd (BigInteger bi), genCoPrime (int bits, Random rand), genPseudoPrime (int bits, int confidence, Random rand). genRandomBits (int bits, Random rand). isProbablePrime (int confidence). isProbablePrime (), Jacobi (BigInteger a, BigInteger b), LucasSequence (BigInteger P, BigInteger Q, BigInteger k, BigInteger n), max (BigInteger bi), min (BigInteger bi). modInverse (BigInteger modulus). RabinMillerTest (int confidence),
Date : 2008-10-13 Size : 35.04kb User : jason..
[Crack Hack] SoftProtect DL : 0: rsa加密过程中需要大数的幂运算后求模，本程序即计算a的b次方的结果对c求模，其中a,b,c均为大自然数,编写rsa加密的朋友可以作为参考(其实就是rsa的精华)
Date : 2008-10-13 Size : 15.12kb User : showerxu1979
[Crack Hack] 1 DL : 0: 写一个对文本文件加密的程序和一个解密的程序。密码规则是：对于小写字母，a换成x，b换成y，c换成z，d换成a，e换成b，...；对于大写字母，A换成X，B换成Y，C换成Z，D换成A，E换成B，...；其他字符不变。
Date : 2008-10-13 Size : 3.59kb User : lbzhahaha
[Crack Hack] RSA解密和加密算法的实现和应用 DL : 0: RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a, 将其看成是一个大整数, 假设 a < n.... 如果 a >= n 的话, 就将 a 表成 s 进位 (s <= n, 通常取 s = 2^t), 则每一位数均小于 n, 然後分段编码...... 接下来, 计算 b == a^m mod n, (0 <= b < n), b 就是编码后的资料。解码的过程是, 计算 c == b^r mod pq (0 <= c < pq), 于是, 解码完毕-RSA algorithm : First, find a few 3, p, q, r, p, q is the two different prime number, with the r (p-1) (q-1) coprime several ... p, q, r it person_key number is three, and then find m, making r ^ m == a mod (p-1) (q-1 m ...................................... this must exist, because r (p-1) (q - 1) coprime, with the division algorithm can be a ..... Next, calculate n = pq ....... m, n is the number two public_key, coding process is that if a data and to treat it as a big Integer assuming a <n. ... If a> = n, a table will be rounding into s (s <= n, usually from 2 ^ s = t), each n is less than the median, and then sub-coding ..... . Next, calculate a == b ^ m mod n, (0 <= b <n), b is encoded information. Decoding is the process of calculating c == b ^ r mod pq (0 <= c &
Date : 2008-10-13 Size : 1.36kb User : 胡康康
[Crack Hack] RSA解密和加密算法的实现和应用 DL : 0: RSA算法 :首先, 找出三个数, p, q, r, 其中 p, q 是两个相异的质数, r 是与 (p-1)(q-1) 互质的数...... p, q, r 这三个数便是 person_key，接著, 找出 m, 使得 r^m == 1 mod (p-1)(q-1)..... 这个 m 一定存在, 因为 r 与 (p-1)(q-1) 互质, 用辗转相除法就可以得到了..... 再来, 计算 n = pq....... m, n 这两个数便是 public_key ，编码过程是, 若资料为 a, 将其看成是一个大整数, 假设 a < n.... 如果 a >= n 的话, 就将 a 表成 s 进位 (s <= n, 通常取 s = 2^t), 则每一位数均小于 n, 然後分段编码...... 接下来, 计算 b == a^m mod n, (0 <= b < n), b 就是编码后的资料。解码的过程是, 计算 c == b^r mod pq (0 <= c < pq), 于是, 解码完毕-RSA algorithm : First, find a few 3, p, q, r, p, q is the two different prime number, with the r (p-1) (q-1) coprime several ... p, q, r it person_key number is three, and then find m, making r ^ m == a mod (p-1) (q-1 m ...................................... this must exist, because r (p-1) (q- 1) coprime, with the division algorithm can be a ..... Next, calculate n = pq ....... m, n is the number two public_key, coding process is that if a data and to treat it as a big Integer assuming a <n. ... If a> = n, a table will be rounding into s (s <= n, usually from 2 ^ s = t), each n is less than the median, and then sub-coding ..... . Next, calculate a == b ^ m mod n, (0 <= b <n), b is encoded information. Decoding is the process of calculating c == b ^ r mod pq (0 <= c &
Date : 2025-12-21 Size : 1kb User : 胡康康
[Crack Hack] 300_encrypt DL : 0: 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds] -encryption algorithm Test Driver for Crypto. a Class C Library of spreadsheets Primitives :- To generate an RSA key cryptest g-To encrypt an d decrypt a string using RSA cryptest r-To calcu late MD5, SHS, and RIPEMD algorithms-160 message digests : cryptest m file-To encrypt and decrypt a string using DES-EDE in CBC mode : cryptest t-To encrypt or decrypt a file cryptes t e | d input output- To share a file into shadows : cryptest's
Date : 2025-12-21 Size : 380kb User : Nikii
[Crack Hack] BigInteger_src DL : 0: C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bits, int confidence, Random rand) , genRandomBits(int bits, Random rand) , isProbablePrime(int confidence) , isProbablePrime() , Jacobi(BigInteger a, BigInteger b) , LucasSequence(BigInteger P, BigInteger Q, BigInteger k, BigInteger n) ,max(BigInteger bi) , min(BigInteger bi) , modInverse(BigInteger modulus) , RabinMillerTest(int confidence) , -C# BigInteger class. BigInteger.cs is a cs harp program. It is the BIgInteger class. It has methods : abs (), FermatLittleTest (int confidence). gcd (BigInteger bi), genCoPrime (int bits, Random rand), genPseudoPrime (int bits, int confidence, Random rand). genRandomBits (int bits, Random rand). isProbablePrime (int confidence). isProbablePrime (), Jacobi (BigInteger a, BigInteger b), LucasSequence (BigInteger P, BigInteger Q, BigInteger k, BigInteger n), max (BigInteger bi), min (BigInteger bi). modInverse (BigInteger modulus). RabinMillerTest (int confidence),
Date : 2025-12-21 Size : 35kb User : jason..
[Crack Hack] SoftProtect DL : 0: rsa加密过程中需要大数的幂运算后求模，本程序即计算a的b次方的结果对c求模，其中a,b,c均为大自然数,编写rsa加密的朋友可以作为参考(其实就是rsa的精华)-rsa encryption need computing power of large numbers after the seek mode, the procedure to calculate a result of the b-th power of c for mold, which a, b, c are the number of nature, the preparation of rsa encryption friends can serve as a reference ( in fact the essence of rsa)
Date : 2025-12-21 Size : 15kb User : showerxu1979
[Crack Hack] 1 DL : 0: 写一个对文本文件加密的程序和一个解密的程序。密码规则是：对于小写字母，a换成x，b换成y，c换成z，d换成a，e换成b，...；对于大写字母，A换成X，B换成Y，C换成Z，D换成A，E换成B，...；其他字符不变。-Write a text file encryption program and a decryption process. Password rules are: For the lowercase letters, a replaced by x, b replaced by y, c replaced by z, d replaced by a, e replaced by b ,... for capital letters, A replaced by X, B replaced by Y , C replaced by Z, D replaced by A, E replaced by B ,... other characters unchanged.
Date : 2025-12-21 Size : 3kb User : lbzhahaha
[Crack Hack] Vigenère DL : 0: 维吉尼亚算法的实现，构成明文：每个字符惟一对应一个0~25间的数字。密钥：一个字符串，其中每个字符同明文一样对应一个数字，代表位移值，如a 表示位移 0，b 表示位移 1，c 表示位移 2，...... ）。加密过程：将明文数字串依据密钥长度分段，并逐一与密钥数字串相加（模26），得到密文数字串；最后，将密文数字串转换为字母串。 -Virginia algorithm constitutes explicit: Each character corresponds to only a 0 ~ 25 figures. Key: a string, each of which express the same character with a corresponding figures represent the displacement values, such as a, said the displacement 0, b said displacement 1, c that the displacement of 2 ,......). Encryption process: to express the number of sub-series based on key length, and one by one with the string of key figures add up (modulus 26), has been the number of string ciphertext Finally, the figures ciphertext string converted to string letters.
Date : 2025-12-21 Size : 2kb User : rock
[Crack Hack] RSAencryptonC DL : 0: RSA算法是第一个能同时用于加密和数字签名的算法，也易于理解和操作。 RSA是被研究得最广泛的公钥算法，从提出到现在已近二十年，经历了各种攻击的考验，逐渐为人们接受，普遍认为是目前最优秀的公钥方案之一。RSA的安全性依赖于大数的因子分解，但并没有从理论上证明破译RSA的难度与大数分解难度等价。即RSA的重大缺陷是无法从理论上把握它的保密性能如何，而且密码学界多数人士倾向于因子分解不是NPC问题。RSA的缺点主要有：A)产生密钥很麻烦，受到素数产生技术的限制，因而难以做到一次一密。B)分组长度太大，为保证安全性，n 至少也要 600 bits以上，使运算代价很高，尤其是速度较慢，较对称密码算法慢几个数量级；且随着大数分解技术的发展，这个长度还在增加，不利于数据格式的标准化。目前，SET(Secure Electronic Transaction)协议中要求CA采用2048比特长的密钥，其他实体使用1024比特的密钥。　　这种算法1978年就出现了，它是第一个既能用于数据加密也能用于数字签名的算法。它易于理解和操作，也很流行。算法的名字以发明者的名字命名：Ron Rivest, AdiShamir 和Leonard Adleman。但RSA的安全性一直未能得到理论上的证明。 -RSA encryption C++ to achieve balance
Date : 2025-12-21 Size : 3.6mb User : w
[Crack Hack] 1008 DL : 0: Julius Caesar曾经使用过一种很简单的密码。对于明文中的每个字符，将它用它字母表中后5位对应的字符来代替，这样就得到了密文。比如字符A用F来代替。如下是密文和明文中字符的对应关系。密文 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 明文 V W X Y Z A B C D E F G H I J K L M N O P Q R S T U 你的任务是对给定的密文进行解密得到明文。你需要注意的是，密文中出现的字母都是大写字母。密文中也包括非字母的字符，对这些字符不用进行解码。 -Julius Caesar had used a very simple passwords. To express each of the characters in its alphabet with its corresponding character after the 5 to replace, so get the ciphertext. A character such as using F instead. Here are the characters in the ciphertext and plaintext correspondence. Ciphertext ABCDEFGHIJKLMNOPQRSTU VWXYZ expressly VWXYZABCDEFGHIJKLMNOP QRSTU Your task is given to decrypt the ciphertext be clear. You need to note that the ciphertext letter appears in all capital letters. Ciphertext also includes non-alphabetic characters, these characters without decoding.
Date : 2025-12-21 Size : 1kb User : dvd
[Crack Hack] md5 DL : 0: MD5算法的实现以及分析，主循环有四轮（MD4只有三轮），每轮循环都很相似。第一轮进行16次操作。每次操作对a、b、c和d中的其中三个作一次非线性函数运算，然后将所得结果加上第四个变量，文本的一个子分组和一个常数。再将所得结果向右环移一个不定的数，并加上a、b、c或d中之一。最后用该结果取代a、b、c或d中之一。-MD5 algorithm implementation and analysis, the main loop there are four rounds (MD4 only three), each round of circulation are very similar. The first round of the 16 operations. Each operation on a, b, c and d for the first time in three of the nonlinear function operation, then the result plus a fourth variable, the text of a sub-group, and a constant. The results then move to the right of a variable number of rings, plus a, b, c or d in one. Finally, the results of replacing a, b, c or d in one.
Date : 2025-12-21 Size : 187kb User : 范小饭
[Crack Hack] affine-caesar DL : 0: Affine Ceasar Cipher 加密解密字母，C=[(a,b),p]=(a*p+b) mod 26.-Affine Ceasar Cipher
Date : 2025-12-21 Size : 1kb User : master
[Crack Hack] smc DL : 0: 双进程smc技术实现，实现A对B进行加密，C对B进行解密，最后由C运行B-Smc double process technology to achieve the A to B to encrypt, C to B to decrypt the final run B from C
Date : 2025-12-21 Size : 139kb User : forgiven
[Crack Hack] DES-of-b DL : 0: 这是一个关于DES加密的探讨,基于VISUAL C++ 6.0编写.-This is a test about DES.
Date : 2025-12-21 Size : 7kb User : 原木
[Crack Hack] eXeScope DL : 0: 比较好用的脱壳工具.用于C++/B等软件-Shelling relatively easy to use tool for C++/B software
Date : 2025-12-21 Size : 488kb User : df

« 12 »