PB下的加密解密的简单算法函数

/* 函数：string gf_密文(string input,boolean encode) 参数：string input 字符串（需要加密的字符串或者需要解密的字符串） boolean encode =true 加密 =false 解密 返回值：string 被解密或加密后的字符串 */ int i,t,m long codenum[] string output,codestr[] string code[],replace t=len(input) long li_key[] //4个用于加密的8位数字加密因子，可以自己更改，注意的是加密和解密需用同一套加密因子 //每个加密因子不要大于99934463 li_key[1]=92174566 li_key[2]=73874501 li_key[3]=40975566 li_key[4]=67450823 choose case encode case true//加密 for i=1 to t code[i]=mid(input,i,1) next for i=1 to t m=mod(i,4) if m=0 then m=4 codenum[i]=li_key[m] -asc(code[i]) codestr[i]=string(codenum[i],'00000000') next output="" for i=t to 1 step -1 output=output+ codestr[i] next for i=1 to t replace='' for m=1 to 4 if long(mid(codestr[i],m*2 -1,2))>=65 and long(mid(codestr[i],m*2 -1,2))<=90 then replace=replace+char(long(mid(codestr[i],m*2 -1,2))) else replace=replace+mid(codestr[i],m*2 -1,2) end if next codestr[i]=replace next output="" for i=t to 1 step -1 output=output+ codestr[i] next return output case false//解密 replace='' for i=1 to t if asc(mid(input,i,1))>=65 and asc(mid(input,i,1))<=90 then replace=replace+string(asc(mid(input,i,1))) else replace=replace+mid(input,i,1) end if next t=len(replace) t=t/8 for i=1 to t codestr[t -i+1]=mid(replace,(i -1)*8+1,8) next for i=1 to t m=mod(i,4) if m=0 then m=4 code[i]=char(li_key[m] -long(codestr[i])) next output="" for i=1 to t output=output+code[i] next return output end choose