Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - WORD
Search - WORD - List
RSA核心运算使用的乘模算法就是 M(A*B)。虽然M(A*B)并不是乘模所需要的真正结果,但只要在幂模算法中进行相应的修改,就可以调用这个乘模算法进行计算了。本软件起初未使用Montgomery 乘模算法时,加密速度比使用Montgomery乘模算法慢,但速度相差不到一个数量级。 将上述乘模算法结合前面叙述的幂模算法,构成标准Montgomery幂模算法,即本软件所使用的流程
Date : 2008-10-13 Size : 2.8kb User : 拉萨

RSA核心运算使用的乘模算法就是 M(A*B)。虽然M(A*B)并不是乘模所需要的真正结果,但只要在幂模算法中进行相应的修改,就可以调用这个乘模算法进行计算了。本软件起初未使用Montgomery 乘模算法时,加密速度比使用Montgomery乘模算法慢,但速度相差不到一个数量级。 将上述乘模算法结合前面叙述的幂模算法,构成标准Montgomery幂模算法,即本软件所使用的流程 -RSA computation used by the core modulus algorithm is M (A* B). Although the M (A* B) is not required by the real-mode, but as long as the power modulus algorithm in the corresponding changes, you can call this by the calculated modulus algorithm. This software was initially not used by Montgomery modulus algorithm, the encryption faster than the use of Montgomery modulus algorithm by slow, but the speed was less than an order of magnitude. Modulus algorithm by the above described combination of the previous power-modulus algorithm, which constitute the standard Montgomery idempotent modulus algorithm, that is, the software used in flow
Date : 2025-12-19 Size : 3kb User : 拉萨

DL : 0
encriptor with sBox combination and feitsel with plug-in in microsoft word
Date : 2025-12-19 Size : 679kb User : cin

DL : 0
word加解密,适用于RC4、MD5、hash等一系列加密形式-word of encryption and decryption for RC4, MD5, the hash encrypted form
Date : 2025-12-19 Size : 32kb User : Leo

在DEVC++上测试可用,虽只是一个初步的蓝本,但已能实现将txt,pdf,word,rar等加解密-Test available in DEVC++, is only a preliminary blueprint for, but has been able to achieve txt, pdf, word, rar encryption and decryption
Date : 2025-12-19 Size : 1kb User : dongdong

2010 word 永久激活版,操作很简单,三部曲,详细见压缩包。-2010 word jihuo
Date : 2025-12-19 Size : 3.24mb User : huangyu

Program to crypt data by Caesar cipher, which encrypts Vigenere, encrypts Trithemius, a Caesar cipher with a key word, encrypts GRONSFELDA, Atbashi.
Date : 2025-12-19 Size : 8.72mb User : aslash

This a new algorithm in which we encrypt on the basis of position of the character. Algorithm 1 for key generation and Algorithm 2 is for encryption Algorithm A1 Step1: Let the key be ‘k’. Step2: Multiply the index number +1 with its ASCII code of the character at that index-65. Step3: Sum all the values and mod 26. Step4: Return the key. Algorithm A2 Step1: Take the string which you want to encrypt. Step2: Find the number of spaces. Step3: We add 65 to number of space. Step4: Take a string s. Step5: Add character representing number of spaces to that string. Step6: Calculate the word length of all the words present in the string and 65 to it. Step7: Now append the character that represents the word length. Step8: Subtract the number 1 and Add the number 1 with the ASCII value of the characters at alternate position. Step9: Add the key to each character in the string. Step10: Subtract 65 and the value so obtained modulo 26. Step11: Cipher text obtained.-This is a new algorithm in which we encrypt on the basis of position of the character. Algorithm 1 for key generation and Algorithm 2 is for encryption Algorithm A1 Step1: Let the key be ‘k’. Step2: Multiply the index number +1 with its ASCII code of the character at that index-65. Step3: Sum all the values and mod 26. Step4: Return the key. Algorithm A2 Step1: Take the string which you want to encrypt. Step2: Find the number of spaces. Step3: We add 65 to number of space. Step4: Take a string s. Step5: Add character representing number of spaces to that string. Step6: Calculate the word length of all the words present in the string and 65 to it. Step7: Now append the character that represents the word length. Step8: Subtract the number 1 and Add the number 1 with the ASCII value of the characters at alternate position. Step9: Add the key to each character in the string. Step10: Subtract 65 and the value so obtained modulo 26. Step11: Cipher text obtained.
Date : 2025-12-19 Size : 1kb User : Aman Virmani

无序替换加密,通过词频确定密钥,python代码。-Disorderly replace encryption by determining the key word frequency, python code.
Date : 2025-12-19 Size : 1kb User : 大美女

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. ChaCha operates on a 4×4 array of words. BLAKE repeatedly combines an 8-word hash value with 16 message words, truncating the ChaCha result to obtain the next hash value. BLAKE-256 and BLAKE-224 use 32-bit words and those output digest size are 256 bits and 224 bits, while BLAKE-512 and BLAKE-384 use 64-bit words and those output digest size are 512 bits and 384 bits.-BLAKE2 are cryptographic hash functions based on Dan Bernstein s ChaCha stream cipher, but a permuted copy of the input block, XORed with some round constants, is added before each ChaCha round. Like SHA-2, there are two variants differing in the word size. ChaCha operates on a 4×4 array of words. BLAKE repeatedly combines an 8-word hash value with 16 message words, truncating the ChaCha result to obtain the next hash value. BLAKE-256 and BLAKE-224 use 32-bit words and those output digest size are 256 bits and 224 bits, while BLAKE-512 and BLAKE-384 use 64-bit words and those output digest size are 512 bits and 384 bits.
Date : 2025-12-19 Size : 486kb User : Jonathan Young
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.