DOCSLIB.ORG

Network Security and Cryptography

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Network Security and Cryptography EE 418: Network Security and Cryptography Homework 2 { Solutions Assigned: Tuesday, October 11, 2016, Due: Tuesday, October 25, 2016 Instructor: Tamara Bonaci Department of Electrical Engineering University of Washington, Seattle Problem 1 For each of the following pairs of integers (x; y), first determine whether x−1 mod y exists. Then find x−1 (mod y) if it exists. Show all work. (a) x = 5, y = 25 (b) x = 12, y = 29 (c) x = 24, y = 35 (d) x = 17, y = 101 (e) x = 87, y = 102 Solution: (a) x = 5; y = 25 There does not exist an inverse x−1 (mod y) for a pair x = 5; y = 25, since x = 5 y = 25 = 52; hence gcd(x = 5; y = 25) = 5 6= 1 (b) x = 12; y = 29 There does exist an inverse x−1 (mod y) for a pair x = 12; y = 29, since gcd(x = 12; y = 29) = 1. Let's show that using the Eucliedan Algorithm: 12 = 0(29) + 12 29 = 2(12) + 5 12 = 2(5) + 2 5 = 2(2) + 1 2 = 2(1) + 0 Now, let's use the Extended Eucliedan Algorithm to find the inverse x−1 (mod y) for a pair x = 12; y = 29: 1 = 5 − 2(2) = 5 − 2[12 − 2(5)] = 5(5) − 2(12) = 5[29 − 2(12)] − 2(12) = 5(29) − 12(12) (1) From equation (1), it follows that: 12−1 = −12 (mod 29) = 17 (mod 29) 1 Solution: (c) x = 24; y = 35 There does exist an inverse x−1 (mod y) for a pair x = 24; y = 35, since gcd(x = 24; y = 35) = 1. Let's show that by factorizing x and y: x = 23 · 3 y = 5 · 7 (2) From (2), it follows that x and y do not have any common factors, hence gcd(x = 24; y = 35) = 1. Let's now use the Extended Euclidean Algorithm to find the inverse x−1 (mod y) for a pair x = 24; y = 35: 24 = 0(35) + 24 35 = 1(24) + 11 ! 11 = 35 − 1(24) 24 = 2(11) + 2 ! 2 = 24 − 2(11) 11 = 5(2) + 1 ! 1 = 11 − 5(2) 1 = 11 − 5(2) = 11 − 5[(24) − 2(11)] = 11(11) − 5(24) = 11[(35) − (24)] − 16(24) = 11(35) − 16(24) (3) From (3), it follows that: 24−1 = −16 (mod 35) = 19 (mod 35) (d) x = 17; y = 101 There does exist an inverse x−1 (mod y) for a pair x = 17; y = 101, since both 17 and 101 are prime numbers. Using the Extended Euclidean Algorithm to find the inverse x−1 (mod y) for a pair x = 17; y = 101 we get that 17−1 mod (101) = 6. (e) x = 87; y = 102 There does not exist an inverse x−1 (mod y) for a pair x = 87; y = 102, since gcd(x = 87; y = 102) = 3. Let's show that by factorizing x and y: x = 87 = 29 · 3 y = 102 = 2 · 3 · 17 (4) From (4), it follows that x and y do have common factor, d = 3, hence gcd(x = 87; y = 102) = 3. Problem 2 (Stinson, Problem 1.2) Suppose that a, m > 0 and a 6≡ 0 (mod m). Prove that (−a) mod m = m − a(modm): (5) Solution I: In order to prove the statement given by equation (5), let's use the remainder theorem to represent a as: a = b · m + r (6) We next multiply both sides of equation (6) by -1 and rearrange the equation in the following way: −a = −b · m − r = −b · m + m − m − r = −(b + 1) · m + m − r (7) 2 Equation (7) is, however, nothing but another application of the remainder theorem: −a = − (b + 1) m + (m − r) = q1 · m + r1 (8) | {z } | {z } q1 r1 Using the fact that a(modm) ≡ r, we can write: −a mod m = r1 = m − r = m − a mod m (9) Equation (9) completes the proof. Solution II: Part one: Suppose that a; m > 0 and a 6≡ 0 mod m, hence for some integers q and r, where 0 ≤ r < m, we can write a as a = mq + r, according to division theorem. By simple algebra, −a = −mq − r, which is −a = m(−q) − r. Then we take mod m on both side. (−a) mod m = (−r) mod m. However, it is equivalent to (−a) mod m = m − r mod m. Since 0 < r < m, then 0 < m − r < m, and m − r mod m = m − r, as the result (−a) mod m = m − r. Part two: On the other hand, since a = mq + r, then a mod m = r, hence −(a mod m) = −r. By adding m on both side, we get m − (a mod m) = m − r By comparing result from both part, (−a) mod m = m − r, m − (a mod m) = m − r, we conclude they are equal, and hence it completes the proof. Problem 3 (Stinson, Problem 1.6) If an encryption function eK is identical to the decryption function dK , then the key K is said to be an involutory key. Find all the involutory keys in the Shift Cipher over Z26. Solution: In order to find all involutory keys in Shift Cipher over Z26, let's first represent the 5-tuple that defines the cipher: P = C = K = Z26 y = eK (x) = (x + K) mod 26 x = dK (y) = (y − K) mod 26 (10) By definition, a cryptographic key K is involutory key, if: eK (x) = dK (y) (11) 3 From equation (11), if follows that: x = eK (eK (x)) = eK [(x + K) mod 26] = [(x + K) mod 26 + K] mod 26 = (x + 2K) mod 26 (12) From equation (12), the condition for a key to be an involutory key in Shift Cipher over Z26 is given as: 2 · K mod 26 = 0 (13) From equation(13), we conclude that there are two involutory keys in Shift Cipher over Z26: K1 = 0; K2 = 13 Problem 4 (Stinson, Problem 1.7) Determine the number of valid keys (a; b) in an Affine cipher over Zm for m = 30; 100 and 1225. Solution: Let's start solving this problem by recalling the definition of the Affine cipher: P = C = Zm K = f(a; b): a 2 Zm and gcd(a; m) = 1; b 2 Zmg y = eK (x) = (ax + b) mod m −1 x = dK (y) = a (y − b) mod m (14) From equation (14), it follows that the number of keys in an Affine Cipher over Zm depends on the cardinality ~ ~ of the subset Zm, that contains all the elements x 2 Zm, such that gcd(x; m) = 1. The cardinality of the ~ subset Zm is determined by the Euler totient (φ) function: n Y ei ei−1 φ(m) = (pi − pi ) (15) i=1 Qn ei where i=1 pi represents a unique prime factorization of number m. From equation (15), the number of distinct keys in an affine cipher over Zm is defined as: n Y ei ei−1 # of distinct keys = N(m) = m · φ(m) = m (pi − pi ) (16) i=1 4 For m = 30; 100; 1225, we can write: 30 = 2 · 3 · 5 n Y ei φ(30) = pi = (2 − 1) · (3 − 1) · (5 − 1) = 8 i=1 n Y ei ei−1 N(30) = m · φ(m) = m (pi − pi ) = 30 · 8 = 240 i=1 100 = 22 · 52 n Y ei 2 2 φ(100) = pi = (2 − 2) · (5 − 5) = 2 · 20 = 40 i=1 n Y ei ei−1 3 N(100) = m · φ(m) = m (pi − pi ) = 100 · 40 = 4 · 10 i=1 1225 = 52 · 72 n Y ei 2 2 φ(1225) = pi = (5 − 5) · (7 − 7) = 20 · 42 = 840 i=1 n Y ei ei−1 N(1225) = m · φ(m) = m (pi − pi ) = 1225 · 840 = 1029000 i=1 Problem 5 (Stinson, Problem 1.10) Suppose K = (5, 21) is a key in an Affine Cipher over Z29. 0 0 0 0 (a) Express the decryption function dK (y) in the form dK = a y + b , where a ; b 2 Z29. (b) Prove that dK (eK (x)) = x for all x 2 Z29. Solution: An Affine Cipher over Z29 is defined by the following 5-tuple: P = C = Z29 K = f(a; b): a 2 Z29 and gcd(a; 29) = 1; b 2 Z29g y = eK (x) = (ax + b) mod 29 −1 x = dK (y) = a (y − b) mod 29 (17) (a) In order to express the decryption rule (equation (17)) in the form: 0 0 0 0 dK (y) = a y + b ; where a ; b 2 Z29 (18) let's first find the multiplicative inverse of a = 5 over Z29 using Extended Euclidean Algorithm: 29 = 5(5) + 4 5 = 1(4) + 1 1 = 5 − 1(4) 1 = 5 − 1(29 − 5(5)) 1 = 6(5) − 29 (19) 5 From equation (19), it follows that a−1 = 6. We can now write: −1 dK (x) = a (y − b) mod 29 = (a−1y − a−1b) mod 29 = (6y − 126) mod 29 ≡ (6y + 19) mod 29 (20) Therefore, decryption rule dK (y) can be expressed as dK (y) = (6y + 19) mod 29 (b)We next prove that dK (eK (x)) = x for all x 2 Z29. In order to prove that dK (eK (x)) = x, let's express dK (eK (x)) in the following way: dK (eK (x)) = dk[(5x + 21) mod 29] = 6[(5x + 21) mod 29] + 19 (mod 29) = 30x + 126 + 19 (mod 29) = 30x + 145 (mod 29) = 30x + 145 ≡ x (mod 29) (21) Equation (21) completes the proof.
Load more

Recommended publications
  • Amy Bell Abilene, TX December 2005
    Compositional Cryptology Thesis Presented to the Honors Committee of McMurry University In partial fulfillment of the requirements for Undergraduate Honors in Math By Amy Bell Abilene, TX December 2005 i ii Acknowledgements I could not have completed this thesis without all the support of my professors, family, and friends. Dr. McCoun especially deserves many thanks for helping me to develop the idea of compositional cryptology and for all the countless hours spent discussing new ideas and ways to expand my thesis. Because of his persistence and dedication, I was able to learn and go deeper into the subject matter than I ever expected. My committee members, Dr. Rittenhouse and Dr. Thornburg were also extremely helpful in giving me great advice for presenting my thesis. I also want to thank my family for always supporting me through everything. Without their love and encouragement I would never have been able to complete my thesis. Thanks also should go to my wonderful roommates who helped to keep me motivated during the final stressful months of my thesis. I especially want to thank my fiancé, Gian Falco, who has always believed in me and given me so much love and support throughout my college career. There are many more professors, coaches, and friends that I want to thank not only for encouraging me with my thesis, but also for helping me through all my pursuits at school. Thank you to all of my McMurry family! iii Preface The goal of this research was to gain a deeper understanding of some existing cryptosystems, to implement these cryptosystems in a computer programming language of my choice, and to discover whether the composition of cryptosystems leads to greater security.
    [Show full text]
  • Affine Cipher Project 1 Introduction
    Affine Cipher Project 141KECBZ0H5CRK1HUZK1CGPCR.5PUGUZU1WCU.CM1CUBHUCAK.6.Z5WCP1RK1UCH5 WC0EPU1KECU.C141KEC.UB1KXC,,RBHKV1PCWGRQ15P7CHCUHV1C.6CU9.CRGUG1P Directions: • Answer all numbered questions completely. • Show non-trivial work, and put your final answer in the box provided. • Questions without boxes should be answered in complete sentences in the space provided. 1 Introduction Cryptography is the study of secret codes, or the secure transmission of information that nobody except the desired recipient can read. By the end of this project, you will be able to decipher the quote printed above. The mathematical study of ciphers will lead us through a world in which the number line is a closed curve, and fractions do not exist. This project is designed to help you to: • read and understand definitions and notation • observe patterns and generalize • think logically, analytically, and abstractly • express problems and solutions precisely • follow examples • combine ideas to solve problems and create applications 1 2 Caesar Cipher A cipher is a function or algorithm for translating plaintext into encrypted ciphertext. Throughout history, governments and merchants have used ciphers to safely transmit sensitive information. Julius Caesar is said to have use a simple system of substituting each letter with the letter 3 spots over, wrapping around the alphabet if necessary. Here is the mapping: 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 Z A B C Space and punctuation are discarded.
    [Show full text]
  • The Mathemathics of Secrets.Pdf
    THE MATHEMATICS OF SECRETS THE MATHEMATICS OF SECRETS CRYPTOGRAPHY FROM CAESAR CIPHERS TO DIGITAL ENCRYPTION JOSHUA HOLDEN PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Copyright c 2017 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TR press.princeton.edu Jacket image courtesy of Shutterstock; design by Lorraine Betz Doneker All Rights Reserved Library of Congress Cataloging-in-Publication Data Names: Holden, Joshua, 1970– author. Title: The mathematics of secrets : cryptography from Caesar ciphers to digital encryption / Joshua Holden. Description: Princeton : Princeton University Press, [2017] | Includes bibliographical references and index. Identifiers: LCCN 2016014840 | ISBN 9780691141756 (hardcover : alk. paper) Subjects: LCSH: Cryptography—Mathematics. | Ciphers. | Computer security. Classification: LCC Z103 .H664 2017 | DDC 005.8/2—dc23 LC record available at https://lccn.loc.gov/2016014840 British Library Cataloging-in-Publication Data is available This book has been composed in Linux Libertine Printed on acid-free paper. ∞ Printed in the United States of America 13579108642 To Lana and Richard for their love and support CONTENTS Preface xi Acknowledgments xiii Introduction to Ciphers and Substitution 1 1.1 Alice and Bob and Carl and Julius: Terminology and Caesar Cipher 1 1.2 The Key to the Matter: Generalizing the Caesar Cipher 4 1.3 Multiplicative Ciphers 6
    [Show full text]
  • With Answers
    Module 10.4: Exploring Some Historical Ciphers Gregory V. Bard January 30, 2020 • This is a practice workbook the Affine Cipher, touching on some shift ciphers (such as the Caesar cipher, the ROT-13 cipher), the Atbash cipher, and the Vigen`ereCipher. • The Affine Cipher was introduced in Module 10-2: The Basics of Modular Arithmetic, and some skills from Module 10-3: Modular Inverses are needed. • There is a with-answers version, and a without-answers version. • In the with-answers version of this workbook, the black ink represents the question, and the blue ink represents the answer. Question 10-4-1 Suppose Boris normally communicates with his handlers in Moscow using the affine cipher, and the encryption function c = fB(p) = 7p + 20 mod 26, while Natasha normally uses c = fN (p) = 11p + 8 mod 26. They have a very secret message to send back to Moscow, so they're going to encrypt the message twice, for added security. As you can probably guess, this is equivalent to using the affine cipher only once, but with a different function. • If Boris encrypts the plaintext first, followed by Natasha second, then what would BAT encrypt to? (B, A, T) becomes (1, 0, 19) and encrypts to (fB(1); fB(0); fB(19)) ≡ (1; 20; 23). We encrypt again to (fN (1); fN (20); fN (23)) ≡ (19; 20; 1), which becomes (T, U, B) or TUB. • If Natasha encrypts the plaintext first, followed by Boris second, then what would BAT encrypt to? (B, A, T) becomes (1, 0, 19) and encrypts to (fN (1); fN (0); fN (19)) ≡ (19; 8; 9).
    [Show full text]
  • MAT 302: LECTURE SUMMARY Last Class We Discussed Two Classical Ciphers, Both of Which Turned out to Be Rather Insecure (As Evide
    MAT 302: LECTURE SUMMARY Last class we discussed two classical ciphers, both of which turned out to be rather insecure (as evidenced by your cracking them manually during lecture): • The Scytale cipher • The Caesar (aka shift) cipher We began today’s lecture by writing the latter down in mathematical notation. To this end, it is convenient to use the set A = f0; 1; 2;:::; 25g to represent the English alphabet, i.e. 0 represents A, 1 represents B, etc. The Caesar Cipher. The Caesar cipher (or shift cipher) consists of a key k 2 Z, an encryption function ek : A −! A x 7−! x + k (mod 26) and a decryption function dk : A −! A x 7−! x − k (mod 26): The Caesar cipher is insecure because the space of all possible keys is rather small (how many are there?), so it is a trivial matter for Oscar to check all possible keys. We next discussed a variant of this, whose key space is somewhat larger: the affine cipher. The Affine Cipher. The affine cipher consists of a key (a; b) 2 Z2, an encryption function e(a;b) : A −! A x 7−! ax + b (mod 26) and a decryption function d(a;b) : A −! A x 7−! a−1(x − b) (mod 26) Actually, as stated this isn’t well-defined: a−1 doesn’t always exist (mod 26). Recall that a−1 is the element of A satisfying a−1a ≡ 1 (mod 26): For example, 0 has no (multiplicative) inverse (mod 26). Less trivially, 2 has no multiplicative inverse.
    [Show full text]
  • An Introduction to Cryptography
    abstract examples cryptanalysis harder cryptography schemes An Introduction to Cryptography Joe Fields http://www.southernct.edu/~fields/ Joe Fields Cryptography abstract examples Terminology cryptanalysis harder cryptography schemes Cryptography is the study of "secret writing." This is the only branch of mathematics to be designated by the U.S. government as export-controlled. Cryptographic knowledge is considered to be "war materials!" While we won't head off into TOP SECRET territory we will have a bit of fun working out how to make (and to break) good secret codes. Joe Fields Cryptography abstract examples Terminology cryptanalysis harder cryptography schemes the enigma Joe Fields Cryptography abstract examples Terminology cryptanalysis harder cryptography schemes WACs Joe Fields Cryptography Cryptology means \the study of secrets" practically speaking, they are synonyms... abstract examples Terminology cryptanalysis harder cryptography schemes Cryptography or Cryptology? Cryptography means \secret writing" Joe Fields Cryptography practically speaking, they are synonyms... abstract examples Terminology cryptanalysis harder cryptography schemes Cryptography or Cryptology? Cryptography means \secret writing" Cryptology means \the study of secrets" Joe Fields Cryptography abstract examples Terminology cryptanalysis harder cryptography schemes Cryptography or Cryptology? Cryptography means \secret writing" Cryptology means \the study of secrets" practically speaking, they are synonyms... Joe Fields Cryptography Bob (the recipient) but they are afraid that. Eve (the eavesdropper) will snoop on them and learn their secrets. abstract examples Terminology cryptanalysis harder cryptography schemes Cast of Characters Alice (the sender) wants to send a message to. Joe Fields Cryptography Eve (the eavesdropper) will snoop on them and learn their secrets. abstract examples Terminology cryptanalysis harder cryptography schemes Cast of Characters Alice (the sender) wants to send a message to.
    [Show full text]
  • Cryptography
    Cryptography Lecture 02 Byte-wise Shift Cipher Byte-wise Shift Cipher I Instead of a; b; c; d;:::; z have (for example) 0000, 0001,:::,1111. I Works for an alphabet of bytes rather than (English, lowercase) letters I Data in a computer is stored this way anyway. So works natively for arbitrary data! I Use XOR instead of modular addition. Fast! I Decode and Encode are both XOR. I Essential properties still hold Hexadecimal (base 16) Hex Bits (\nibble") Decimal Hex Bits (\nibble") Decimal 0 0000 0 8 1000 8 1 0001 1 9 1001 9 2 0010 2 A 1010 10 3 0011 3 B 1011 11 4 0100 4 C 1100 12 5 0101 5 D 1101 13 6 0110 6 E 1110 14 7 0111 7 F 1111 15 Hexadecimal (base 16) Notation: 0x before a string of f0; 1;:::; 9; A; B; C; D; E; F g means that the string will be base 16. I 0x10 I 0x10 = 16*1 + 0 = 16 I 0x10 = 0001 0000 I 0xAF I 0xAF = 16*A + F = 16*10 + 15 = 175 I 0xAF = 1010 1111 ASCII I Characters (often) represented in ASCII with TWO hex-digits. I Potentially 256 characters via f0;:::; 9; A;:::; F g × f0;:::; 9; A;:::; F g I Only use 128 characters via f0;::: 8g × f0;:::; 9; A;:::; F g ASCII I `1' = 0x31 = 0011 0001 I `F' = 0x46 = 0100 0110 Useful observations I Only 128 valid ASCII chars (128 bytes invalid) I 0x20-0x7E printable I 0x41-0x7A includes upper/lowercase letters I Uppercase letters begin with 0x4 or 0x5 I Lowercase letters begin with 0x6 or 0x7 Byte-wise shift cipher I M = fstrings of bytesg I Gen: choose uniform byte k 2 K = f0,.
    [Show full text]
  • Shift Cipher Substitution Cipher Vigenère Cipher Hill Cipher
    Lecture 2 Classical Cryptosystems Shift cipher Substitution cipher Vigenère cipher Hill cipher 1 Shift Cipher • A Substitution Cipher • The Key Space: – [0 … 25] • Encryption given a key K: – each letter in the plaintext P is replaced with the K’th letter following the corresponding number ( shift right ) • Decryption given K: – shift left • History: K = 3, Caesar’s cipher 2 Shift Cipher • Formally: • Let P=C= K=Z 26 For 0≤K≤25 ek(x) = x+K mod 26 and dk(y) = y-K mod 26 ʚͬ, ͭ ∈ ͔ͦͪ ʛ 3 Shift Cipher: An Example ABCDEFGHIJKLMNOPQRSTUVWXYZ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 • P = CRYPTOGRAPHYISFUN Note that punctuation is often • K = 11 eliminated • C = NCJAVZRCLASJTDQFY • C → 2; 2+11 mod 26 = 13 → N • R → 17; 17+11 mod 26 = 2 → C • … • N → 13; 13+11 mod 26 = 24 → Y 4 Shift Cipher: Cryptanalysis • Can an attacker find K? – YES: exhaustive search, key space is small (<= 26 possible keys). – Once K is found, very easy to decrypt Exercise 1: decrypt the following ciphertext hphtwwxppelextoytrse Exercise 2: decrypt the following ciphertext jbcrclqrwcrvnbjenbwrwn VERY useful MATLAB functions can be found here: http://www2.math.umd.edu/~lcw/MatlabCode/ 5 General Mono-alphabetical Substitution Cipher • The key space: all possible permutations of Σ = {A, B, C, …, Z} • Encryption, given a key (permutation) π: – each letter X in the plaintext P is replaced with π(X) • Decryption, given a key π: – each letter Y in the ciphertext C is replaced with π-1(Y) • Example ABCDEFGHIJKLMNOPQRSTUVWXYZ πBADCZHWYGOQXSVTRNMSKJI PEFU • BECAUSE AZDBJSZ 6 Strength of the General Substitution Cipher • Exhaustive search is now infeasible – key space size is 26! ≈ 4*10 26 • Dominates the art of secret writing throughout the first millennium A.D.
    [Show full text]
  • Name: SOLUTIONS SID
    EE 418 Midterm 1 University of Washington, Seattle Fall 2004 Name: SOLUTIONS SID#: 1. Read the questions carefully before solving them. 2. Attempt all questions. 3. You may not use any electronic device for calculations. 4. You are allowed to use text book, classnotes, homework problems and solutions. It is a good idea to solve problems in the order of increasing di±culty. 5. You might ¯nd the following useful: Table 1: A correspondence between alphabetic characters and numbers A B C D E F G H I J K L M 0 1 2 3 4 5 6 7 8 9 10 11 12 N O P Q R S T U V W X Y Z 13 14 15 16 17 18 19 20 21 22 23 24 25 µ ¶¡1 µ ¶ a b d ¡b = (ad ¡ bc)¡1 mod 26. c d ¡c a ax ´ b mod n has a unique solution only if gcd(a,n)=1. a b n a ´ b mod n can be simpli¯ed as m ´ m mod m where m is a divisor of a; b; n. Good Luck and Enjoy! 1 Problem 1: 1. Homer Simpson wants to impress the community by proposing mod 27 instead of mod 26 for A±ne Cipher. Lisa however says mod 29 would be better. Can you as the moderator decide whether there is any di®erence in the claims, and whether father's claim is better than daughter's or vice versa? Justify your decision. (Hint: how many keys are possible?) 10 points.
    [Show full text]
  • Classic Crypto
    Classic Crypto Classic Crypto 1 Overview We briefly consider the following classic (pen and paper) ciphers o Transposition ciphers o Substitution ciphers o One-time pad o Codebook These were all chosen for a reason o We see same principles in modern ciphers Classic Crypto 2 Transposition Ciphers In transposition ciphers, we transpose (scramble) the plaintext letters o The scrambled text is the ciphertext o The transposition is the key Corresponds to Shannon’s principle of diffusion (more about this later) o This idea is widely used in modern ciphers Classic Crypto 3 Scytale Spartans, circa 500 BC Wind strip of leather around a rod Write message across the rod T H E T I M E H A S C O M E T H E W A L R U S S A I D T O T A L K O F M A N Y T H I N G S When unwrapped, letters are scrambled TSATAHCLONEORTYTMUATIESLHMTS… Classic Crypto 4 Scytale Suppose Alice and Bob use Scytale to encrypt a message o What is the key? o How hard is it for Trudy to break without key? Suppose many different rod diameters are available to Alice and Bob… o How hard is it for Trudy to break a message? o Can Trudy attack messages automatically—without manually examining each putative decrypt? Classic Crypto 5 Columnar Transposition Put plaintext into rows of matrix then read ciphertext out of columns For example, suppose matrix is 3 x 4 o Plaintext: SEETHELIGHT o Ciphertext: SHGEEHELTTIX Same effect as Scytale o What is the key? Classic Crypto 6 Keyword Columnar Transposition For example o Plaintext: CRYPTOISFUN o Matrix 3 x 4 and keyword MATH o Ciphertext:
    [Show full text]
  • EE 418 Network Security and Cryptography Lecture #5 Outline: 1
    EE 418 Network Security and Cryptography Lecture #5 October 13, 2016 Polyalphabetic Classical cryptosystems. Introduction to Cryptanalysis. Lecture notes prepared by Professor Radha Poovendran. Tamara Bonaci Department of Electrical Engineering University of Washington, Seattle Outline: 1. Review: The Vigen`ereCipher 2. The Hill Cipher 3. The Permutation Cipher 4. Introduction to Cryptanalysis 5. Cryptanalysis of the Shift Cipher 6. Remarks on Letter Distribution of the English Language 1 Review: The Vigen`ereCipher Last time, we talked about The Vigen`ere cipher, and we said that it is the first polyalphabetic cryptosystem that we are encountering in this course. A polyalphabetic cryptosystem is a cryptosystem where multiple alphabetic characters are encrypted at a time. In other words, each plaintext element is equivalent to m alphabetic characters. The idea behind this cryptosystem is to use a vector of m keys, i.e., K = (K1;K2; ::; Km). m m P = C = K = (Z26) where (Z26) is an m-tuple: y = eK (x1; x2; ::; xm) = (x1 + K1; x2 + K2; ::; xm + Km) mod 26; (1) dK (y1; y2; ::; ym) = (y1 − K1; y2 − K2; ::; ym − Km) mod 26: (2) Note: The difference between the Vigen`erecipher and the shift, substitution, and affine ciphers is that in the Vigen`erecipher each alphabetic character is not uniquely mapped to another alphabetic character. Example Let the plaintext be vector, and let m = 4; K = (2; 4; 6; 7). From the correspondence table we have x = (21; 4; 2; 19; 14; 17), and the cipher is shown in Table 1. PLAINTEXT: 21 4 2 19 14 17 KEY: 2 4 6 7 2 4 CIPHER: 23 8 8 0 16 21 XIIA QV To decrypt, we use the same keyword, but modulo subtraction is performed instead of modulo addition.
    [Show full text]
  • A Comparative Study of Classical Substitution Ciphers
    International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 3 Issue 9, September- 2014 A Comparative Study of Classical Substitution Ciphers Anjlee Verma Navjot Kaur School of Computer Engineering Department of CSE/IT Lovely Professional University CGC Jhanjeri Phagwara, Punjab Mohali, Punjab Abstract— with the rapid development in the technology, the Cryptography (also known as cryptology) is a study and call for security has also raised its pitch and Information practice of hiding information. It is the technique in which a Security has become an important issue during last decades. piece of raw data is taken, scrambled into gibberish Cryptography; emerged as a solution; has reserved its mathematically, yet allowing for decrypting back into the unvanquishable place in the field of security. The principle original plain data. In other words, we can say that it is an art objective guiding the design of any cryptographic algorithm of manipulating messages so that they become more secure. It must be the security it provides against unauthorized attack. consists of processes of encoding and decoding. But, the performance and cost implementation of the algorithms Cryptography includes the techniques for creating various are also those factors which we cannot ignore. So, there is systems, procedures or algorithms for secret writing. Whereas always a deemed necessity to analyze, standardize and represent cryptanalysis consists of the techniques of breaking them.[2] these algorithms to the future researchers and struggling
    [Show full text]