信息安全概论分析.ppt

Main content Resolving theories Resolving theories Solution approach Solution approach Solution approach Solution approach Solution steps Solution steps The correct result The correct result The correct result The correct result The correct result Conclusion Thank you! * * L.O.G.O * * L.O.G.O 吴奇轩、郁鑫、张杰、大张琨、万华生 Information Security Overview 1213132009、1213132010、1213132011、1213132012、1213132013 Resolving theories Solution approach Solution steps Whats the problem? The cipher is 11,8,19,17,20,19,8,18,5,6,18,14,5,13,0,4,4,8,4,14,8,19,3,19. I should unlock cipher and get a word. In my opinion, I think that I need to start from the simple way to do it. However, I never solve this kind of question. So I find many reference methods. I can use ASCII, RSA, substitute, matrix. I need to take a lot of trying. How to resolve? 1 2 3 Hashing encryption algorithms substitution algorithms Matrix transposition algorithms A substitution cipher is one in which a letter is substituted by another letter or set of letters. The Matrix transposition algorithms about the rows of the matrix A is replaced by the corresponding column, to obtain a new matrix called a transposed matrix A. The Hashing encryption algorithms has a fixed length output when it accepts input message different lengths . The output of a fixed length called a ‘hash’ or ‘Message digest’. RSA?is one of the first practicable public-key cryptosystems??and is widely used for secure data transmission. TThe final method is the RSA. RSA Cryptography Public-key n = pq, with p and q both primes. ed = 1 (mod ?(n)). ?(n) = (p-1)(q-1). Private-key d = 1/e (mod (p-1)(q-1)). encryption C = (mod n) decryption M = (mod n) int RSA(int a,int n,int m){ int e,d,C=1,i=0,M,T=1; for(e=2;e(m+1)/2;e++){ if((m+1)%e==0){ d=(m+1)/e; for(i=0;id;i++){ C=C*a;} M=C%n; for(i=0;ie;i++){ T=T*M;} if(T%n==a){ if(M=26){ M=M%26;} return M;} else{ return -1;}}}} First step Third step Second step Steps Give the character subscr