A Block Cipher using an Iterative Method involving a Permutation
|
|
- Ashlyn Daniels
- 6 years ago
- Views:
Transcription
1 Journal of Discrete Mathematical Sciences & Cryptography Vol. 18 (015), No. 3, pp DOI : / A Block Cipher using an Iterative Method involving a Permutation Lakshmi Bhavani Madhuri Susarla * SRM University Channai India S. Udaya Kumar MVSR Engineering, Nadergul Hyderabad India Abstract In this paper, we have developed a block cipher for a block of size 56 bits by using an iterative method involving a permutation. Here we have represented the plaintext as a matrix containing a pair of column vectors comprising binary bits. In the process of encryption, we have used a key matrix (K), which also consists of binary bits. For decryption, we have used the modular arithmetic inverse (K -1 ) of the key matrix K. In this, we have discussed the cryptanalysis, and have shown that the cipher cannot be broken by any cryptanalytic attack. Finally, the analysis of the cipher is extended to a block of size 11 bits. 1. Introduction In the development of cryptography, one of the earliest ciphers is Hill cipher [1]. In this, the key is taken in the form of a matrix, and the plaintext is taken in the form of a single column vector. The operation of the key matrix, on the column vector of the plaintext has resulted in the ciphertext when mod 6 is carried out. Following Hill, Feistel [-3] has made an attempt to develop a cipher, wherein both the key matrix and the plaintext vector contain binary bits, and mod operation is performed. However, he * susarla.lbmadhuri@gmail.com sudayakumar@mvsrec.edu.in
2 76 L. B. M. Susarla and S. U. Kumar has noticed that this cipher can be broken as it is quite similar to Hill cipher, which bears a linear relation between the plaintext and the ciphertext. In the present paper, our objective is to develop a block cipher, which cannot be broken by any cryptanalytic attack. In this, following Feistel, we have taken the key matrix and the plaintext matrix in terms of binary bits. Here, we have applied an iterative method, which involves repeatedly a permutation on the result obtained by the operation of the key matrix on the plaintext matrix. The iteration and the permutation relate the ciphertext C and the plaintext P through a set of nonlinear equations, which contain the elements of the key matrix K, the elements of the plaintext P, and mod. Thus in the present analysis, as the elements of the key matrix and the plaintext are thoroughly mixed several times, we have seen that the cipher cannot be broken by any cryptanalytic attack. In section of this paper, we have presented the development of the cipher. In section 3, we have designed algorithms for encryption, decryption and the modular arithmetic inverse of the key matrix, and have illustrated the cipher in section 4. Subsequently, we have discussed the cryptanalysis in section 5. In section 6, we have extended the cipher to a block of size 11 bits. Finally, we have shown the avalanche effect in section 7, and have drawn conclusions from the results obtained in this analysis in section 8..Development of the Cipher Let us consider a plaintext matrix P, given by P = [P ij ], i = 1 to n, j = 1 to, where the P ij are binary elements, i.e. either 0 or 1. Let K = [K ij ], i = 1 to n, and j = 1 to n, be an n x n matrix, in which all the K ij are binary elements. Let C = [C ij ], i = 1 to n, j = 1 to, be the corresponding ciphertext matrix. Let us denote the plaintext matrix P by P 0 (P P 0 ). On adopting an iterative method involving a permutation (which is explained below) on the product of the key matrix and the plaintext matrix, we can write the scheme of iteration for encryption as P r = [KP r-1 ] mod, for r =1 to m, (.1) where [ ] denotes the permutation, and m is the number of iterations. Thus we get P m. Then the ciphertext C is obtained as C = P m. (.) Let us now introduce the process of the permutation. Consider a matrix
3 A Block Cipher 77 x = [x ij ], i = 1 to n, j = 1 to. (.3) Let us assume that n is an even number. On permutation, [x ij ] assumes the form x x x n x x 11 1 x x ( 11 ) n1 x x n x 1 x 3 4 x ( 1 ) n (.4) Here it is to be noted that, on permutation, the first column of (x ij ) occupies the upper half of (.4), while the second column occupies the lower half of (.4). We have used this permutation in each of the iterations given by (.1). Let us now consider the process of decryption. The iterative procedure for the decryption is given by P r-1 = ]K -1 P r [ mod, i = m to 1, (.5) where ] [ denotes the reverse process of the permutation, and K -1 is the modular arithmetic inverse of K, satisfying the relations K -1 K mod = KK -1 mod = I. In the reverse process of the permutation, the matrix given by (.4) leads to the (x ij ) given by (.3). In this case any (y ij ) assumes the form y y y y y n y n y y y y yn y 11 (( n/ ) + 1) 1 1 (( n/ ) + 1) 1 (( n/ ) + ) (( n/ ) + ) ( / 1 ) 1 ( / ) n (.6)
4 78 L. B. M. Susarla and S. U. Kumar Here it is to be noted that on reverse permutation, the upper half of any (y ij ) occupies the first column of (.6), while the lower half occupies the second column of (.6). In what follows, we design algorithms for encryption, decryption and the modular arithmetic inverse of the key matrix K, denoted by K Algorithms 1.1 Algorithm for Encryption { 1. Read n, m, K and P 0. for r =1 to m { P r = [KP r-1 ] mod } 3. C = P m } 3. Algorithm for Decryption { 1. Read n, m, K and C. Find K -1 // K -1 is the modular arithmetic inverse of K with mod. 3. P m = C 4. for r = m to 1 { P r-1 = ]K -1 P r [ mod } 5. P = P 0 } 3.3 Algorithm for K -1 { 1. Let A = K. Find the determinant of A. Let it be denoted by.. Find the inverse of A. The inverse is given by A -1 = [ A ] ji i =1 to n, j = 1 to n, where A ij are the cofactors of a ij, which are elements of A, and is the determinant of A. 3. for i = 1 to n,
5 A Block Cipher 79 { if ((i ) mod N = 1) d = i; break; } 4. B = [da ji ] mod N. // B is the modular arithmetic inverse of A. } Here it is to be noted that the modular arithmetic inverse [4] of a matrix A exists only when A is non-singular, and is relatively prime to N. In the present analysis, we take N =, and obtain the modular arithmetic inverse of K such that KK -1 mod = K -1 K mod = I. 4. Illustration of the Cipher Let us take a key K 0 in the form K 0 = [65, 71, 95, 11, 48, 31, 99, 81, 1, 119, 3, 41, 37, 11, 114, 67, 87, 105, 117, 115, 17, 31, 118, 116, 14, 113, 98, 35]. (4.1) This consists of 8 numbers. We arrange these numbers in the form of a 14 matrix, wherein the first row contains the first two numbers (65 and 71), the second row contains the next two numbers (95 and 11), and so on. Then on converting each number into its binary form, consisting of seven bits, we get a matrix given by Q = (4.)
6 80 L. B. M. Susarla and S. U. Kumar Then the key matrix K can be written in the form Q R K = Y Z, (4.3) where R is obtained by interchanging the first and the last rows of Q, the second and last but one rows of Q, and so on. The matrix Y is obtained by making the last column of Q as the first row of Y, the last but one column of Q as the second row of Y, and so on. Here Z = Q T, where T denotes the transpose of the matrix. Thus we have K = (4.4) Consider the plaintext: Start the war as soon as the battalion arrives. (4.5) Let us focus our attention on the first eight characters, namely, Start /b th. Then on using the ASCII code, the plaintext - Start /b th, under consideration can be written as the matrix P 0 given by
7 A Block Cipher (4.6) On using the encryption algorithm (see section 3.1), and taking m = 8, i.e. carrying out twenty-eight iterations, together with the permutation, we get the corresponding ciphertext in the form (4.7) On using the algorithm for the modular arithmetic inverse, described in section 3.3, we obtain T T K -1 = (4.8) Here, the determinant of K denoted by = This is relatively prime to. From (4.4) and (4.8), it can be readily seen that KK -1 mod = K -1 K mod = I.
8 8 L. B. M. Susarla and S. U. Kumar On using the K -1 given in (4.8), and the ciphertext given in (4.7), we apply the decryption algorithm, described in section 3., and obtain the plaintext - Start /b th. 5. Cryptanalysis In developing the cipher, we have taken a key K 0, given by (4.1), containing 8 numbers. On using this key we have formed Q, with the help of which we have generated the key matrix K. Thus, the key space for the key under consideration is 196 (since Q is of size 14 14). As 196 ( 10 ) , the cipher cannot be broken by brute force attack. Now let us consider the known plaintext attack. Here we have as many plaintext-ciphertext pairs as we require. From the equation (.1), we get P 1 = [KP 0 ] mod. (5.1) P = [KP 1 ] mod = [K [KP 0 ] mod ] mod = [K [KP 0 ] ] mod. (5.) Similarly, we obtain P 3 = [KP ] mod = [K [K [KP 0 ] ] ] mod. (5.3) P m = [K [K [... [KP 0 ]... ] ] ] mod. (5.4) From (.) and (5.4), we obtain C = P m = [K [K [... [KP 0 ]... ] ] ] mod. (5.5) When m = 1, i.e. when there is only one iteration, equation (5.5) reduces to the form This equation can be rewritten as C = [KP 0 ] mod. (5.6) ]C[ = KP 0 mod, (5.7) As equation (5.7) is a linear equation, the cipher can be broken by the known plaintext attack by adopting the same procedure applied in the case of Hill cipher.
9 A Block Cipher 83 In the absence of the permutation, i.e. only when iterations are present, equation (5.5) reduces to the form This equation can be written as C = K m P 0 mod. (5.8) C = L P 0 mod. (5.9) As (5.9) is similar to that of Hill cipher, in this case also, the cipher can be broken by the known plaintext attack. Now, let us consider the case m =. C = [K [KP 0 ]] mod. (5.10) The right hand side of this equation can be written as follows. Here K1j Pj1 K1j Pj K j Pj1 K j Pj Knj Pj1 Knj P j (5.11) where the repeated subscript j indicates the summation of all the n - terms arising due to different values of j. For example, K1jPj1 = K1j Pj1. Now in view of the permutation given by (.4), we get n j= 1 K P K P K P K P [KP 0 K( n 1) jpj1 KnjPj1 ] = K P K P 1j j1 j j1 3j j1 4 j j1 K3 jp K P K P K P 1j j j j j j j ( n 1) j j nj j (5.1)
10 84 L. B. M. Susarla and S. U. Kumar Let us rewrite the above equation as Thus we have [KP 0 ] = S S Sn S 11 1 S 1 S 1 n (5.13) K S K S K S K S [K[KP 0 K( ) S K S ]] = K S K S 1j j1 j j1 3j j1 4 j j1 n 1 j j1 nj j1 K3 js K S K S K S 1j j j j j j j ( n 1) j j nj j (5.14) Then from (5.10) and (5.14), we have K S K S K S K S K( ) S K S C = K S K S 1j j1 j j1 3j j1 4 j j1 n 1 j j1 nj j1 K3 js K S K S K S 1j j j j j j j ( n 1) j j nj j (5.15) From the equation (5.11), it is obvious that KP 0 can be decomposed into K and P 0. On the other hand, from the equation (5.1), we find that [KP 0 ] cannot be written explicitly in terms of K and P 0 as the elements of K and P 0 are thoroughly mixed by the permutation. From the equations (5.1) to (5.15), when m =, and n = 4, we get eight equations connecting the elements of C and P 0, and involving mod (see equation (7) of appendix). In these equations, each coefficient of the elements of P 0 is a quadratic expression containing the elements of K. From the analysis given at the end of the appendix, we have obtained sixty-four nonlinear equations containing the elements of K. In a similar manner,
11 A Block Cipher 85 finally, on considering the m-th iteration, we get n equations connecting the C and P 0. In these equations, each coefficient of the elements of P 0 is an m-th degree expression involving the elements of K. In the illustration of the cipher given in section 4, we have n = 8. Thus we get fifty six equations given by C = DP 0 mod, (5.16) wherein D is a matrix of size Thus by adopting the same procedure described in the appendix, we get 3136 nonlinear equations of degree 8 in terms of the elements of the key matrix K. As these equations do not lead to a solution, the cipher cannot be broken by the known plaintext attack. 6. Modification of the cipher for a larger block size In section 4, we have taken the block size as fifty-six binary bits. As this is a small one, let us now consider a block of size 11 bits. Let the plaintext under consideration be Start /b th. (6.1) The modifications in the process of the encryption and the process of the decryption are represented by the schematic diagrams shown in Fig.1 and Fig. respectively. In Fig.1, we have taken a block of 11 bits, corresponding to the plaintext under consideration, as input. This is represented as W and is divided into two halves. The left W is encrypted by using the procedure described in section 3.1. The same procedure is used for the right W also. Then the resulting ciphertexts of the left W and the right W are interlaced as follows. The first bit of the right W is placed next to the first bit of the left W, the second bit of the right W is placed next to the second bit of the left W, and this process is continued until all the bits in both the Ws are exhausted. Thus we get 11 bits. The above iterative process is performed sixteen times. We now get ultimately a ciphertext of 11 bits. On adopting the above procedure on the plaintext - Start /b the /b war /b as, after performing sixteen iterations, we get the ciphertext given by
12 86 L. B. M. Susarla and S. U. Kumar Figure 1 Process of Encryption for 11 bits Plaintext (6.) In the process of decryption (see Fig.) the ciphertext of 11 bits is supplied as input, and is represented as W. Here the W bits are decomposed into two halves (left W and right W) as follows. We place the first bit of the W as the first bit in the left W, the second bit of the W as the first bit in the right W, the third bit of the W as the second bit in the left W, the fourth bit of the W as the second bit in the right W, and so on. This iteration process is carried out for sixteen times. Thus we get back the plaintext of 11 bits. T 7. Avalanche Effect Consider the plaintext - Start /b the /b war /b as. Let us now change the first character S by T. This changes the plaintext by one bit. We now use the key matrix given by (4.4), and apply the encryption procedure described in section 3. Thus we obtain the corresponding ciphertext given by
13 A Block Cipher 87 Figure Process of Decryption for 11 bits Ciphertext (6.1) On comparing the ciphertexts given by (4.7) and (6.1), we notice that they differ in fifty-nine (59) bits. This shows that the algorithm exhibits a strong avalanche effect. Now, let us change the key by one bit i.e. by replacing 48 by 50 in the key given by (4.1). The key now assumes the form [65, 71, 95, 11, 50, 31, 99, 81, 1, 119, 3, 41, 37, 11, 114, 67, 87, 105, 117, 115, 17, 31, 118, 116, 14, 113, 98, 35]. (6.) Here, the ciphertext corresponding to the plaintext - Start /b the /b war /b as, is given by T (6.3) T
14 88 L. B. M. Susarla and S. U. Kumar From (4.7) and (6.3) we find that they differ in sixty-one (61) bits. This once again shows that the algorithm has a pronounced avalanche effect. 8. Computational Experiments and Conclusions In this paper, we have developed a block cipher for a block of size 56 bits and extended the analysis to a block of size 11 bits. In this, we have taken a secret key K 0 containing twenty-eight numbers, wherein each number can be represented in the form of seven binary bits. On using this key we have formed a matrix of size 8 8, which is called as key matrix. Here, we have implemented the encryption and the decryption algorithms in C language. The results obtained in this analysis are presented in Fig. 3. Plaintext: Start the war as soon as the battalion arrives. Ciphertext: T Figure 3 Plaintext and Ciphertext pair As the process of the permutation has led to a thorough mixing of the key and the plaintext, we conclude that the cipher is a very strong one and it cannot be broken by any cryptanalytic attack.
15 A Block Cipher 89 Appendix For simplicity, let us take n = 4, and focus our attention on the second iteration (m = ). Let the key matrix under consideration be K = K ij, i = 1 to 4, j = 1 to 4. Then KP 0 = K K K K K K K K K K K K K K K K P11 P1 P1 P. (1) P P 31 3 P41 P4 Performing permutation on the resultant of KP 0, we get where [KP 0 ] = X X X X X 11 1 X 1 X 31 3 X 41 4, () X11 = K11 P11 + K1 P1 + K13 P31 + K14 P41 X1 = K1 P11 + K P1 + K3 P31 + K4 P41 X1 = K31 P11 + K3 P1 + K33 P31 + K34 P 41 X = K41 P11 + K4 P1 + K43 P31 + K44 P41 X31 = K11 P1 + K1 P + K13 P3 + K14 P4 X3 = K1 P1 + K P + K3 P3 + K4 P 4 X41 = K31 P1 + K3 P + K33 P3 + K34 P4 X4 = K41 P 1 + K4 P + K43 P3 + K44 P4 (3) Then we get where [K [KP 0 ]] = S S S S S S S S (4)
16 90 L. B. M. Susarla and S. U. Kumar S11 = K11 X11 + K1 X1 + K13 X31 + K14 X 41 S1 = K1 X11 + K X 1 + K3 X31 + K4 X41 S1 = K31 X11 + K3 X1 + K33 X31 + K34 X 41 S = K41 X11 + K4 X1 + K43 X31 + K44 X 41 S31 = K11 X1 + K1 X + K13 X3 + K14 X 4 S3 = K1 X1 + K X + K3 X3 + K4 X 4 S41 = K31 X1 + K3 X + K33 X3 + K34 X 4 S4 = K41 X 1 + K4 X + K43 X3 + K44 X4 In view of the equations (5.) and (5.5), as m =, we have (5) From the equations (3) to (6), we get C ij = S ij, i = 1 to 4, j = 1 to 4. (6) C C C C C C C C where D11 D1 D13 D14 D15 D16 D17 D18 D1 D D3 D4 D5 D6 D7 D8 D31 D3 D33 D34 D35 D 36 D 37 D = D D D D D D D D D51 D5 D53 D54 D55 D56 D57 D 58 D 61 D 6 D 63 D 64 D 65 D 66 D 67 D 68 D 71 D7 D73 D74 D75 D76 D77 D 78 D81 D8 D83 D 84 D 85 D 86 D 87 D 88 P11 P1 P 1 P P 31 P3 P 41 P 4 mod. (7)
17 A Block Cipher 91 D = ( K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K31 D16 = ( K13 K1 + K14 K D17 = ( K13 + K14 K33 D18 = ( K1 3 K14 + K14 K34 D = ( K K + K K D = ( K K + K K D3 = ( K1 K13 + K K33 D4 = ( K1 K14 + K K3 4 D = ( K K + K K D = ( K K + K K D7 = ( K13 K3 + K4 K33 D8 = ( K3 K14 + K4 K34 D31 = ( K11 K31 + K3 K31 D3 = ( K31 K1 + K3 D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K K34 D41 = ( K41 + K4 K31 D4 = ( K41 K4 + K3 K4 D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K K K D = ( K K + K K = ( D5 = K11 K + K1 K4 D K K K K ( D53 = ( K11 K3 + K1 K43 D5 4 = ( K11 K4 + K1 K44 D55 = ( K13 K1 + K14 K41 D56 = ( K 13 K + K 14 K 4 D = ( K K + K K D = ( K K + K K D = ( K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K 3 K 1 + K 4 K 41 D 66 = ( K 3 K + K 4 K 4 65 D K K 67 = ( K43 D68 = K3 K4 + K4 K44 ( D71 = ( K1 K31 + K3 K41 D7 = ( K31 K + K3 K1 D73 = ( K31 K3 + K3 K43 D74 = ( K 31 K 4 + K 3 K 44 D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K D = ( K K + K K D = ( K K + K K D = ( K K + K K D = ( K K + K K ) D = ( K K + K K D = ( K K + K ) (8)
18 9 L. B. M. Susarla and S. U. Kumar On using seven more pairs of plaintext and ciphertext, we can form an equation of the form Y = DX mod, (9) where X contains all the eight columns of the plaintext and Y contains all the eight columns of the ciphertext. On obtaining the modular arithmetic inverse of X and operating on both sides of the equation (9), we get D = X -1 Y mod. (10) It is to be noted that each one of the elements of D is either 0 or 1. Thus we get, sixty-four equations of the form D ij = e, i = 1 to 8, j = 1 to 8, (11) where e = 1 in some of the equations and 0 in the remaining (as obtained from the equation (9)). In these equations, the unknowns are K ij, i = 1 to 4, j = 1 to 4, which are sixteen in number. Here, we have sixty-four nonlinear equations containing sixteen unknowns. It is possible to solve these equations by trial and error, substituting 1 or 0 for each variable; but it is impossible to find a unique solution for K ij as we have a nonlinear system of equations. References [1] William Stallings, Cryptography and Network Security: Principles and Practices, Third edition, Chapter, pp.37. [] Feistel, H. Cryptography and Computer Privacy, Scientific American, vol. 8, No. 5, pp.15-3, [3] Feistel, H., Notz. W., and Smith, J. Some Cryptographic Techniques for Machine-to-Machine Data Communications, Proceedings of the IEEE, vol. 63, No. 11, pp , Nov [4] V. U. K. Sastry, V. Janaki, On the Modular Arithmetic Inverse in the Cryptology of Hill Cipher, Proceedings of North American Technology and Business Conference, September 005, Montreal, Canada. Received August, 01
19 Copyright of Journal of Discrete Mathematical Sciences & Cryptography is the property of Taylor & Francis Ltd and its content may not be copied or ed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or articles for individual use.
A Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix
A Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix S. Udaya Kumar V. U. K. Sastry A. Vinaya babu Abstract In this paper, we have developed a block cipher
More informationModified Hill Cipher with Interlacing and Iteration
Journal of Computer Science 3 (11): 854-859, 2007 ISSN 1549-3636 2007 Science Publications Modified Hill Cipher with Interlacing and Iteration 1 V.U.K. Sastry and 2 N. Ravi Shankar 1 Department of R and
More informationModified Hill Cipher for a Large Block of Plaintext with Interlacing and Iteration
Journal of Computer Science 4 (1): 15-20, 2008 ISSN 1549-3636 2008 Science Publications Modified Hill Cipher for a Large Block of Plaintext with Interlacing and Iteration V.U.K. Sastry and N. Ravi Shankar
More informationA Large Block Cipher Involving Key Dependent Permutation, Interlacing and Iteration
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, No 3 Sofia 2013 Print ISSN: 1311-02; Online ISSN: 1314-4081 DOI: 10.2478/cait-2013-0025 A Large Block Cipher Involving
More informationCHAPTER 12 CRYPTOGRAPHY OF A GRAY LEVEL IMAGE USING A MODIFIED HILL CIPHER
177 CHAPTER 12 CRYPTOGRAPHY OF A GRAY LEVEL IMAGE USING A MODIFIED HILL CIPHER 178 12.1 Introduction The study of cryptography of gray level images [110, 112, 118] by using block ciphers has gained considerable
More informationCHAPTER 5 A BLOCK CIPHER INVOLVING A KEY APPLIED ON BOTH THE SIDES OF THE PLAINTEXT
82 CHAPTER 5 A BLOCK CIPHER INVOLVING A KEY APPLIED ON BOTH THE SIDES OF THE PLAINTEXT 83 5.1 Introduction In a pioneering paper, Hill [5] developed a block cipher by using the modular arithmetic inverse
More informationK Anup Kumar et al,int.j.comp.tech.appl,vol 3 (1), 23-31
K Anup Kumar et al,int.j.comp.tech.appl,vol 3 (1), 23-31 A Modified Feistel Cipher involving a key as a multiplicant on both the sides of the Plaintext matrix and supplemented with Mixing Permutation and
More informationV.U.K. Sastry et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (1), 2012,
VUK Sastry et al, / (IJCSIT) International Journal of Computer Science Information Technologies, Vol 3 (1), 2012, 3119-3128 A Modified Feistel Cipher involving a pair of key matrices,supplemented with
More informationCHAPTER 10 A GENERALIZED PLAYFAIR CIPHER INVOLVING INTERTWINING, INTERWEAVING AND ITERATION
151 CHAPTE 10 A GENEALIZED PLAYFAI CIPHE INVOLVING INTETWINING, INTEWEAVING AND ITEATION 152 10.1. INTODUCTION The Playfair cipher, which enjoyed its prominence during the Second World War, encrypts data
More informationModule 2 Advanced Symmetric Ciphers
Module 2 Advanced Symmetric Ciphers Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University E-mail: natarajan.meghanathan@jsums.edu Data Encryption Standard (DES) The DES algorithm
More informationLecture 12: Block ciphers
Lecture 12: Block ciphers Thomas Johansson T. Johansson (Lund University) 1 / 19 Block ciphers A block cipher encrypts a block of plaintext bits x to a block of ciphertext bits y. The transformation is
More informationClassical Cryptography
Classical Cryptography CSG 252 Fall 2006 Riccardo Pucella Goals of Cryptography Alice wants to send message X to Bob Oscar is on the wire, listening to communications Alice and Bob share a key K Alice
More informationPublic Key Cryptography
Public Key Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics 2011 What is Cryptography? cryptography: study of methods for sending messages in a form that only be understood
More informationIntroduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements 2 nd vs. 1 st edition of textbook HW1 due Tuesday 2/9 Readings/quizzes (on Canvas) due Friday 2/12 Agenda Last time Historical ciphers and their cryptanalysis
More informationComputers and Mathematics with Applications
Computers and Mathematics with Applications 61 (2011) 1261 1265 Contents lists available at ScienceDirect Computers and Mathematics with Applications journal homepage: wwwelseviercom/locate/camwa Cryptanalysis
More informationJay Daigle Occidental College Math 401: Cryptology
3 Block Ciphers Every encryption method we ve studied so far has been a substitution cipher: that is, each letter is replaced by exactly one other letter. In fact, we ve studied stream ciphers, which produce
More informationThe Artin-Feistel Symmetric Cipher
The Artin-Feistel Symmetric Cipher May 23, 2012 I. Anshel, D. Goldfeld. Introduction. The Feistel cipher and the Braid Group The main aim of this paper is to introduce a new symmetric cipher, which we
More informationCryptography Lecture 4 Block ciphers, DES, breaking DES
Cryptography Lecture 4 Block ciphers, DES, breaking DES Breaking a cipher Eavesdropper recieves n cryptograms created from n plaintexts in sequence, using the same key Redundancy exists in the messages
More informationCryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 08 Shannon s Theory (Contd.)
More informationCPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems
CPE 776:DATA SECURITY & CRYPTOGRAPHY Some Number Theory and Classical Crypto Systems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Some Number Theory
More informationIntroduction on Block cipher Yoyo Game Application on AES Conclusion. Yoyo Game with AES. Navid Ghaedi Bardeh. University of Bergen.
Yoyo Game with AES Navid Ghaedi Bardeh University of Bergen May 8, 2018 1 / 33 Outline 1 Introduction on Block cipher 2 Yoyo Game 3 Application on AES 4 Conclusion 2 / 33 Classical Model of Symmetric Cryptography
More informationFinal Exam Math 105: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 30 April :30 11:00 a.m.
Final Exam Math 10: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 0 April 2002 :0 11:00 a.m. Instructions: Please be as neat as possible (use a pencil), and show
More informationAPPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION
APPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION Phaneendra HD, Vidya Raj C, Dr MS Shivakumar Assistant Professor, Department of Computer Science and Engineering, The National
More information3-6 On Multi Rounds Elimination Method for Higher Order Differential Cryptanalysis
3-6 On Multi Rounds Elimination Method for Higher Order Differential Cryptanalysis TANAKA Hidema, TONOMURA Yuji, and KANEKO Toshinobu A multi rounds elimination method for higher order differential cryptanalysis
More informationChapter 2 Classical Cryptosystems
Chapter 2 Classical Cryptosystems Note We will use the convention that plaintext will be lowercase and ciphertext will be in all capitals. 2.1 Shift Ciphers The idea of the Caesar cipher: To encrypt, shift
More informationAN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY
! """#$# AN ENHANCED CRYPTOGRAPHIC SUBSTITUTION METHOD FOR INFORMATION SECURITY *Kallam Ravindra Babu 1, Dr. S. Udaya Kumar 2, Dr. A. Vinaya Babu 3 and Dr. M. Thirupathi Reddy 4 1 Research Scholar (JNTUH),
More informationAll-Or-Nothing Transforms Using Quasigroups
All-Or-Nothing Transforms Using Quasigroups Stelios I Marnas, Lefteris Angelis, and George L Bleris Department of Informatics, Aristotle University 54124 Thessaloniki, Greece Email: {marnas,lef,bleris}@csdauthgr
More informationBlock Cipher Cryptanalysis: An Overview
0/52 Block Cipher Cryptanalysis: An Overview Subhabrata Samajder Indian Statistical Institute, Kolkata 17 th May, 2017 0/52 Outline Iterated Block Cipher 1 Iterated Block Cipher 2 S-Boxes 3 A Basic Substitution
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-27 Recap ADFGX Cipher Block Cipher Modes of Operation Hill Cipher Inverting a Matrix (mod n) Encryption: Hill Cipher Example Multiple
More informationAkelarre. Akelarre 1
Akelarre Akelarre 1 Akelarre Block cipher Combines features of 2 strong ciphers o IDEA mixed mode arithmetic o RC5 keyed rotations Goal is a more efficient strong cipher Proposed in 1996, broken within
More informationCS 4770: Cryptography. CS 6750: Cryptography and Communication Security. Alina Oprea Associate Professor, CCIS Northeastern University
CS 4770: Cryptography CS 6750: Cryptography and Communication Security Alina Oprea Associate Professor, CCIS Northeastern University February 5 2018 Review Relation between PRF and PRG Construct PRF from
More informationEfficient Cryptanalysis of Homophonic Substitution Ciphers
Efficient Cryptanalysis of Homophonic Substitution Ciphers Amrapali Dhavare Richard M. Low Mark Stamp Abstract Substitution ciphers are among the earliest methods of encryption. Examples of classic substitution
More informationBreaking an encryption scheme based on chaotic Baker map
Breaking an encryption scheme based on chaotic Baker map Gonzalo Alvarez a, and Shujun Li b a Instituto de Física Aplicada, Consejo Superior de Investigaciones Científicas, Serrano 144 28006 Madrid, Spain
More informationDifferential Attack on Five Rounds of the SC2000 Block Cipher
Differential Attack on Five Rounds of the SC2 Block Cipher Jiqiang Lu Department of Mathematics and Computer Science, Eindhoven University of Technology, 56 MB Eindhoven, The Netherlands lvjiqiang@hotmail.com
More informationMATH3302 Cryptography Problem Set 2
MATH3302 Cryptography Problem Set 2 These questions are based on the material in Section 4: Shannon s Theory, Section 5: Modern Cryptography, Section 6: The Data Encryption Standard, Section 7: International
More informationWilliam Stallings Copyright 2010
A PPENDIX E B ASIC C ONCEPTS FROM L INEAR A LGEBRA William Stallings Copyright 2010 E.1 OPERATIONS ON VECTORS AND MATRICES...2 Arithmetic...2 Determinants...4 Inverse of a Matrix...5 E.2 LINEAR ALGEBRA
More informationWinter 2008 Introduction to Modern Cryptography Benny Chor and Rani Hod. Assignment #2
0368.3049.01 Winter 2008 Introduction to Modern Cryptography Benny Chor and Rani Hod Assignment #2 Published Sunday, February 17, 2008 and very slightly revised Feb. 18. Due Tues., March 4, in Rani Hod
More information5. Classical Cryptographic Techniques from modular arithmetic perspective
. Classical Cryptographic Techniques from modular arithmetic perspective By classical cryptography we mean methods of encipherment that have been used from antiquity through the middle of the twentieth
More informationAn average case analysis of a dierential attack. on a class of SP-networks. Distributed Systems Technology Centre, and
An average case analysis of a dierential attack on a class of SP-networks Luke O'Connor Distributed Systems Technology Centre, and Information Security Research Center, QUT Brisbane, Australia Abstract
More informationSol: First, calculate the number of integers which are relative prime with = (1 1 7 ) (1 1 3 ) = = 2268
ò{çd@àt ø 2005.0.3. Suppose the plaintext alphabets include a z, A Z, 0 9, and the space character, therefore, we work on 63 instead of 26 for an affine cipher. How many keys are possible? What if we add
More informationElliptic Curve Cryptography
Elliptic Curve Cryptography Elliptic Curves An elliptic curve is a cubic equation of the form: y + axy + by = x 3 + cx + dx + e where a, b, c, d and e are real numbers. A special addition operation is
More informationSymmetric Cryptanalytic Techniques. Sean Murphy ショーン マーフィー Royal Holloway
Symmetric Cryptanalytic Techniques Sean Murphy ショーン マーフィー Royal Holloway Block Ciphers Encrypt blocks of data using a key Iterative process ( rounds ) Modified by Modes of Operation Data Encryption Standard
More informationCryptanalysis of Patarin s 2-Round Public Key System with S Boxes (2R)
Cryptanalysis of Patarin s 2-Round Public Key System with S Boxes (2R) Eli Biham Computer Science Department Technion Israel Institute of Technology Haifa 32000, Israel biham@cs.technion.ac.il http://www.cs.technion.ac.il/~biham/
More informationCryptanalysis of a computer cryptography scheme based on a filter bank
NOTICE: This is the author s version of a work that was accepted by Chaos, Solitons & Fractals in August 2007. Changes resulting from the publishing process, such as peer review, editing, corrections,
More informationCryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000
Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000 Amr Youssef 1 and Guang Gong 2 1 Center for Applied Cryptographic Research Department of Combinatorics & Optimization 2 Department of Electrical
More informationLattice Reduction Attack on the Knapsack
Lattice Reduction Attack on the Knapsack Mark Stamp 1 Merkle Hellman Knapsack Every private in the French army carries a Field Marshal wand in his knapsack. Napoleon Bonaparte The Merkle Hellman knapsack
More informationAnalysis of the RSA Encryption Algorithm
Analysis of the RSA Encryption Algorithm Betty Huang June 16, 2010 Abstract The RSA encryption algorithm is commonly used in public security due to the asymmetric nature of the cipher. The procedure is
More informationThe Hill Cipher A Linear Algebra Perspective
The Hill Cipher A Linear Algebra Perspective Contents 1 Introduction to Classical Cryptography 3 1.1 Alice, Bob & Eve................................. 3 1.2 Types of Attacks.................................
More informationLinear Approximations for 2-round Trivium
Linear Approximations for 2-round Trivium Meltem Sönmez Turan 1, Orhun Kara 2 1 Institute of Applied Mathematics, Middle East Technical University Ankara, Turkey msonmez@metu.edu.tr 2 TUBITAK-UEKAE, Gebze,
More informationAnalysis of SHA-1 in Encryption Mode
Analysis of SHA- in Encryption Mode [Published in D. Naccache, Ed., Topics in Cryptology CT-RSA 00, vol. 00 of Lecture Notes in Computer Science, pp. 70 83, Springer-Verlag, 00.] Helena Handschuh, Lars
More informationA Five-Round Algebraic Property of the Advanced Encryption Standard
A Five-Round Algebraic Property of the Advanced Encryption Standard Jianyong Huang, Jennifer Seberry and Willy Susilo Centre for Computer and Information Security Research (CCI) School of Computer Science
More informationLecture 4: DES and block ciphers
Lecture 4: DES and block ciphers Johan Håstad, transcribed by Ernir Erlingsson 2006-01-25 1 DES DES is a 64 bit block cipher with a 56 bit key. It selects a 64 bit block and modifies it depending on the
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Appendix A: Symmetric Techniques Block Ciphers A block cipher f of block-size
More informationBlock ciphers. Block ciphers. Data Encryption Standard (DES) DES: encryption circuit
Block ciphers Block ciphers Myrto Arapinis School o Inormatics University o Edinburgh January 22, 2015 A block cipher with parameters k and l is a pair o deterministic algorithms (E, D) such that Encryption
More informationTruncated differential cryptanalysis of five rounds of Salsa20
Truncated differential cryptanalysis of five rounds of Salsa20 Paul Crowley 17th October 2005 Abstract We present an attack on Salsa20 reduced to five of its twenty rounds. This attack uses many clusters
More informationOutline. 1 Arithmetic on Bytes and 4-Byte Vectors. 2 The Rijndael Algorithm. 3 AES Key Schedule and Decryption. 4 Strengths and Weaknesses of Rijndael
Outline CPSC 418/MATH 318 Introduction to Cryptography Advanced Encryption Standard Renate Scheidler Department of Mathematics & Statistics Department of Computer Science University of Calgary Based in
More informationCook-Levin Theorem. SAT is NP-complete
Cook-Levin Theorem SAT is NP-complete In other words SAT NP A NP A P SAT 1 Consider any A NP NTM N that decides A in polytime n k For any input w Σ * valid tableau of configurations 2 Properties of an
More informationImplementation of the RSA algorithm and its cryptanalysis. Abstract. Introduction
Implementation of the RSA algorithm and its cryptanalysis Chandra M. Kota and Cherif Aissi 1 University of Louisiana at Lafayette, College of Engineering Lafayette, LA 70504, USA Abstract Session IVB4
More informationOptimal XOR based (2,n)-Visual Cryptography Schemes
Optimal XOR based (2,n)-Visual Cryptography Schemes Feng Liu and ChuanKun Wu State Key Laboratory Of Information Security, Institute of Software Chinese Academy of Sciences, Beijing 0090, China Email:
More informationImproved Cascaded Stream Ciphers Using Feedback
Improved Cascaded Stream Ciphers Using Feedback Lu Xiao 1, Stafford Tavares 1, Amr Youssef 2, and Guang Gong 3 1 Department of Electrical and Computer Engineering, Queen s University, {xiaolu, tavares}@ee.queensu.ca
More informationShift Cipher. For 0 i 25, the ith plaintext character is. E.g. k = 3
Shift Cipher For 0 i 25, the ith plaintext character is shifted by some value 0 k 25 (mod 26). E.g. k = 3 a b c d e f g h i j k l m n o p q r s t u v w x y z D E F G H I J K L M N O P Q R S T U V W X Y
More informationCryptography. pieces from work by Gordon Royle
Cryptography pieces from work by Gordon Royle The set-up Cryptography is the mathematics of devising secure communication systems, whereas cryptanalysis is the mathematics of breaking such systems. We
More informationExercise Sheet Cryptography 1, 2011
Cryptography 1 http://www.cs.ut.ee/~unruh/crypto1-11/ Exercise Sheet Cryptography 1, 2011 Exercise 1 DES The Data Encryption Standard (DES) is a very famous and widely used block cipher. It maps 64-bit
More informationTHE UNIVERSITY OF CALGARY FACULTY OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS & STATISTICS MIDTERM EXAMINATION 1 FALL 2018
THE UNIVERSITY OF CALGARY FACULTY OF SCIENCE DEPARTMENT OF COMPUTER SCIENCE DEPARTMENT OF MATHEMATICS & STATISTICS MIDTERM EXAMINATION 1 FALL 2018 CPSC 418/MATH 318 L01 October 17, 2018 Time: 50 minutes
More informationCryptography. P. Danziger. Transmit...Bob...
10.4 Cryptography P. Danziger 1 Cipher Schemes A cryptographic scheme is an example of a code. The special requirement is that the encoded message be difficult to retrieve without some special piece of
More informationCryptography. Lecture 2: Perfect Secrecy and its Limitations. Gil Segev
Cryptography Lecture 2: Perfect Secrecy and its Limitations Gil Segev Last Week Symmetric-key encryption (KeyGen, Enc, Dec) Historical ciphers that are completely broken The basic principles of modern
More informationSubstitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis
J. Cryptology (1996) 9: 1 19 1996 International Association for Cryptologic Research Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis Howard M. Heys and Stafford E.
More informationCOMM1003. Information Theory. Dr. Wassim Alexan Spring Lecture 5
COMM1003 Information Theory Dr. Wassim Alexan Spring 2018 Lecture 5 The Baconian Cipher A mono alphabetic cipher invented by Sir Francis Bacon In this cipher, each letter is replaced by a sequence of five
More informationAPPLICATION OF LAPLACE - MELLIN TRANSFORM FOR CRYPTOGRAPHY
APPLICATION OF LAPLACE - MELLIN TRANSFORM FOR CRYPTOGRAPHY *Mampi Saha ABSTRACT Every living thing needs protection. In India, we are facing various types of crimes. Among which, cyber crime is becoming
More informationHow Fast can be Algebraic Attacks on Block Ciphers?
How Fast can be Algebraic Attacks on Block Ciphers? Nicolas T. Courtois Axalto mart Cards, 36-38 rue de la Princesse BP 45, 78430 Louveciennes Cedex, France http://www.nicolascourtois.net courtois@minrank.org
More informationAN INTRODUCTION TO THE UNDERLYING COMPUTATIONAL PROBLEM OF THE ELGAMAL CRYPTOSYSTEM
AN INTRODUCTION TO THE UNDERLYING COMPUTATIONAL PROBLEM OF THE ELGAMAL CRYPTOSYSTEM VORA,VRUSHANK APPRENTICE PROGRAM Abstract. This paper will analyze the strengths and weaknesses of the underlying computational
More informationFast Cryptanalysis of the Matsumoto-Imai Public Key Scheme
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. Desmedt Katholieke Universiteit Leuven, Laboratorium
More informationTowards Provable Security of Substitution-Permutation Encryption Networks
Towards Provable Security of Substitution-Permutation Encryption Networks Zhi-Guo Chen and Stafford E. Tavares Department of Electrical and Computer Engineering Queen s University at Kingston, Ontario,
More informationThe Code d'azur and Phoenix Ciphers- A Note on a New Class of Block Ciphers Based on Matrix Transposition
COMPUTING SCIENCE The Code d'azur and Phoenix CiphersA Note on a New Class of Block Ciphers Based on Matrix Transposition P. Y. A. Ryan TECHNICAL REPORT SERIES No. CS-TR-1072 February, 2008 TECHNICAL REPORT
More information7 Cryptanalysis. 7.1 Structural Attacks CA642: CRYPTOGRAPHY AND NUMBER THEORY 1
CA642: CRYPTOGRAPHY AND NUMBER THEORY 1 7 Cryptanalysis Cryptanalysis Attacks such as exhaustive key-search do not exploit any properties of the encryption algorithm or implementation. Structural attacks
More informationAPPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION
APPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION Phaneendra H.D., Vidya Raj C., Dr. M.S. Shivaloimar Assistant Professor, Department of Computer Science and Engineering,
More informationInnovation and Cryptoventures. Cryptology. Campbell R. Harvey. Duke University, NBER and Investment Strategy Advisor, Man Group, plc.
Innovation and Cryptoventures Cryptology Campbell R. Harvey Duke University, NBER and Investment Strategy Advisor, Man Group, plc January 20, 2017 Overview Cryptology Cryptography Cryptanalysis Symmetric
More information2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.
CHAPTER 2 CLASSICAL ENCRYPTION TECHNIQUES ANSWERS TO QUESTIONS 2.1 Plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm. 2.2 Permutation and substitution. 2.3 One key for symmetric
More informationCSCI3381-Cryptography
CSCI3381-Cryptography Lecture 2: Classical Cryptosystems September 3, 2014 This describes some cryptographic systems in use before the advent of computers. All of these methods are quite insecure, from
More informationCristina Nita-Rotaru. CS355: Cryptography. Lecture 9: Encryption modes. AES
CS355: Cryptography Lecture 9: Encryption modes. AES Encryption modes: ECB } Message is broken into independent blocks of block_size bits; } Electronic Code Book (ECB): each block encrypted separately.
More informationWeek 7 An Application to Cryptography
SECTION 9. EULER S GENERALIZATION OF FERMAT S THEOREM 55 Week 7 An Application to Cryptography Cryptography the study of the design and analysis of mathematical techniques that ensure secure communications
More informationNetwork Security Based on Quantum Cryptography Multi-qubit Hadamard Matrices
Global Journal of Computer Science and Technology Volume 11 Issue 12 Version 1.0 July Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN:
More informationMasterMath Cryptology /2 - Cryptanalysis
MasterMath Cryptology 2015 2/2 Cryptanalysis Wednesday, 8 April, 2015 10:38 9. Differential cryptanalysis (v2) 9.1. Differential cryptanalysis In differential analysis we simultaneously consider two encryptions
More informationAES side channel attacks protection using random isomorphisms
Rostovtsev A.G., Shemyakina O.V., St. Petersburg State Polytechnic University AES side channel attacks protection using random isomorphisms General method of side-channel attacks protection, based on random
More informationAttacks on DES , K 2. ) L 3 = R 2 = L 1 f ( R 1, K 2 ) R 4 R 2. f (R 1 = L 1 ) = L 1. ) f ( R 3 , K 4. f (R 3 = L 3
Attacks on DES 1 Attacks on DES Differential cryptanalysis is an attack on DES that compares the differences (that is, XOR values between ciphertexts of certain chosen plaintexts to discover information
More informationPublic-Key Cryptosystems CHAPTER 4
Public-Key Cryptosystems CHAPTER 4 Introduction How to distribute the cryptographic keys? Naïve Solution Naïve Solution Give every user P i a separate random key K ij to communicate with every P j. Disadvantage:
More informationIntroduction. CSC/ECE 574 Computer and Network Security. Outline. Introductory Remarks Feistel Cipher DES AES
CSC/ECE 574 Computer and Network Security Topic 3.1 Secret Key Cryptography Algorithms CSC/ECE 574 Dr. Peng Ning 1 Outline Introductory Remarks Feistel Cipher DES AES CSC/ECE 574 Dr. Peng Ning 2 Introduction
More informationProduct Systems, Substitution-Permutation Networks, and Linear and Differential Analysis
Product Systems, Substitution-Permutation Networks, and Linear and Differential Analysis Cryptology, lecture 3 Stinson, Section 2.7 3.4 Tuesday, February 12th, 2008 1 Composition Product 2 Substitution-Permutation
More informationDifferential Cache Trace Attack Against CLEFIA
Differential Cache Trace Attack Against CLEFIA Chester Rebeiro and Debdeep Mukhopadhyay Dept. of Computer Science and Engineering Indian Institute of Technology Kharagpur, India {chester,debdeep}@cse.iitkgp.ernet.in
More informationCSc 466/566. Computer Security. 5 : Cryptography Basics
1/84 CSc 466/566 Computer Security 5 : Cryptography Basics Version: 2012/03/03 10:44:26 Department of Computer Science University of Arizona collberg@gmail.com Copyright c 2012 Christian Collberg Christian
More informationCryptanalysis of Akelarre Niels Ferguson Bruce Schneier DigiCash bv Counterpane Systems Kruislaan E Minnehaha Parkway 1098 VA Amsterdam, Nethe
Cryptanalysis of Akelarre Niels Ferguson Bruce Schneier DigiCash bv Counterpane Systems Kruislaan 9 0 E Minnehaha Parkway 098 VA Amsterdam, Netherlands Minneapolis, MN 559, USA niels@digicash.com schneier@counterpane.com
More informationCryptanalysis of a Multistage Encryption System
Cryptanalysis of a Multistage Encryption System Chengqing Li, Xinxiao Li, Shujun Li and Guanrong Chen Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang 310027, China Software Engineering
More informationElliptic Curve Cryptography
Areas for Discussion Elliptic Curve Cryptography Joseph Spring Department of Computer Science 7COM1027 - Distributed Systems Security Lecture - Elliptic Curves 1 1 Motivation Elliptic Curves Security of
More informationSolution to Problem Set 3
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Handout #11 (rev. 2) Xueyuan Su October 27, 2008 Solution to Problem Set 3 Due on Wednesday, October 22, 2008.
More informationStream ciphers. Pawel Wocjan. Department of Electrical Engineering & Computer Science University of Central Florida
Stream ciphers Pawel Wocjan Department of Electrical Engineering & Computer Science University of Central Florida wocjan@eecs.ucf.edu Definition of block ciphers Block ciphers: crypto work horse n bits
More informationDesign of Low Power Optimized MixColumn/Inverse MixColumn Architecture for AES
Design of Low Power Optimized MixColumn/Inverse MixColumn Architecture for AES Rajasekar P Assistant Professor, Department of Electronics and Communication Engineering, Kathir College of Engineering, Neelambur,
More informationOverview. Background / Context. CSC 580 Cryptography and Computer Security. March 21, 2017
CSC 580 Cryptography and Computer Security Math for Public Key Crypto, RSA, and Diffie-Hellman (Sections 2.4-2.6, 2.8, 9.2, 10.1-10.2) March 21, 2017 Overview Today: Math needed for basic public-key crypto
More informationImplementation Tutorial on RSA
Implementation Tutorial on Maciek Adamczyk; m adamczyk@umail.ucsb.edu Marianne Magnussen; mariannemagnussen@umail.ucsb.edu Adamczyk and Magnussen Spring 2018 1 / 13 Overview Implementation Tutorial Introduction
More informationDifferential-Linear Cryptanalysis of Serpent
Differential-Linear Cryptanalysis of Serpent Eli Biham, 1 Orr Dunkelman, 1 Nathan Keller 2 1 Computer Science Department, Technion. Haifa 32000, Israel {biham,orrd}@cs.technion.ac.il 2 Mathematics Department,
More informationCryptography CS 555. Topic 2: Evolution of Classical Cryptography CS555. Topic 2 1
Cryptography CS 555 Topic 2: Evolution of Classical Cryptography Topic 2 1 Lecture Outline Basics of probability Vigenere cipher. Attacks on Vigenere: Kasisky Test and Index of Coincidence Cipher machines:
More information