就目前科技而言,现有之DES密码系统所使用之金钥长度过短.pptVIP

1- Multiplication by x Multiply b(x) with the polynomial x: b7x8+b6x7+b5x6+b4x5+b3x4+b2x3+b1x2+b0x If b7=0, the reduction is identity operation; if b7=1, m(x) must be subtracted (i.e. EXORed). That is, multiplication by x (‘02’) can be implemented by a left shift and a conditional EXOR with’1B’. Example ‘57’ ? ‘13’ =‘FE’ ‘57’ ?’02’=xtime(57)=‘AE’ ‘57’ ?’04’=xtime(AE)=‘47’ ‘57’ ?’08’=xtime(47)=‘8E’ ‘57’ ?’10’=xtime(8E)=‘07’ ‘57’ ? ‘13’ =‘57’?(‘01’?’02’?’10’) = ‘57’?’AE’?’07’=‘FE’ Polynomials with coefficients in GF(28) Two polynomials over GF(28): a(y)=a3y3+a2y2+a1y+a0 b(y)=b3y3+b2y2+b1y+b0 Their product c(y)=c6y6+c5y5+c4y4+c3y3+c2y2+c1y+c0 c0=a0 ? b0 c1=a1 ? b0 ? a0 ? b1 c2=a2 ? b0 ? a1 ? b1 ? a0 ? b2 c3=a3 ? b0 ? a2 ? b1 ? a1 ? b2+ ? a0 ? b3 c4=a3 ? b1 ? a2 ? b2 ? a1 ? b3 c5=a3 ? b2 ? a2 ? b3 c6=a3 ? b3 Polynomials with coefficients in GF(28) By reducing c(y) modulo a polynomial of degree 4, the result can be reduced to a polynomial of degree below 4. M(y)=y4+1 and yi mod y4+1=yi mod 4. Polynomials with coefficients in GF(28) Product of a( y ) and b( y ): d( y ) = a( y ) ? b( y )= d3y3+d2y2+d1y+d0 d0 = a0· b0 ? a3· b1 ? a2· b2 ? a1· b3 d1 = a1· b0 ? a0· b1 ? a3· b2 ? a2· b3 d2 = a2· b0 ? a1· b1 ? a0· b2 ? a3· b3 d3 = a3· b0 ? a2· b1 ? a1· b2 ? a0· b3 Polynomials with coefficients in GF(28) Polynomials with coefficients in GF(28) ABC KLM TUV DEF NOP WXY GH(I/J) QRS Z * * 就目前科技而言，現有之DES密碼系統所使用之金鑰長度過短(僅56位元)，其安全性已遭受質疑，為提高其安全性，便有了Triple-DES的構想。 隨著電腦技技的發展，可預見未來Triple-DES的加密演算法也勢必淘汰，有鑑於此，美國國家標準技術局(NIST)於1997年元月二日開始著手計劃公開徵求新一代加密標準(簡稱AES)。 一、傳統的加解密法：AES ? Advanced Encryption Standard (AES) AES為新一代NIST/FIPS的加密標準 ? NIST於1998年開始15個AES候選演算法之技術分析 ? 1999年選出五個候選演算法:MARS, RC6, Rijndael, Serpent, Twofish ? NIST於2000年選定Rijndael為新一代的加密標準 一、傳統的加解密法：AES