DOCSLIB.ORG

A Modified Hill Cipher Involving Interweaving and Iteration

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Modified Hill Cipher Involving Interweaving and Iteration International Journal of Network Security, Vol.11, No.1, PP.11{16, July 2010 11 A Modi¯ed Hill Cipher Involving Interweaving and Iteration V. Umakanta Sastry1, N. Ravi Shankar2, and S. Durga Bhavani3 (Corresponding author: V. Umakanta Sastry) Director, SCSI, Dean (R&D), Sreenidhi Institute of Science and Technology, Hyderabad, India1 CSE Department, SNIST, Hyderabad, India2 SIT, JNT University, Hyderabad, India3 (Email: vuksastry@redi®mail.com) (Received Nov. 24, 2008; revised and accepted May 4 & May 12, 2009) Abstract Encryption Standard (DES). In this, the length of the key is 56 bits, and the length of the plaintext block is 64 This paper deals with a modi¯cation of the Hill cipher. bits. In DES, as the length of the key is only 56 bits, it In this, we have introduced interweaving in each step of is found that this cipher is breakable with a good deal of the iteration. The interweaving of the resulting plaintext, e®ort by brute force attack. In view of this fact, several at each stage of the iteration, and the multiplication with variants, of DES, such as 2DES and 3DES came into exis- the key matrix leads to confusion and di®usion. From tence. However, these are found to be relatively sluggish the cryptanalysis performed in this investigation, we have in software. In the light of this, at the end of the last found that the cipher is a strong one. century, Joan Daeman and Vincent Rijman developed an Keywords: Interweaving, inverse interweaving, modular algorithm called Advanced Encryption Standard (AES). arithmetic inverse In this, the block length is 128-bit and the key length is 128, 192 or 256 bits. This cipher is found to be a strong one. 1 Introduction In the literature of cryptography, it is well known that, In a recent investigation [7, 10], we have used a new confusion and di®usion play a vital role in the develop- concept called interlacing, and modi¯ed the Hill cipher. ment of a cipher [3, 4, 5]. The transposition or permuta- In the process of interlacing, mixing of binary bits is car- tion of characters in the plaintext is responsible for con- ried out in a row wise manner, i.e., binary bits of the fusion, and the influence of each bit of the key on each elements of each row are separately mixed. This process, plaintext bit causes di®usion. included in each iteration, strengthens the cipher. The study of the classical Hill cipher [12], in which, a matrix containing numbers is used as a key in the encryp- In the present paper, we modify the Hill cipher by in- tion process, and the modular arithmetic inverse of the troducing interweaving (transposition of the binary bits key is employed in the decryption process, has attracted of the plaintext characters belonging to the neighboring the attention of several researchers [6, 7, 8, 9, 10, 11] in rows and columns) and iteration. In this, the multiplica- the recent years. In the Hill cipher, the basic steps of tion of the plaintext with the key matrix, the interweaving encryption and decryption are given by and the iteration cause a lot of di®usion and confusion. Here, our objective is to develop a strong block cipher, C = PK mod 26; whose key length is signi¯cantly large. and P = K¡1C mod 26; In Section 2, we present the development of the ci- pher. We design the algorithms for encryption, decryp- where P is the plaintext, K the key matrix, C the cipher- tion, modular arithmetic inverse, interweaving, and in- text and K¡1 is the modular arithmetic inverse of K. verse interweaving in Section 3. In Section 4, we illustrate Here, he has taken mod 26, as he focused his attention on the cipher with an example. We discuss the cryptanalysis the 26 characters of English alphabet. in Section 5, and mention the avalanche e®ect in Section Subsequently, Feistel [2] analyzed the general princi- 6. Finally, in Section 7, we draw conclusions from the ples of block ciphers and lead to the development of Data computations carried out in this analysis. International Journal of Network Security, Vol.11, No.1, PP.11{16, July 2010 12 2 Development of the Cipher Consider a plaintext P of 2n characters. By using the ASCII code, let us represent P in the form of a matrix, given by P = [Pij]; i = 1 to n, j = 1 to 2: Let K = [Kij ], i = 1 to n, j = 1 to n, be the key matrix, in which all the elements are less than 128. The process of encryption can be described by the following equations. P0 = P; P i = < KP i¡1 mod 128 >; i = 1 to N; C = KP N mod 128: Here, <> denote interweaving of the resulting matrix in a column wise and a row wise manner and C is the ciphertext. The process of decryption is governed by the relations ¡1 PN = K C mod 128; P i¡1 = > K¡1P i mod 128 <; i = N to 1; P = P 0: In this, >< denotes the reverse process of interweaving and K¡1 is the modular arithmetic inverse of K. The process of interweaving can be described as fol- lows. Let [Qij ], i = 1 to n, j = 1 to 2 be the transformed plaintext matrix obtained after performing the multipli- cation with the key matrix and taking mod 128. On con- verting each element of [Qij] into binary form, we get a new matrix [bil]; i = 1 to n, l = 1 to 14: 2 3 b11 b12 ¢ ¢ ¢ b114 6b b ¢ ¢ ¢ b 7 Figure 1: Schematic diagram of the cipher Thus we have [b ] = 6 11 11 214 7 il 4 ¢ ¢ ¢ ¢ 5 bn1 bn2 ¢ ¢ ¢ bn14 We rotate the ¯rst column and see that it assumes This completes the process of interweaving. We denote T the form [b21; b31; ¢ ¢ ¢ bn1; b11] , where T denotes the the reverse process of interweaving as inverse interweav- transpose of the vector. Here, each element has gone one ing. step up and the ¯rst element has come down to the last The schematic diagram of the cipher is given in Fig- position. This process is carried out for columns 1, 3, 5 ure 1. This shows the processes of the encryption and the and so on. Similarly, we carry out a circular left shift of decryption in detail. the rows numbered 2, 4, 6, ¢ ¢ ¢ etc. After carrying out the aforementioned steps, the matrix assumes the form 2 3 3 Algorithms b21 b12 b23 ¢ ¢ ¢ b213 b114 6 7 6b22 b33 b24 ¢ ¢ ¢ b214 b31 7 The algorithms describing encryption, decryption, modu- 6 7 6 ¢ ¢ ¢ ¢ ¢ ¢ 7 lar arithmetic inverse, permutation, interlace, inverse per- [bil] = 6 7 6 ¢ ¢ ¢ ¢ ¢ ¢ 7 mutation and decompose are given below. 4 ¢ ¢ ¢ ¢ ¢ ¢ 5 bn2 b11 bn4 ¢ ¢ ¢ bn14 b11 Then we construct the modi¯ed plaintext matrix P 3.1 Algorithm for Encryption wherein, the elements of the ¯rst column of P are ob- 1) read n, N, K, P ; tained from the ¯rst seven columns of [bil], and the second column of P from the subsequent seven columns of [bil]. 2) P0 = P ; International Journal of Network Security, Vol.11, No.1, PP.11{16, July 2010 13 3) for i = 1 to N f 4) for i = 2 to n in step 2 f i i¡1 P = KP mod 128; k = bi1; interweave(); for j = 1 to 13 f g bij = bi(j+1); g bi14 = k; g 4) C = KP N mod 128; 5) write C; 5) Construct Pi from bij ; 3.2 Algorithm for Decryption 1) read n, N, K, C; 4 Illustration of the Cipher 2) ¯nd modinverse(K); Consider a plaintext given below. 3) P N = K¡1C mod 128; The development of the nuclear technology of all the devel- oped countries must be watched carefully by a super com- 4) for i = N to 1 f mittee consisting of representatives of all the countries. invinterweave(); This ensures the safety of all the nations if and only if a i¡1 ¡1 P = K P i mod 128; resolution is taken in this direction. g Let us focus our attention on the ¯rst sixteen charac- 5) P = P0; ters given by \The development". On substituting ASCII codes for these characters, and 6) write P ; arranging them in the form of a matrix, we get 2 3 3.3 Algorithm for Modinverse 84 109 6 7 1) read n, K; 6104 1117 6 7 6101 1127 6 7 2) ¯nd Kij , ¢; /* Kij are cofactors of the elements of 6 32 1097 P = 6 7 (1) K, and 4 is the determinant of K */ 6100 1017 6 7 6101 1107 3) ¯nd d such that (d4) mod 128 = 1;/* d is the mul- 4118 1165 tiplicative inverse of 4 */ 101 32 ¡1 4) K = (Kjid) mod 128; Let us take the key matrix K as 3.4 Algorithm for Modinverse 2 3 1) read n, K; 53 62 124 33 49 118 107 43 6 7 645 112 63 29 60 35 58 11 7 6 7 2) ¯nd Kij , 4; /* Kij are the cofactors of the elements 688 41 46 30 48 32 105 51 7 6 7 of K, and 4 is the determinant of K */ 647 99 36 42 112 59 27 61 7 K = 6 7 657 20 6 31 106 126 22 1257 3) ¯nd d such that (d4) mod 128 = 1;/* d is the mul- 6 7 656 37 113 52 3 54 105 21 7 tiplicative inverse of 4 */ 436 40 43 100 119 39 55 94 5 ¡1 14 81 23 50 34 70 7 28 4) K =(Kjid) mod 128; On multiplying the plaintext matrix with the key ma- 3.5 Algorithm for Interweave trix, we get the modi¯ed P , denoted by P 1, as 1) convert P i into binary bits; 2 3 2) construct [b ], i = 1 to n, j = 1 to 14; 27 112 ij 6 7 6 17 83 7 6 7 3) for j = 1 to 14 in Step 2 f 6 83 1137 6 7 k = b1j; 1 6108 41 7 P = 6 7 for i = 1 to n ¡ 1 6 37 25 7 6 7 f 6 38 86 7 bij = b(i+1)j; 4 59 61 5 g 127 11 bnj = k; g On converting the numbers in these two columns into International Journal of Network Security, Vol.11, No.1, PP.11{16, July 2010 14 binary form and constructing the matrix b, we get readily veri¯ed that KK¡1 mod 128 = K¡1K mod 128 = 2 3 I.
Load more

Recommended publications
  • Chapter 3 – Block Ciphers and the Data Encryption Standard
    Chapter 3 –Block Ciphers and the Data Cryptography and Network Encryption Standard Security All the afternoon Mungo had been working on Stern's Chapter 3 code, principally with the aid of the latest messages which he had copied down at the Nevin Square drop. Stern was very confident. He must be well aware London Central knew about that drop. It was obvious Fifth Edition that they didn't care how often Mungo read their messages, so confident were they in the by William Stallings impenetrability of the code. —Talking to Strange Men, Ruth Rendell Lecture slides by Lawrie Brown Modern Block Ciphers Block vs Stream Ciphers now look at modern block ciphers • block ciphers process messages in blocks, each one of the most widely used types of of which is then en/decrypted cryptographic algorithms • like a substitution on very big characters provide secrecy /hii/authentication services – 64‐bits or more focus on DES (Data Encryption Standard) • stream ciphers process messages a bit or byte at a time when en/decrypting to illustrate block cipher design principles • many current ciphers are block ciphers – better analysed – broader range of applications Block vs Stream Ciphers Block Cipher Principles • most symmetric block ciphers are based on a Feistel Cipher Structure • needed since must be able to decrypt ciphertext to recover messages efficiently • bloc k cihiphers lklook like an extremely large substitution • would need table of 264 entries for a 64‐bit block • instead create from smaller building blocks • using idea of a product cipher 1 Claude
    [Show full text]
  • Feistel Like Construction of Involutory Binary Matrices with High Branch Number
    Feistel Like Construction of Involutory Binary Matrices With High Branch Number Adnan Baysal1,2, Mustafa C¸oban3, and Mehmet Ozen¨ 3 1TUB¨ ITAK_ - BILGEM,_ PK 74, 41470, Gebze, Kocaeli, Turkey, [email protected] 2Kocaeli University, Department of Computer Engineering, Faculty of Engineering, Institute of Science, 41380, Umuttepe, Kocaeli, Turkey 3Sakarya University, Faculty of Arts and Sciences, Department of Mathematics, Sakarya, Turkey, [email protected], [email protected] August 4, 2016 Abstract In this paper, we propose a generic method to construct involutory binary matrices from a three round Feistel scheme with a linear round function. We prove bounds on the maximum achievable branch number (BN) and the number of fixed points of our construction. We also define two families of efficiently implementable round functions to be used in our method. The usage of these families in the proposed method produces matrices achieving the proven bounds on branch numbers and fixed points. Moreover, we show that BN of the transpose matrix is the same with the original matrix for the function families we defined. Some of the generated matrices are Maximum Distance Binary Linear (MDBL), i.e. matrices with the highest achievable BN. The number of fixed points of the generated matrices are close to the expected value for a random involution. Generated matrices are especially suitable for utilising in bitslice block ciphers and hash functions. They can be implemented efficiently in many platforms, from low cost CPUs to dedicated hardware. Keywords: Diffusion layer, bitslice cipher, hash function, involution, MDBL matrices, Fixed points. 1 Introduction Modern block ciphers and hash functions use two basic layers iteratively to provide security: confusion and diffusion.
    [Show full text]
  • Block Ciphers
    Block Ciphers Chester Rebeiro IIT Madras CR STINSON : chapters 3 Block Cipher KE KD untrusted communication link Alice E D Bob #%AR3Xf34^$ “Attack at Dawn!!” message encryption (ciphertext) decryption “Attack at Dawn!!” Encryption key is the same as the decryption key (KE = K D) CR 2 Block Cipher : Encryption Key Length Secret Key Plaintext Ciphertext Block Cipher (Encryption) Block Length • A block cipher encryption algorithm encrypts n bits of plaintext at a time • May need to pad the plaintext if necessary • y = ek(x) CR 3 Block Cipher : Decryption Key Length Secret Key Ciphertext Plaintext Block Cipher (Decryption) Block Length • A block cipher decryption algorithm recovers the plaintext from the ciphertext. • x = dk(y) CR 4 Inside the Block Cipher PlaintextBlock (an iterative cipher) Key Whitening Round 1 key1 Round 2 key2 Round 3 key3 Round n keyn Ciphertext Block • Each round has the same endomorphic cryptosystem, which takes a key and produces an intermediate ouput • Size of the key is huge… much larger than the block size. CR 5 Inside the Block Cipher (the key schedule) PlaintextBlock Secret Key Key Whitening Round 1 Round Key 1 Round 2 Round Key 2 Round 3 Round Key 3 Key Expansion Expansion Key Key Round n Round Key n Ciphertext Block • A single secret key of fixed size used to generate ‘round keys’ for each round CR 6 Inside the Round Function Round Input • Add Round key : Add Round Key Mixing operation between the round input and the round key. typically, an ex-or operation Confusion Layer • Confusion layer : Makes the relationship between round Diffusion Layer input and output complex.
    [Show full text]
  • Lecture Four
    Lecture Four Today’s Topics . Historic Symmetric ciphers . Modern symmetric ciphers . DES, AES . Asymmetric ciphers . RSA . Next class: Protocols Example Ciphers . Shift cipher: each plaintext characters is replaced by a character k to the right. (When k=3, it’s a Caesar cipher). “Watch out for Brutus!” => “Jngpu bhg sbe Oehghf!” . Only 25 choices! Not hard to break by brute force. Substitution Cipher: each character in plaintext is replaced by a corresponding character of ciphertext. E.g., cryptograms in newspapers. plaintext code: a b c d e f g h i f k l m n o p q r s t u v w x y z ciphertext code: m n b v c x z a s d f g h j k l p o i u y t r e w q . 26! Possible pairs. Is is really that hard to break? Substitution ciphers . The Caesar cipher has a small key space, but doesn’t create a statistical independence between the plaintext and the ciphertext. The best ciphers allow no statistical attacks, thereby forcing a brute force, exhaustive search; all the security lies with the key space. As cryptographic algorithms matured, the statistical independence between the plaintext and cipher text increased. Ciphers . The caesar cipher, hill cipher, and playfair cipher all work with a single alphabet for doing substitutions . They are monoalphabetic substitutions. A more complex (and more robust) alternative is to use different substitution mappings on various portions of the plaintext. Polyalphabetic substitutions. More ciphers . Vigenère cipher: each character of plaintext is encrypted with a different a cipher key.
    [Show full text]
  • Confusion and Diffusion
    Confusion and Diffusion Ref: William Stallings, Cryptography and Network Security, 3rd Edition, Prentice Hall, 2003 Confusion and Diffusion 1 Statistics and Plaintext • Suppose the frequency distribution of plaintext in a human-readable message in some language is known. • Or suppose there are known words or phrases that are used in the plaintext message. • A cryptanalysist can use this information to break a cryptographic algorithm. Confusion and Diffusion 2 Changing Statistics • Claude Shannon suggested that to complicate statistical attacks, the cryptographer could dissipate the statistical structure of the plaintext in the long range statistics of the ciphertext. • Shannon called this process diffusion . Confusion and Diffusion 3 Changing Statistics (p.2) • Diffusion can be accomplished by having many plaintext characters affect each ciphertext character. • An example of diffusion is the encryption of a message M=m 1,m 2,... using a an averaging: y n= ∑i=1,k mn+i (mod26). Confusion and Diffusion 4 Changing Statistics (p.3) • In binary block ciphers, such as the Data Encryption Standard (DES), diffusion can be accomplished using permutations on data, and then applying a function to the permutation to produce ciphertext. Confusion and Diffusion 5 Complex Use of a Key • Diffusion complicates the statistics of the ciphertext, and makes it difficult to discover the key of the encryption process. • The process of confusion , makes the use of the key so complex, that even when an attacker knows the statistics, it is still difficult to deduce the key. Confusion and Diffusion 6 Complex Use of a Key(p.2) • Confusion can be accomplished by using a complex substitution algorithm.
    [Show full text]
  • What You Should Know for the Final Exam
    MATC16 Cryptography and Coding Theory G´abor Pete University of Toronto Scarborough What you should know for the final exam Principles and goals of cryptography: Kerckhoff’s principle. Shannon’s confusion and diffusion. Possible attack situations (cipher- text only, chosen plaintext, etc.). Possible goals of attacker, and the corresponding tasks of cryptography (confidentiality, data integrity, authentication, non-repudiation). [Chap- ter 1, plus page 38 and http://en.wikipedia.org/wiki/Confusion_and_diffusion for diffusion & confusion.] Classical cryptosystems: Number theory basics: infinitely many primes exist, basics of modular arithmetic, extended Euclidean algorithm, solving ax+by = d, inverting numbers and matrices (mod n). [Sections 3.1-3 and 3.8.] Shift and affine ciphers. Their ciphertext only and known plaintext attacks. Composition of two affine ciphers is again an affine cipher. [Sections 2.1-2.] Substitution ciphers in general. [Section 2.4] Vigen`ere cipher. Known plaintext attack. Ciphertext only: finding the key length, then frequency analysis. [Section 2.3.] Hill cipher. Known plaintext attack. [Section 2.7.] One-time pad. LFSR sequences. Known plaintext attack, finding the recursion. [Sections 2.9 and 11.] Basics of Enigma. [Section 2.12, up to middle of page 53.] The DES: Feistel systems, simplified and real DES (without the exact expansion functions and S-boxes and permutations, of course), how decryption works in these DES versions. How the extra parity check bits in the real DES key ensure error detection. How confusion and diffusion are fulfilled in DES. [Sections 4.1-2 and 4.4.] Double and Triple DES. Meet-in-the-middle attack. (I mentioned here that one can organize the two lists of length n and find a match between them in almost linear time (n log n) instead of the naive approach that would give only n2, and hence would ruin the attack completely.
    [Show full text]
  • A Lightweight Encryption Algorithm for Secure Internet of Things
    Pre-Print Version, Original article is available at (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 8, No. 1, 2017 SIT: A Lightweight Encryption Algorithm for Secure Internet of Things Muhammad Usman∗, Irfan Ahmedy, M. Imran Aslamy, Shujaat Khan∗ and Usman Ali Shahy ∗Faculty of Engineering Science and Technology (FEST), Iqra University, Defence View, Karachi-75500, Pakistan. Email: fmusman, [email protected] yDepartment of Electronic Engineering, NED University of Engineering and Technology, University Road, Karachi 75270, Pakistan. Email: firfans, [email protected], [email protected] Abstract—The Internet of Things (IoT) being a promising and apply analytics to share the most valuable data with the technology of the future is expected to connect billions of devices. applications. The IoT is taking the conventional internet, sensor The increased number of communication is expected to generate network and mobile network to another level as every thing mountains of data and the security of data can be a threat. The will be connected to the internet. A matter of concern that must devices in the architecture are essentially smaller in size and be kept under consideration is to ensure the issues related to low powered. Conventional encryption algorithms are generally confidentiality, data integrity and authenticity that will emerge computationally expensive due to their complexity and requires many rounds to encrypt, essentially wasting the constrained on account of security and privacy [4]. energy of the gadgets. Less complex algorithm, however, may compromise the desired integrity. In this paper we propose a A. Applications of IoT: lightweight encryption algorithm named as Secure IoT (SIT).
    [Show full text]
  • Stream and Block Ciphers
    Symmetric Cryptography Block Ciphers and Stream Ciphers Stream Ciphers K Seeded by a key K the stream cipher Stream ⃗z generates a random bit-stream z. Cipher A stream of plain-text bits p is XORed with the pseudo-random stream to obtain the cipher text stream c ⃗c=⃗p⊕⃗z and ⃗p=⃗c⊕⃗z ⃗c cipher text ⃗p plain text The same stream generator (using the same seed) ⃗z key stream used for both encryption and decryption Stream Ciphers K →¯zk ¯c=¯p⊕¯z k ¯ci=¯pi ⊕¯z k ¯c j=¯p j ⊕¯zk Attacker has access to ¯ci and ¯c j ¯ci⊕¯c j=(¯pi⊕¯zk )⊕(¯p j⊕¯z k)=¯pi⊕ ¯p j ● XORing two cipher-texts encrypted using the same seed results in XOR of corresponding plain-texts ● Redundancy in plain-text structure can be easily used to determine both plain- texts ● And hence, the key stream ● Never reuse seed? ● Impractical ● Extend seed using an initial value (IV) which can be sent in the clear ● Never reuse IV Block Ciphers ● C=E(P,K) ● P=D(C,K) ● E() and D() are algorithms ● P is a block of “plain text” (m bits) ● C is the corresponding “cipher text” (also m bits) ● K is the secret key (k bits long) ● (k,m) block cipher – k-bit keysize, m-bit blocksize ● (m+k)-bit input, m-bit output Desired Properties ● The most efficient attack should be the brute-force attack (complexity depends only on key length) ● Knowledge of any number of plain-cipher text pairs, still does not reveal any information regarding any bit of the key.
    [Show full text]
  • Applied Cryptography and Data Security
    Lecture Notes APPLIED CRYPTOGRAPHY AND DATA SECURITY (version 2.5 | January 2005) Prof. Christof Paar Chair for Communication Security Department of Electrical Engineering and Information Sciences Ruhr-Universit¨at Bochum Germany www.crypto.rub.de Table of Contents 1 Introduction to Cryptography and Data Security 2 1.1 Literature Recommendations . 3 1.2 Overview on the Field of Cryptology . 4 1.3 Symmetric Cryptosystems . 5 1.3.1 Basics . 5 1.3.2 A Motivating Example: The Substitution Cipher . 7 1.3.3 How Many Key Bits Are Enough? . 9 1.4 Cryptanalysis . 10 1.4.1 Rules of the Game . 10 1.4.2 Attacks against Crypto Algorithms . 11 1.5 Some Number Theory . 12 1.6 Simple Blockciphers . 17 1.6.1 Shift Cipher . 18 1.6.2 Affine Cipher . 20 1.7 Lessons Learned | Introduction . 21 2 Stream Ciphers 22 2.1 Introduction . 22 2.2 Some Remarks on Random Number Generators . 26 2.3 General Thoughts on Security, One-Time Pad and Practical Stream Ciphers 27 2.4 Synchronous Stream Ciphers . 31 i 2.4.1 Linear Feedback Shift Registers (LFSR) . 31 2.4.2 Clock Controlled Shift Registers . 34 2.5 Known Plaintext Attack Against Single LFSRs . 35 2.6 Lessons Learned | Stream Ciphers . 37 3 Data Encryption Standard (DES) 38 3.1 Confusion and Diffusion . 38 3.2 Introduction to DES . 40 3.2.1 Overview . 41 3.2.2 Permutations . 42 3.2.3 Core Iteration / f-Function . 43 3.2.4 Key Schedule . 45 3.3 Decryption . 47 3.4 Implementation . 50 3.4.1 Hardware .
    [Show full text]
  • A Comprehensive Study of Various High Security Encryption Algorithms
    © 2019 JETIR March 2019, Volume 6, Issue 3 www.jetir.org (ISSN-2349-5162) A COMPREHENSIVE STUDY OF VARIOUS HIGH SECURITY ENCRYPTION ALGORITHMS 1J T Pramod, 2N Gayathri, 3N Jayaram, 4T Geethanjali, 5M Anusha 1Assistant Professor, 2,3,4,5Student 1Department of Electronics and Communication Engineering 1Aditya College of Engineering, Madanapalle, Andhra Pradesh, India Abstract: It is well known that with the rapid technological development in the areas of multimedia and data communication networks, the data stored in image format has become so common and necessary. As digital images have become a vital mode of information transfer for confidential data, security has become a vital issue. Images containing sensitive data can be encrypted to another suitable form in order to preserve the information in a secure way. Modern cryptography provides various essential methods for securing the vital information available in the multimedia form. This paper outlines various high secure encryption algorithms. Considerable amount of research has been carried out in confusion and diffusion steps of cryptography using various chaotic maps for image encryption. The chaos-based image encryption scheme employs various pixel mapping methods applied during the confusion and diffusion stages of encryption. Following the same steps of cryptography but performing pixel scrambling and substitution using Genetic Algorithm and DNA Sequence respectively is another way to securely encrypt an image. Generalized Singular Value Decomposition a matrix decomposition method a generalized version of Singular Value Decomposition suits well for encrypting images. Using the similar guidelines, by employing Quadtree Decomposition to partially encrypt an image is yet another method used to secure a portion of an image containing confidential information.
    [Show full text]
  • Applications of Search Techniques to Cryptanalysis and the Construction of Cipher Components. James David Mclaughlin Submitted F
    Applications of search techniques to cryptanalysis and the construction of cipher components. James David McLaughlin Submitted for the degree of Doctor of Philosophy (PhD) University of York Department of Computer Science September 2012 2 Abstract In this dissertation, we investigate the ways in which search techniques, and in particular metaheuristic search techniques, can be used in cryptology. We address the design of simple cryptographic components (Boolean functions), before moving on to more complex entities (S-boxes). The emphasis then shifts from the construction of cryptographic arte- facts to the related area of cryptanalysis, in which we first derive non-linear approximations to S-boxes more powerful than the existing linear approximations, and then exploit these in cryptanalytic attacks against the ciphers DES and Serpent. Contents 1 Introduction. 11 1.1 The Structure of this Thesis . 12 2 A brief history of cryptography and cryptanalysis. 14 3 Literature review 20 3.1 Information on various types of block cipher, and a brief description of the Data Encryption Standard. 20 3.1.1 Feistel ciphers . 21 3.1.2 Other types of block cipher . 23 3.1.3 Confusion and diffusion . 24 3.2 Linear cryptanalysis. 26 3.2.1 The attack. 27 3.3 Differential cryptanalysis. 35 3.3.1 The attack. 39 3.3.2 Variants of the differential cryptanalytic attack . 44 3.4 Stream ciphers based on linear feedback shift registers . 48 3.5 A brief introduction to metaheuristics . 52 3.5.1 Hill-climbing . 55 3.5.2 Simulated annealing . 57 3.5.3 Memetic algorithms . 58 3.5.4 Ant algorithms .
    [Show full text]
  • What You Should Know for the Midterm Test
    MATC16 Cryptography and Coding Theory G´abor Pete University of Toronto Scarborough What you should know for the midterm test Principles and goals of cryptography: Kerckhoff’s principle. Shannon’s confusion and diffusion. Possible attack situations (cipher- text only, chosen plaintext, etc.). Possible goals of attacker, and the corresponding tasks of cryptography (confidentiality, data integrity, authentication, non-repudiation). [Chap- ter 1, plus page 38 and http://en.wikipedia.org/wiki/Confusion_and_diffusion for diffusion & confusion.] Classical cryptosystems: Number theory basics: infinitely many primes exist, basics of modular arithmetic, extended Euclidean algorithm, solving ax+by = d, inverting numbers and matrices (mod n). [Sections 3.1-3 and 3.8.] Shift and affine ciphers. Their ciphertext only and known plaintext attacks. Composition of two affine ciphers is again an affine cipher. [Sections 2.1-2.] Substitution ciphers in general. [Section 2.4] Vigen`ere cipher. Known plaintext attack. Ciphertext only: finding the key length, then frequency analysis. [Section 2.3.] Hill cipher. Known plaintext attack. [Section 2.7.] One-time pad. LFSR sequences. Known plaintext attack, finding the recursion. [Sections 2.9 and 11.] Basics of Enigma. [Section 2.12, up to middle of page 53.] The DES: Feistel systems, simplified and real DES (without the exact expansion functions and S-boxes and permutations, of course), how decryption works in these DES versions. How the extra parity check bits in the real DES key ensure error detection. How confusion and diffusion are fulfilled in DES. [Sections 4.1-2 and 4.4.] Double and Triple DES. Meet-in-the-middle attack. (I mentioned here that one can organize the two lists of length n and find a match between them in almost linear time (n log n) instead of the naive approach that would give only n2, and hence would ruin the attack completely.
    [Show full text]