var g_invip=new array( //逆初始置換ip
40,8,48,16,56,24,64,32,39,7,47,15,55,23,63,31,38,6,46,14,54,22,62,30,37,5,45,13,53,21,61,29,36,4,44,12,52,20,60,28,35,3,43,11,51,19,59,27,34,2,42,10,50,18,58,26,33,1,41,9,49,17,57,25
);var g_e=new array( //e 選位表
32,1,2,3,4,5,4,5,6,7,8,9,8,9,10,11,12,13,12,13,14,15,16,17,16,17,18,19,20,21,20,21,22,23,24,25,24,25,26,27,28,29,28,29,30,31,32,31
);var g_p=new array( //p 選位表
16,7,20,21,29,12,28,17,1,15,23,26,5,18,31,10,2,8,24,14,32,27,3,9,19,13,30,6,22,11,4,25
);var g_s=new array( //8個s合
14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7,0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8,4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0,15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13,
15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10,3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5,0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15,13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9,
10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8,13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1,13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7,1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12,
7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15,13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9,10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4,3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14,
2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9,14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6,4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14,11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3,
12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11,10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8,9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6,4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13,
4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1,13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6,1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2,6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12,
13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7,1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2,7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8,2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11
);var g_keyout=new array(768);
function initkey(str_key)
for(**t=0;**t<16;**t++)
var b_array_dor = new array(48);
for(i=0;i<48;i++)
for(s**t=n=0;s**t<8;s**t++)
for(**t=0;**t<16;**t++)
}
for(i=0;i<32;i++)
var fout=new array(64);
for(i=0;i<64;i++) fout[i]=b_array_lr[g_invip[i]-1];
var strout="";
for(i=0;i<8;i++)
for(**t=15;**t>=0;**t--)
}
for(i=0;i<32;i++)
var fout=new array(64);
for(i=0;i<64;i++) fout[i]=b_array_lr[g_invip[i]-1];
var strout="";
for(i=0;i<8;i++){
sum=0;
for(j=0;j<8;j++){
sum+=(fout[i*8+j]<
用winrar的指令碼語言，實現程式的自動打包
目前正在做的一個vb的專案中，其中有一條很有趣的需求 要求釋出的檔案是單獨的可執行檔案，換句話說 不要安裝包，也不要期望客戶會裝什麼特殊的環境。很自然的就想到了用winzip或者winrar做一個自解壓的exe.因為現在什麼都是自動化，自然就想著把這個也自動化。ok，研究了一下winrar的命令列方...
DES演算法的c語言實現
網上找了一部分 稍微修改了下就可以使用了。已上傳github 原理 des演算法把64位的明文輸入塊變為64位的密文輸出塊,它所使用的金鑰也是64位 實際用到了56位，第8 16 24 32 40 48 56 64位是校驗位，使得每個金鑰都有奇數個1 其演算法主要分為兩步 1 初始置換 其功能是把輸...
DES加密演算法的C語言實現
include des version 0.4 created by source at 2007.3 competence p4 3.0g 512m 3000000 times encryption with created subkeys 26.784 seconds about 0.85m s...
用c語言實現的FFT
一 對fft的介紹 1.fft fast fourier transformation 即為快速傅立葉變換，是離散傅立葉變換的快速演算法，它是根據離散傅立葉變換的奇 偶 虛 實等特性，對離散傅立葉變換的演算法進行改進獲得的。2.fft演算法的基本原理 fft演算法是把長序列的dft逐次分解為較短序列...
c語言實現DES演算法的金鑰生成演算法
直接上源 要求是輸入是金鑰是十六位數，字母要大寫 include int main 置換陣列 int change2 28 int change11 48 int yiwei 16 for i 0 i 16 i 輸入金鑰 for i 0 i 16 i 十六進位制轉換為01字串 if key i 1 ...