# A Large Block Cipher Involving Key Dependent Permutation, Interlacing and Iteration

Save this PDF as:

Size: px
Start display at page:

Download "A Large Block Cipher Involving Key Dependent Permutation, Interlacing and Iteration"

## Transcription

1 BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, No 3 Sofia 2013 Print ISSN: ; Online ISSN: DOI: /cait A Large Block Cipher Involving Key Dependent Permutation, Interlacing and Iteration V. U. K. Sastry 1, N. Ravi Shankar 2, S. Durga Bhavani 3 1 School of Computer Science and Informatics, Sreenidhi Institute of Science and Technology, Hyderabad, India 2 Department of Computer Science and Engineering, Keshav Memorial Institute of Technology, Hyderabad, India 3 School of Information Technology, Jawaharlal Nehru Technological University Hyderabad, Hyderabad, India s: Abstract: In this paper we have developed a block cipher, wherein the size of the key matrix is 384 bits and the size of the plain text is as large as we choose. The permutation, the interlacing and the iteration introduced in this analysis are found to cause diffusion and confusion efficiently. Hence, the strength of the cipher proves to be remarkable. Keywords: Modular arithmetic inverse, interlacing, decomposition, permutation, inverse permutation. 1. Introduction The classical Hill cipher [1, 2], is the first cipher, which has demonstrated the application of algebraic transformations in the area of cryptology. It is also the first block cipher developed in the literature of cryptography. Lester Hill s cipher proved to be unsecure against the known plain text attacks [3]. Though Hill introduced his algorithm in 1929, not much work was reported till the last decade. In the last ten years, several researchers have focused their attention on the classical Hill cipher and proposed many modifications [4-27] to make it stronger and resistant to various cryptanalytic attacks. Some were successful and some were not. One of the most significant aspects of Hill cipher is the ability of the cipher to dissipate the statistical characteristics of the plain text, and exhibit a very good diffusion property. In this paper our objective is to offer a modification of Hill cipher by introducing a key dependent permutation, interlacing at binary bit level to the plain 50

2 text in an iterative manner. These additional operations that we introduced will not allow a direct relationship to be established between the plain text and the cipher text, as it can be done in the case of the classical Hill cipher. Since Hill cipher s primary operation is a modular matrix multiplication, the plain text is arranged in the form of a matrix of size n m, such that n is equivalent to the number of columns of the key matrix, and m can be as long as we choose. Thus, if we have a square matrix K, of size n n, and a plain text matrix of size n m, matrix multiplication can be accomplished. This also gives us the flexibility of taking the entire plain text as a single block. Thus, theoretically, there will be no limit on the size of the plain text block that can be encrypted as a single unit. In this paper we have taken 128 ASCII characters as the set of plain text characters to be encrypted. The elements of the key matrix are also in the range from 0 to 127. We take mod 128, instead of mod 26, as it was done in the case of the classical Hill cipher. In Section 2 of this paper, we introduce the development of the cipher. In Section 3 we present the algorithms for encryption and decryption. Then in Section 4 we illustrate the cipher with a couple of examples. Subsequently we discuss the crypt analysis and avalanche effect in Sections 5 and 6. Finally, we present the computations and conclusions in Section Development of the cipher Consider a plain text. When using the ASCII code, we write the plain text in the form of a matrix P = [P ij ], i = 1,, n, j = 1,, m, in a column wise manner (pad if needed). Let K=[K ij ], i = 1,, n, j = 1,, n, be the key matrix. The elements in the key matrix are between 1 and n 2 in some permuted order. Let C=[C ij ] represents the cipher text corresponding to the plain text P. As in Hill cipher, the relations for encryption and decryption can be written as (1) C=KPmod128 and (2) P=K -1 Cmod128. where K -1 is the modular arithmetic inverse of K. Let us now introduce the process of permutation and interlacing. On writing each element of the matrix [P ij ] in terms of binary bits, we have [P ij ]=[ b ], i = 1,, n, j = 1,, m, l=1,, 7. j il Thus, each column of [P ij ] is represented as a matrix of size n 7, and hence we have m such matrices. Let us now take 7n numbers (ranging from 1 to 7n), in the order in which they appear in the key matrix and form a subkey. We now focus our attention on the matrix corresponding to the first column of [P ij ] (the size of this matrix is n 7). The elements of this are permuted by using the subkey (of size 7n) above mentioned. Then, the aforementioned procedure is applied for the matrices corresponding to all other columns of [P ij ]. 51

3 Thus we get a new matrix, which includes all the permuted matrices, of size n 7m and denoted by [e ij ]. This [e ij ] is divided into two equal halves, wherein each half contains 7m/2 columns, if m is an even number. Otherwise, it will be divided into two parts, wherein the left part contains (7m+1)/2 columns and the right one is having (7m 1)/2 columns. Then we place the first column of the right half next to the first column of the left half. The second column of the right half next to the second column of the left half, and so on, till we exhaust all the columns of the right half. This completes the process of interlacing. The reverse processes of interlacing and permutation are denoted as decomposition and inverse permutation respectively. These two are utilized in decryption. In this cipher, we adopt an iterative procedure, which consists of 16 rounds. The procedures of encryption and decryption are depicted in the diagram shown in Fig Algorithms The algorithms describing encryption, decryption, modular arithmetic inverse, permutation, interlace, inverse permutation and decomposition, are given below Algorithm for encryption 1. read n, N, K, P; 2. P 0 = P; 3. P 1 = KP 0 mod128; 4. for i=2 to N{ Permute(); interlace(); P i = KP i-1 mod128; 5. C = P N ; 6. write C; 3.2. Algorithm for decryption 1. read n, N, K, C; 2. find modinverse (K); 3. P N = C; 4. for i=n to 2{ P i 1 = K -1 P i mod128; decompose(); invpermute(); 5. P 0 = K 1 P 1 mod128; 6. P=P 0 ; 7. write P; 52

4 3.3. Algorithm for modinverse 1. read n,k; 2. find K ij, ; /* K ij are the cofactors of the elements of K, and is the determinant of K */ 3. find d such that (d )mod128=1; /* d is the multiplicative inverse of */ 4. K 1 =(K ji d)mod128; 3.4. Algorithm for permute 1. convert P i into binary bits; 2. construct [e ij ], i=1 to n, j=1 to 7m; 3. generate subkey; 4. for l=0 to (m 1){ k=1; for i=1 to n{ for j=(7l+1) to (7l+7){ temp[subkey[k]]=e ij k++; k=1; for i=1 to n{ for j=(7l+1) to (7l+7){ e ij =temp[k]; k++; 3.5. Algorithm for invpermute 1. convert P i into binarybits; 2. construct [e ij ], i=1 to 8, j=1 to 14; 3. generate subkey; 4. for l=0 to (m 1){ k=1; for i=1 to n{ for j=(7l+1) to (7l+7){ temp[k]=e ij k++; k=1; for i=1 to n{ for j=(7l+1) to (7l+7){ e ij =temp[subkey[k]]; 53

5 k++; 3.6 Algorithm for interlace 1. l=1; 2. convert P into binary bits; 3. for i=1 to n{ for j=1 to 7{ temp(l) = b ij ; temp(l+1) = d ij ; l=l+2; 4. l=1; 5. for i=1 to n{ for j=1 to 7{ b ij =temp(l); d ij =temp(l+n*7); l=l+1 ; 3.7. Algorithm for decomposition 1. l=1; 2. convert P into binary bits; 3. for i = 1 to n{ for j=1 to 7{ temp(l)=b ij ; temp(l+n*7)=d ij ; l = l + 1 ; 4. l=1; 5. for i = 1 to n{ for j = 1 to 7{ b ij = temp(l); d ij = temp(l+1); l = l + 2 ; 6. convert binary bits to decimal numbers. 54

6 Read P, K, N, n Read C, K, N, n P 0 = P Find K -1 P 1 =KP 0 mod128 P N =C for i =2 to N for i = N to 2 Permute() interlace() P i =KP i-1 mod128 P i-1 =K -1 P i mod128 decompose() Invpermute() C = P N P 0 =K -1 P 1 mod128 write C P=P 0 write P a) Encryption b) Decryption Fig. 1. Schematic diagram of the cipher In this analysis, N denotes the number of iterations and it is taken as

7 4. Illustration of the cipher Let us consider the plain text given below: (3) I am quite sure to assert that all the terrorists entered in to the jungle. Let us burn the forest without any lapse of time. Peace cannot be restored unless we do this immediately. Wish you best of luck. Let us focus our attention on the first sixty four characters of the above plain text given by (4) I am quite sure to assert that all the terrorists entered in tob. By using ASCII code, these characters can be represented as a matrix of size 8 8 and it assumes the form 73 (5) P 0 = The key matrix K is given by (6) K= On using the key matrix K and the plain text P, we apply (1) and obtain the modified P, denoted by P 1, as (7) P 1 =

8 By applying the process of permutation, described in Section 2, we get the transformed P 1 as (8) P 1 63 = On applying the interlacing process (see Section 2) on P 1, we obtain (9) P = ( After carrying out all the sixteen rounds, we get the cipher text in the form (10) C= The modular arithmetic inverse of K, denoted by K -1, is given by (11) K 1 94 =

9 By applying K -1 on the cipher text C, from (2) we get (12) P N = ( On applying the decomposition algorithm (see Sections 2 and 3), the transformed P N assumes the form (13) P N = We now apply the inverse permutation algorithm described in Section 3 on the P N above obtained and get the new P N as (14) P N = After carrying out all the sixteen rounds, we get the deciphered text in the form (15) P= ( that is the same as the plain text given in (5). Let us now consider another example, wherein we have taken the complete plain text given by (3). This plain text is containing 207 characters. To represent this in the form of a matrix consisting of n rows and m columns, where n = 8 and m is having an appropriate value, depending on the number of characters, we add one more character (\$ is added here) to the plain text. With this padding, the plain text is represented in the form of ASCII codes. For convenience of space, we present the transpose of the plaintext matrix as shown in (16): 58

10 (16) Here we perform interlacing and permutation as described in Section 2. Then, on adopting the process of encryption, we get the cipher text in hexadecimal notation, as shown below: (17) F45CE2BBB263629C83A3DF35B015BB4574DD1A8C45A5CFD0C93D 6107DE4C2025E6D342505CD0206BC8FC8E55134C2F48DD61EC68739A4F0C 60CA B858BB5E47B241D3A4E76D4FC0CFEBCAA749F72B672 D8EE12922F76FD80FAFBB80ADA008D154E92C5942BAB7989A4C19CF0D FB37F761A6B9EB5DB2B4E B3CF4A8410DD3A On using the process of decryption, we readily find that this cipher text can be brought into the form of the original plain text. 59

11 5. Cryptanalysis Let us first consider the brute force attack. In the illustration of the cipher, we have taken an 8x8 matrix. Thus, the number of elements in the key matrix is 64. We take the numbers from 1 to 64 in a permuted order. There are 64! such permutations. One needs to check all these permutations to arrive at the correct key matrix. On the other hand, some researchers have estimated the key space of the Hill cipher [28, 29]. As per that, there will be 157, 248 possible invertible matrices for a 2 2 matrix for which a modular arithmetic (mod 26) exists. For a 3 3 matrix, the number is 1,634,038,189,056. A 4 4 matrix will have 12,303,585,2,7,392,870,400 possible invertible matrices. As we notice, the number grows by many orders with the increase in the order of the matrix. In our present cipher, we have taken the key matrix as 8 8 and a mod 128 is considered. With this, the exhaustive key space search will not be practical. We now take the plain text attack. The Hill cipher exhibits vulnerability against the known plain text attack, as the cipher causes a direct relationship, such as X=KY mod 128. If we can find Y -1, the modular arithmetic inverse for Y, we can find K by applying XY -1 mod 128 = KYY -1 mod 128 = K. But in the present cipher, the relationship between the plain text and cipher text is not as simple as the one in the classical Hill cipher. The key dependent permutation and the interlacing at each step of the iteration prevent such direct relationship from being established, making it difficult to break the cipher using the known plain text attack. In the same aspect we say that no special choice of the plain text or the cipher text will help the crypt analyst in breaking the cipher using the chosen plain text/chosen cipher text attack. 6. Avalanche effect Avalanche effect is a necessary condition for all modern block ciphers. It demonstrates the diffusion property of the block cipher. We have tested our cipher for a large number of plain texts and verified the avalanche effect. We are illustrating one case as an example. By applying the encryption algorithm to the plain text given in (4), and using the key matrix K, the corresponding cipher text can be obtained as (18)

12 We now change the third character of the plaintext given in (4) from a to c. Then the modified plain text will be of the form (19) I am quite sure to assert that all the terrorists entered in tob. It may be noted that the plain texts given in (4) and (19) differ by exactly one bit. The cipher text corresponding to the plain text given in (19) is (20) We readily notice that the cipher texts given in (18) and (20) differ by 224 bits which is substantial. Let us now change the key matrix element K 25 form from 60 to 62. With this change, the original key and the modified key differ by one bit. By applying the modified key, the cipher text corresponding to the plain text given in (4) is obtained as (21) The cipher texts given in (18) and (21) differ by 234 bits, which is also very significant. 7. Computations and conclusions In this paper we have extended the analysis of the modified Hill cipher by considering a plain text of any size. In this analysis we have illustrated the cipher by considering two cases. In the first one, the plain text is an 8 8 matrix and in the second one, it is of size The algorithms designed in this analysis are implemented in C language. As the key size and the plain text size are significantly large, and as the iteration together with the permutation and the interlacing are effectively leading to diffusion and confusion, the cipher is resistant to crypt analytic attacks. In the case of a complete plain text, which is taken in the form of a single block, the time required for encryption is s and the time required for decryption is s. These results indicate that the algorithm is quite efficient and it can be applied in any context for transmission of information. This analysis can be extended to the case, where we take multiple key matrices so that the process is further strengthened. 61

13 References 1. H i l l, L. S. Cryptography in an Algebraic Alphabet. American Mathematical Monthly, Vol. 36, 1929, No 6, H i l l, L. S. Concerning Certain Linear Transformation Apparatus of Cryptography. American Mathematical Monthly, Vol. 38, 1931, No 3, Stallings, W. Cryptography and Network Security Principles and Practices. 3rd Edition. New Jersey, Prentice Hall, S a s t r y, V. U. K., N. R a v i S h a n k a r. Modified Hill Cipher with Interlacing and Iteration. Journal of Computer Science, Science Publications, Vol. 3, 2007, No 11, S a s t r y, V. U. K., N. R a v i S h a n k a r. Modified Hill Cipher for a Large Block of Plaintext with Interlacing and Iteration. Journal of Computer Science, Science Publications, Vol. 4, 2008, No 1, S a s t r y, V. U. K., N. R a v i S h a n k a r, S. D u r g a B h a v a n i. A Modified Hill Cipher Involving Interweaving and Iteration. International Journal of Network Security, Vol. 11, 2010, No 1, Sastry, V. U. K., N. Ravi Shankar, S. Durga Bhavani. A Large Block Cipher Involving Interweaving and Iteration. In: Proceedings of the International Conference on Advances and Emerging Trends in Computing Technologies (ICAET 10), June 2010, Chennai, Sa st ry, V. U. K., N. Ra vi Sha n ka r, S. Dur ga Bha va ni. A Modified Playfair Cipher Involving Interweaving and Iteration. International Journal of Computer Theory and Engineering, Vol. 1, December 2009, No 5, S a s t r y, V. U. K., N. R a v i S h a n k a r, S. D u r g a B h a v a n i. A Modified Playfair Cipher for a Large Block of Plaintext. International Journal of Computer Theory and Engineering, Vol. 1, 2009, No 5, S a s t r y, V. U. K., N. R a v i S h a n k a r, S. D u r g a B h a v a n i. A Generalized Playfair Cipher Involving Intertwining, Interweaving and Iteration. International Journal of Networks and Mobile Technology, Vol. 1, 2010, No 2, S a s t r y, V. U. K., N. R a v i S h a n k a r, S. D u r g a B h a v a n i. A Blending of A Generalized Playfair Cipher and A Modified Hill Cipher. International Journal of Networks and Mobile Technologies, Vol. 2, 2011, No 1, S a s t r y, V. U. K., V. J a n a k i. On the Modular Arithmetic Inverse in the Cryptology of Hill Cipher. In: Proceedings of North American Technology and Business Conference, September 2005, Montreal, Canada. 13. L e v i n e, J., R. E. Hartwig. Applications of the Drazin Inverse to the Hill Cryptographic System. Part I. Cryptologia, Vol. 4, 1980, No 2, L e v i n e, J., R. E. H a r t w i g. Applications of the Drazin Inverse to the Hill Cryptographic System. Part II. Cryptologia, Vol. 4, 1980, No 3, L e v i n e, J., R. E. H a r t w i g. Applications of the Drazin Inverse to the Hill Cryptographic System. Part III. Cryptologia, Vol. 5, 1981, No 2, L e v i n e, J., R. E. H a r t w i g. Applications of the Drazin Inverse to the Hill Cryptographic System. Part IV. Cryptologia, Vol. 5, 1981, No 4, M a k a r, B. H. Application of a Certain Class of Infinite Matrices to the Hill Cryptographic System. Cryptologia, Vol. 7, 1983, No 1, L e v i n e, J., R. C h a n d l e r. The Hill Cryptographic System with Unknown Cipher Alphabet, But Known Plaintext. Cryptologia, Vol. 13, 1989, No 1, K i e l e, W. A. A Tensor-Theoretic Enhancement to the Hill Cipher System. Cryptologia, Vol. 14, 1990, No 3, T h i l a k a, B., K. R a j a l a k s h m i. An Extension of Hill Cipher Using Generalized Inverses and mth Residue modulo n. Cryptologia, Vol. 29, 2005, No 4, S a e e d n i a, S. How to Make the Hill Cipher Secure. Cryptologia, Vol. 24, 2000, No 4,

14 22. Yeh, Y. S., T. C. Wu, C. C. Chang, W. C. Y a n g. A New Cryptosystem Using Matrix Transformation. In: Proceedings of the 25th IEEE International Carnahan Conference on Security Technology, 1991, M a h m o u d, A. Y., A. G. C h e f r a n o v. Hill Cipher Modification Based on Eigenvalues HCM- EE. In: Proceedings of the Second International Conference on Security of Information and Networks (SIN2009), Gazimagusa (TRNC) North Cyprus, A. Elci, M. Orgun, A. Chefranov, (Eds) ACM, New York, USA, 2009, M a h m o u d, A. Y., A. G. C h e f r a n o v. Hill Cipher Modification Based on Pseudo-Random Eigenvalues. Fourth coming paper, to appear in Applied Mathematics & Information Sciences. 25. L i n, C. H., C. Y. L e e, C. Y. L e e. Comments on Saeednia's Improved Scheme for the Hill Cipher. Journal of the Chinese Institute of Engineers, Vol. 27, 2004, No 5, Toorani, M., A. Falahati. A Secure Cryptosystem Based on Affine Transformation. Journal of Security and Communication Networks, Vol. 4, 2011, No 2, T o o r a n i, M., A. F a l a h a t i. A Secure Variant of the Hill Cipher. In: Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 09), July 2009, O v e r b e y, J., W. T r a v e s, J. W o j d y l o. On the Keyspace of the Hill Cipher. Cryptologia, Vol. 29, 2005, No 1, Bauer, C., K. Millward. Cracking Matrix Encryption Row by Row. Cryptologia, Vol. 31, 2007,

### A Block Cipher using an Iterative Method involving a Permutation

Journal of Discrete Mathematical Sciences & Cryptography Vol. 18 (015), No. 3, pp. 75 9 DOI : 10.1080/097059.014.96853 A Block Cipher using an Iterative Method involving a Permutation Lakshmi Bhavani Madhuri

### K 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

### Classical 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

### APPLYING 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

### Block Ciphers and Feistel cipher

introduction Lecture (07) Block Ciphers and cipher Dr. Ahmed M. ElShafee Modern block ciphers are widely used to provide encryption of quantities of information, and/or a cryptographic checksum to ensure

### Block 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

### A Polynomial Description of the Rijndael Advanced Encryption Standard

A Polynomial Description of the Rijndael Advanced Encryption Standard arxiv:cs/0205002v1 [cs.cr] 2 May 2002 Joachim Rosenthal Department of Mathematics University of Notre Dame Notre Dame, Indiana 46556,

### Multi-Map Orbit Hopping Chaotic Stream Cipher

Multi-Map Orbit Hopping Chaotic Stream Cipher Xiaowen Zhang 1, Li Shu 2, Ke Tang 1 Abstract In this paper we propose a multi-map orbit hopping chaotic stream cipher that utilizes the idea of spread spectrum

### Matrix Power S-Box Construction

Matrix Power S-Box Construction Eligijus Sakalauskas a and Kestutis Luksys b Department of Applied Mathematics, Kaunas University of Technology, Studentu g. 50, 52368 Kaunas, Lithuania a Eligijus.Sakalauskas@ktu.lt

### Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography

Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography Sambhu Prasad Panda 1, Madhusmita Sahu 2, Manas Kumar Swain 3 C V Raman Computer Academy 1,2, C V Raman College

### Design 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,

### Breaking 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

### AN 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

### The 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.................................

### One-way Hash Function Based on Neural Network

One-way Hash Function Based on Neural Network Shiguo Lian, Jinsheng Sun, Zhiquan Wang Department of Automation, Nanjing University of Science & echnology, Nanjing, 294, China, sg_lian@63.com Abstract A

### Cryptography 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

### An 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

### Product 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

### 7 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

### Bitblock Ciphers and Feistel Networks

Chapter 2 Bitblock Ciphers and Feistel Networks This chapter contains basic facts about bitblock ciphers and some approaches to their construction. 13 K. Pommerening, Bitblock Ciphers 14 2.1 Bitblock Ciphers

Proceedings of the Workshop on Foundations of Informatics FOI-2015, August 24-29, 2015, Chisinau, Republic of Moldova About Vigenere cipher modifications Eugene Kuznetsov Abstract TheaimofthisworkisamodificationoftheclassicalVigenere

### B. Encryption using quasigroup

Sequence Randomization Using Quasigroups and Number Theoretic s Vaignana Spoorthy Ella Department of Computer Science Oklahoma State University Stillwater, Oklahoma, USA spoorthyella@okstateedu Abstract

### Application of Laplace Transform For Cryptographic Scheme

, July 3-5, 2013, London, U.K. Application of Laplace Transform For Cryptographic Scheme A.P.Hiwarekar ABSTRACT - Information protection has been an important part of human life from ancient time. In computer

### Public-Key Encryption: ElGamal, RSA, Rabin

Public-Key Encryption: ElGamal, RSA, Rabin Introduction to Modern Cryptography Benny Applebaum Tel-Aviv University Fall Semester, 2011 12 Public-Key Encryption Syntax Encryption algorithm: E. Decryption

### A Chaotic Encryption System Using PCA Neural Networks

A Chaotic Encryption System Using PCA Neural Networks Xiao Fei, Guisong Liu, Bochuan Zheng Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science

### Lattice 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

### Cryptanalytic world records, summer Brute force cryptanalysis. Dr. Daniel Loebenberger. Computer. osec. SeCurity

Cryptanalytic world records, summer 2014 Brute force cryptanalysis Dr. Daniel Loebenberger C Computer osec b-it SeCurity Source: http://xkcd.com/538/ 28/30 Overview Dictionary attacks Exhaustive key search

### Key classification attack on block ciphers

Key classification attack on block ciphers Maghsood Parviz Mathematical Sciences Department Sharif University of Technology Tehran, IAN maghsoudparviz@alum.sharif.ir Saeed Mirahmadi Pooyesh Educational

### Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?

Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? Alexander May, Maike Ritzenhofen Faculty of Mathematics Ruhr-Universität Bochum, 44780 Bochum,

### Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function

Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function Itai Dinur 1, Pawe l Morawiecki 2,3, Josef Pieprzyk 4 Marian Srebrny 2,3, and Micha l Straus 3 1 Computer Science Department, École

### Transform Domain Analysis of DES. Guang Gong and Solomon W. Golomb. University of Southern California. Tels and

Transform Domain Analysis of DES Guang Gong and Solomon W. Golomb Communication Sciences Institute University of Southern California Electrical Engineering-Systems, EEB # 500 Los Angeles, California 90089-2565

### CSc 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

### CSc 466/566. Computer Security. 5 : Cryptography Basics

1/84 CSc 466/566 Computer Security 5 : Cryptography Basics Version: 2013/02/13 16:54:59 Department of Computer Science University of Arizona collberg@gmail.com Copyright c 2013 Christian Collberg Christian

### RSA ENCRYPTION USING THREE MERSENNE PRIMES

Int. J. Chem. Sci.: 14(4), 2016, 2273-2278 ISSN 0972-768X www.sadgurupublications.com RSA ENCRYPTION USING THREE MERSENNE PRIMES Ch. J. L. PADMAJA a*, V. S. BHAGAVAN a and B. SRINIVAS b a Department of

### An Extended DES. National Chiao Tung University Hsinchu, 300 Taiwan

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 349-365 (2002) An Extended DES YI-SHIUNG YEH AND CHING-HUNG HSU * Institute of Computer Science and Information Engineering * Institute of Computer and

### Linear Cryptanalysis Using Multiple Approximations

Linear Cryptanalysis Using Multiple Approximations Burton S. Kaliski Jr. and M.J.B. Robshaw RSA Laboratories 100 Marine Parkway Redwood City, CA 94065, USA Abstract. We present a technique which aids in

### Impossible Differential Attacks on 13-Round CLEFIA-128

Mala H, Dakhilalian M, Shakiba M. Impossible differential attacks on 13-round CLEFIA-128. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 26(4): 744 750 July 2011. DOI 10.1007/s11390-011-1173-0 Impossible Differential

### Efficient RSA Cryptosystem with Key Generation using Matrix

E f f i c i e n t R S A C r y p t o s y s t e m w i t h K e y G e n e r a t i o n u s i n g M a t r i x Efficient RSA Cryptosystem with Key Generation using Matrix Prerna Verma 1, Dindayal Mahto 2, Sudhanshu

### Modular Multiplication in GF (p k ) using Lagrange Representation

Modular Multiplication in GF (p k ) using Lagrange Representation Jean-Claude Bajard, Laurent Imbert, and Christophe Nègre Laboratoire d Informatique, de Robotique et de Microélectronique de Montpellier

### An information encryption system based on Boolean functions

Computer Science Journal of Moldova, vol.18, no.3(54), 2010 Information encryption systems based on Boolean functions Aureliu Zgureanu Abstract An information encryption system based on Boolean functions

### Cryptography. 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

### STATISTICAL TOOLS USED IN CRYPTOGRAPHIC EVALUATION

Bulletin of the Transilvania University of Braşov Vol 4(53) No. 2-2011 Series III: Mathematics, Informatics, Physics, 129-140 STATISTICAL TOOLS USED IN CRYPTOGRAPHIC EVALUATION Adela GEORGESCU 1 Ruxandra

### A Unified Method for Finding Impossible Differentials of Block Cipher Structures

A Unified Method for inding Impossible Differentials of Block Cipher Structures Yiyuan Luo 1,2, Zhongming Wu 1, Xuejia Lai 1 and Guang Gong 2 1 Department of Computer Science and Engineering, Shanghai

### ON THE SECURITY OF THE ADVANCED ENCRYPTION STANDARD

ON THE SECURITY OF THE ADVANCED ENCRYPTION STANDARD Paul D. Yacoumis Supervisor: Dr. Robert Clarke November 2005 Thesis submitted for the degree of Honours in Pure Mathematics Contents 1 Introduction

### Differential Attacks: Using Alternative Operations

Differential Attacks: Using Alternative Operations Céline Blondeau 1, Roberto Civino 2, and Massimiliano Sala 2 1 Aalto University, School of Science, Finland celine.blondeau@aalto.fi 2 University of Trento,

### Cryptography CS 555. Topic 24: Finding Prime Numbers, RSA

Cryptography CS 555 Topic 24: Finding Prime Numbers, RSA 1 Recap Number Theory Basics Abelian Groups φφ pppp = pp 1 qq 1 for distinct primes p and q φφ NN = Z N gg xx mod N = gg [xx mmmmmm φφ NN ] mod

### A Block Cipher Using Linear Congruences

Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &

### MATHEMATICS EXTENDED ESSAY

MATHEMATICS EXTENDED ESSAY How does the RSA algorithm function and why is it used in modern communication? Candidate Name: Murtuza Kainan Candidate Session Number: 003077006 Word Count: 3908 1 P a g e

### An Improved Affine Equivalence Algorithm for Random Permutations

An Improved Affine Equivalence Algorithm for Random Permutations Itai Dinur Department of Computer Science, Ben-Gurion University, Israel Abstract. In this paper we study the affine equivalence problem,

### New Results in the Linear Cryptanalysis of DES

New Results in the Linear Cryptanalysis of DES Igor Semaev Department of Informatics University of Bergen, Norway e-mail: igor@ii.uib.no phone: (+47)55584279 fax: (+47)55584199 May 23, 2014 Abstract Two

### Elliptic Curves I. The first three sections introduce and explain the properties of elliptic curves.

Elliptic Curves I 1.0 Introduction The first three sections introduce and explain the properties of elliptic curves. A background understanding of abstract algebra is required, much of which can be found

### Real scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm. David Morgan

Real scripts backgrounder 3 - Polyalphabetic encipherment - XOR as a cipher - RSA algorithm David Morgan XOR as a cipher Bit element encipherment elements are 0 and 1 use modulo-2 arithmetic Example: 1

### Hans Delfs & Helmut Knebl: Kryptographie und Informationssicherheit WS 2008/2009. References. References

Hans Delfs & Helmut Knebl: Kryptographie und Informationssicherheit WS 2008/2009 Die Unterlagen sind ausschliesslich zum persoenlichen Gebrauch der Vorlesungshoerer bestimmt. Die Herstellung von elektronischen

### Block 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

### Introduction. Outline. CSC/ECE 574 Computer and Network Security. Secret Keys or Secret Algorithms? Secrets? (Cont d) Secret Key Cryptography

Outline CSC/ECE 574 Computer and Network Security Introductory Remarks Feistel Cipher DES AES Topic 3.1 Secret Key Cryptography Algorithms CSC/ECE 574 Dr. Peng Ning 1 CSC/ECE 574 Dr. Peng Ning 2 Secret

### Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets

Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of

### Distinguishing Attacks on a Kind of Generalized Unbalanced Feistel Network

Distinguishing Attacks on a Kind of Generalized Unbalanced Feistel Network Ruilin Li, Bing Sun, and Chao Li Department of Mathematics and System Science, Science College, National University of Defense

### Week 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

### Security of the SMS4 Block Cipher Against Differential Cryptanalysis

Su BZ, Wu WL, Zhang WT. Security of the SMS4 block cipher against differential cryptanalysis. JOURNAL OF COM- PUTER SCIENCE AND TECHNOLOGY 26(1): 130 138 Jan. 2011. DOI 10.1007/s11390-011-1116-9 Security

### Classical Cryptography

JASS 05 Seminar: Algorithms for IT Security Classical Cryptography Ilya Saverchenko June 6, 2005 Abstract Cryptography is a study of secret writing. It allows two people, usually referred to as Alice and

### Linear Cryptanalysis of Reduced-Round PRESENT

Linear Cryptanalysis of Reduced-Round PRESENT Joo Yeon Cho 1 Helsinki University of Technology, Finland 2 Nokia A/S, Denmark joo.cho@tkk.fi Abstract. PRESENT is a hardware-oriented block cipher suitable

### Cryptanalysis of a Knapsack Based Two-Lock Cryptosystem

Cryptanalysis of a Knapsack Based Two-Lock Cryptosystem Bin Zhang 1,2, Hongjun Wu 1, Dengguo Feng 2, and Feng Bao 1 1 Institute for Infocomm Research, Singapore 119613 2 State Key Laboratory of Information

### A Piggybank Protocol for Quantum Cryptography

Piggybank Protocol for Quantum Cryptography Navya Chodisetti bstract This paper presents a quantum mechanical version of the piggy-bank cryptography protocol. The basic piggybank cryptography idea is to

### Chaotic Based Secure Hash Algorithm

Chaotic Based Secure Hash Algorithm Mazen Tawfik Mohammed 1, Alaa Eldin Rohiem 2, Ali El-moghazy 3 and A. Z. Ghalwash 4 1,2 Military technical College, Cairo, Egypt 3 Higher Technological Institute, Cairo,

### [Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives

[Part 2] Asymmetric-Key Encipherment Mathematics of Cryptography Forouzan, B.A. Cryptography and Network Security (International Edition). United States: McGraw Hill, 2008. Objectives To introduce prime

### A New Knapsack Public-Key Cryptosystem Based on Permutation Combination Algorithm

A New Knapsack Public-Key Cryptosystem Based on Permutation Combination Algorithm Min-Shiang Hwang Cheng-Chi Lee Shiang-Feng Tzeng Department of Management Information System National Chung Hsing University

### A Novel Image Encryption Scheme Using the Composite Discrete Chaotic System

entropy Article A Novel Image Encryption Scheme Using the Composite Discrete Chaotic System Hegui Zhu 1, *, Xiangde Zhang 1, Hai Yu 2, Cheng Zhao 3 and Zhiliang Zhu 2 1 College of Sciences, Northeastern

### Preimage Attacks on Reduced Tiger and SHA-2

Preimage Attacks on Reduced Tiger and SHA-2 Takanori Isobe and Kyoji Shibutani Sony Corporation 1-7-1 Konan, Minato-ku, Tokyo 108-0075, Japan {Takanori.Isobe,Kyoji.Shibutani}@jp.sony.com Abstract. This

### Solutions to homework 2

ICS 180: Introduction to Cryptography 4/22/2004 Solutions to homework 2 1 Security Definitions [10+20 points] Definition of some security property often goes like this: We call some communication scheme

### Ciphertext-only Cryptanalysis of a Substitution Permutation Network

Ciphertext-only Cryptanalysis of a Substitution Permutation Network No Author Given No Institute Given Abstract. We present the first ciphertext-only cryptanalytic attack against a substitution permutation

### Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring

Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring Alexander May Faculty of Computer Science, Electrical Engineering and Mathematics University of Paderborn 33102 Paderborn,

### Cryptanalysis on An ElGamal-Like Cryptosystem for Encrypting Large Messages

Cryptanalysis on An ElGamal-Like Cryptosystem for Encrypting Large Messages MEI-NA WANG Institute for Information Industry Networks and Multimedia Institute TAIWAN, R.O.C. myrawang@iii.org.tw SUNG-MING

### Cryptanalysis of the SIMON Family of Block Ciphers

Cryptanalysis of the SIMON Family of Block Ciphers Hoda A. Alkhzaimi and Martin M. Lauridsen DTU Compute Section for Cryptology Department of Applied Mathematics and Computer Science Matematiktorvet, building

### Introduction to Cybersecurity Cryptography (Part 4)

Introduction to Cybersecurity Cryptography (Part 4) Review of Last Lecture Blockciphers Review of DES Attacks on Blockciphers Advanced Encryption Standard (AES) Modes of Operation MACs and Hashes Message

### 8.1 Principles of Public-Key Cryptosystems

Public-key cryptography is a radical departure from all that has gone before. Right up to modern times all cryptographic systems have been based on the elementary tools of substitution and permutation.

### An Algebraic Framework for Cipher Embeddings

An Algebraic Framework for Cipher Embeddings C. Cid 1, S. Murphy 1, and M.J.B. Robshaw 2 1 Information Security Group, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, U.K. 2 France Télécom

### Chapter 4 Mathematics of Cryptography

Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1 Chapter 4 Objectives To review the concept

### Algebraic nonlinearity and its applications to cryptography

Algebraic nonlinearity and its applications to cryptography Luke O Connor Department of Computer Science University of Waterloo, Ontario, Canada, NL 3G1 Andrew Klapper Department of Computer Science University

### CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrosky. Lecture 4

CS 282A/MATH 209A: Foundations of Cryptography Prof. Rafail Ostrosky Lecture 4 Lecture date: January 26, 2005 Scribe: Paul Ray, Mike Welch, Fernando Pereira 1 Private Key Encryption Consider a game between

### Security of the AES with a Secret S-box

Security of the AES with a Secret S-box Tyge Tiessen, Lars R Knudsen, Stefan Kölbl, and Martin M Lauridsen {tyti,lrkn,stek,mmeh}@dtudk DTU Compute, Technical University of Denmark, Denmark Abstract How

### Public-key Cryptography and elliptic curves

Public-key Cryptography and elliptic curves Dan Nichols nichols@math.umass.edu University of Massachusetts Oct. 14, 2015 Cryptography basics Cryptography is the study of secure communications. Here are

### Number Theory. Modular Arithmetic

Number Theory The branch of mathematics that is important in IT security especially in cryptography. Deals only in integer numbers and the process can be done in a very fast manner. Modular Arithmetic

### 2. Cryptography 2.5. ElGamal cryptosystems and Discrete logarithms

CRYPTOGRAPHY 19 Cryptography 5 ElGamal cryptosystems and Discrete logarithms Definition Let G be a cyclic group of order n and let α be a generator of G For each A G there exists an uniue 0 a n 1 such

### Combinatorics of p-ary Bent Functions

Combinatorics of p-ary Bent Functions MIDN 1/C Steven Walsh United States Naval Academy 25 April 2014 Objectives Introduction/Motivation Definitions Important Theorems Main Results: Connecting Bent Functions

### Polygraphic Substitution Ciphers: The Hill cipher

Spring 2015 Chris Christensen MAT/CSC 483 Polygraphic Substitution Ciphers: The Hill cipher The Playfair cipher is a polygraphic cipher; it enciphers more than one letter at a time. Recall that the Playfair

### IEOR SEMINAR SERIES Cryptanalysis: Fast Correlation Attacks on LFSR-based Stream Ciphers

IEOR SEMINAR SERIES Cryptanalysis: Fast Correlation Attacks on LFSR-based Stream Ciphers presented by Goutam Sen Research Scholar IITB Monash Research Academy. 1 Agenda: Introduction to Stream Ciphers

### Invariant Subspace Attack Against Full Midori64

Invariant Subspace Attack Against Full Midori64 Jian Guo 1, Jérémy Jean 1, Ivica Nikolić 1, Kexin Qiao 1,2, Yu Sasaki 1,3, and Siang Meng Sim 1 1 Nanyang Technological University, Singapore 2 Institute

### Research Article Novel Quantum Encryption Algorithm Based on Multiqubit Quantum Shift Register and Hill Cipher

Advances in High Energy Physics, Article ID 104325, 5 pages http://dx.doi.org/10.1155/2014/104325 Research Article Novel Quantum Encryption Algorithm Based on Multiqubit Quantum Shift Register and Hill

### A new version of the RC6 algorithm, stronger against χ 2 cryptanalysis

A new version of the RC6 algorithm, stronger against χ 2 cryptanalysis Routo Terada 1 Eduardo T. Ueda 2 1 Dept. of Computer Science University of São Paulo, Brazil Email: rt@ime.usp.br 2 Dept. of Computer

### 1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above.

1/16 2/17 3/17 4/7 5/10 6/14 7/19 % Please do not write in the spaces above. Directions: You have 75 minutes in which to complete this exam. Please make sure that you read through this entire exam before

### Improved Linear Cryptanalysis of reduced-round SIMON-32 and SIMON-48

Improved inear Cryptanalysis of reduced-round SIMON-32 and SIMON-48 Mohamed Ahmed Abdelraheem, Javad Alizadeh 2, Hoda A. Alkhzaimi 3, Mohammad eza Aref 2, Nasour Bagheri 4, and Praveen Gauravaram 5 SICS

### Pseudo-random Number Generation. Qiuliang Tang

Pseudo-random Number Generation Qiuliang Tang Random Numbers in Cryptography The keystream in the one-time pad The secret key in the DES encryption The prime numbers p, q in the RSA encryption The private

### A Fast Provably Secure Cryptographic Hash Function

A Fast Provably Secure Cryptographic Hash Function Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier Projet Codes, INRIA Rocquencourt BP 15, 78153 Le Chesnay - Cedex, France [DanielAugot,MatthieuFiniasz,NicolasSendrier]@inriafr

### A New Classification of 4-bit Optimal S-boxes and its Application to PRESENT, RECTANGLE and SPONGENT

A New Classification of 4-bit Optimal S-boxes and its Application to PRESENT, RECTANGLE and SPONGENT Wentao Zhang 1, Zhenzhen Bao 1, Vincent Rijmen 2, Meicheng Liu 1 1.State Key Laboratory of Information

### Comparison of Selected Fast Orthogonal Parametric Transforms in Data Encryption

JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 23 No. 2 (2015), pp. 55-68 Comparison of Selected Fast Orthogonal Parametric Transforms in Data Encryption Dariusz Puchala Lodz University of Technology Institute

### Technion - Computer Science Department - Technical Report CS0816.revised

How to Strengthen DES Using Existing Hardware Eli Biham? Alex Biryukov?? Abstract Dierential, linear and improved Davies' attacks are capable of breaking DES faster than exhaustive search, but are usually

### Differential and Rectangle Attacks on Reduced-Round SHACAL-1

Differential and Rectangle Attacks on Reduced-Round SHACAL-1 Jiqiang Lu 1, Jongsung Kim 2,3, Nathan Keller 4, and Orr Dunkelman 5 1 Information Security Group, Royal Holloway, University of London Egham,

### NUMBERS AND CODES CHAPTER Numbers

CHAPTER 2 NUMBERS AND CODES 2.1 Numbers When a number such as 101 is given, it is impossible to determine its numerical value. Some may say it is five. Others may say it is one hundred and one. Could it