# Chapter 2 Homework 2-5, 7, 9-11, 13-18, 24. (9x + 2)(mod 26) y 1 1 (x 2)(mod 26) 3(x 2)(mod 26) U : y 1 = 3(20 2)(mod 26) 54(mod 26) 2(mod 26) c

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

Download "Chapter 2 Homework 2-5, 7, 9-11, 13-18, 24. (9x + 2)(mod 26) y 1 1 (x 2)(mod 26) 3(x 2)(mod 26) U : y 1 = 3(20 2)(mod 26) 54(mod 26) 2(mod 26) c"

## Transcription

1 Chapter 2 Homework 2-5, 7, 9-11, 13-18, The ciphertext UCR was encrypted using the affine function (9x + 2)(mod 26) Find the plaintext. First, we find the numerical values corresponding to UCR. U 20 C 2 R 17 If y 9x + 2(mod 26), then we need to find y 1. Now we can decrypt. y 1 1 (x 2)(mod 26) 9 3(x 2)(mod 26) U : y 1 3(20 2)(mod 26) 54(mod 26) 2(mod 26) c C : y 1 3(2 2)(mod 26) 0(mod 26) a R : y 1 3(17 2)(mod 26) 45(mod 26) 19(mod 26) t the plaintext is cat.

2 3. Encrypt howareyou using the affine function What is the decryption function? (5x + 7)(mod 26) First we assign numerical values to the letters. h, o, w, a, r, e, y, o, u 7, 14, 22, 0, 17, 4, 24, 14, 20 Then, we apply the function to each numerical value. ( ) 42 16(mod 26) Q ( ) 77 25(mod 26) Z ( ) (mod 26) N ( ) 7(mod 26) H ( ) 92 14(mod 26) O ( ) 27 1(mod 26) B ( ) (mod 26) X ( ) 107 3(mod 26) D howareyou QZNHOBXZD As for the decryption function... y 5x + 7 x 5y + 7 y 1 (x 7) 5 y 1 1 (x 7)(mod 26) 5 But, we can t have this as we need to find x such that 5x 1(mod 26) Here, x 21 and we have our decryption function y 1 21(x 7)(mod 26) 21x 147(mod 26) 21x + 9(mod 26)

3 4. Choose an affine cipher (mod 26). You do a chosen plaintext attach using hahaha. The ciphertext is NONONO. Determine the encryption function. h N 7 13 a O α + β 13(mod 26) 0α + β 14(mod 26) 7α 1(mod 26) 7α 25(mod 26) α 11 0(11) + β 14(mod 26) β 14 11x + 14(mod 26) 5. The following ciphertext was encrypted by an affine cipher mod 26 CRWWZ The plaintext starts with ha. Decrypt the message. h C 7 2 a R α + β 2(mod 26) 0α + β 17(mod 26) 7α 15(mod 26) 7α 11(mod 26) α 9 0(9) + β 17(mod 26) β 17 we have We next need the inverse. 9x + 17(mod 26) 1 (x 17)(mod 26) 9 3(x 17)(mod 26) Therefore, CRWWZ happy W : 3(22 17) 15(mod 26) p Z : 3(25 17) 24(mod 26) y

4 7. Suppose we work mod 27 instead of mod 26 for affine ciphers. How many keys are possible? What if we worked mod 29? We need (α, 27) 1 which excludes all multiples of 3. there are 18 choices for α and 27 for β, giving 18(27) 486 possible keys. Since 29 is prime, we have 28 choices for α and 29 for β, giving 28(29) 812 possible keys. 9. You want to carry out an affine encryption using the function αx+β, but you have gcd(α, 26) d > 1. Show that if x 1 x 2 + ( ) 26 d, then αx1 + β αx 2 + β(mod 26). This shows that you will not be able to decrypt uniquely in this case. Let (α, 26) d > 1, which implies that d α and d 26. Consider αx 1 + β αx 2 + β(mod 26). If we let x 1 x 2 + ( ) 26 d, then we have ( α x ) αx 2 (mod 26) d and this gives that α ( ) 26 0(mod 26) d Since d 26, every choice of α gives 0(mod 26) and thereby will not allow for a unique decryption. 10. Suppose there is a language that on;y has the letters a and b. The frequency of the letter a is.1 and the frequency of b is.9. A message is encrypted using a Vigenere cipher (working mod 2 instead of mod 26). The ciphertext is BABABAAABA. a) Show that the key length is probably 2. Shift of 1 results in 2 coincidences Shift of 2 results in 6 coincidences Shift of 3 results in 2 coincidences Shift of 4 results in 5 coincidences Any larger shift will result in less than 6 possibilities, so the probable shift is 2. b) Using the information on the frequencies of the letters, determine the key and decrypt the message. Since we know the key is 2, we look at every other letter. Starting with 1 Starting with 2 A B 1 4 Bb, 0 a A B 5 0 Ab, 1 b

5 the key is (0, 1) (a, b). Therefore, we have BABABAAABA bbbbbbbabbb 11. Suppose you have a language with only 3 letters a,b and c, and they occur with frequencies.7,.2,.1, respectively. The following ciphertext message was encrypted by the Vigenere method (shifts are mod 3 instead of mod 26, of course): ABCBABBBAC Suppose you are told that the key length is 1, 2 or 3. Show that the key length is probably 2, and determine the most probable key. To determine the key length, we look at the number of coincidences when we shift 1, 2 or 3 places. Shift of 1 resulting in 2 occurrences. Shift of 2 results in 3 occurrences. Shift of 3 results in 1 occurrence. the most likely key length is 2. Since the key is of length 2, we look at every other letter. Odds A B C Aa the probable key is (0, 1) (a, b). Starting with 2 A B C Ba, 1 b 13. The ciphertext YIFZMA was encrypted by a Hill cipher with the matrix Find the plaintext. and K

6 Then, Y 24 I 8 F 5 Z 25 M 12 A This gives eu as the start to the plaintext which gives re and finally which gives ka Take all together, eureka the plaintext. 14. The ciphertext GEZXDS was encrypted by a Hill cipher with a 2 2 matrix. The plaintext is solved. Find the encryption matrix M. First, solved GEZXDS leads us to 18, 14, 11, 21, 4, 3 6, 4, 25, 23, 3, 18. Then, we have This gives Finally, we have (mod 26) (mod Eve captures Bob s Hill cipher machine, which uses a 2-by-2 matrix M mod 26. She tries a chosen plaintext attack. She finds the plaintext ba encrypts to HC and the plaintext zz encrypts to GT. What is the matrix M?

7 ba HC 1, 0 7, 2 zz GT 25, 25 6, M M (a) The ciphertext text ENLI was encrypted by a Hill cipher with a 2 2 matrix. The plaintext is dont. Find the encryption matrix. We have that dont ELNI, so this gives that 3, 14, 13, 19 4, 11, 13, 8. Then, A When we multiply this out, we get (mod 26) (b) Suppose the ciphertext is ELNK and the plaintext is still dont. Find the encryption matrix. Note that the second column of the matrix is changed, This shows that the entire second column of the encryption matrix is involved in obtaining the last character of the ciphertext

8 Suppose the matrix is used for an encryption matrix in a Hill cipher. Find two 3 4 plaintexts that encrypt to the same ciphertext. abcd and nopq both encrypt to DELQ. First, we want to see what any random string will map to. If we try abcd, we get and so we get the ciphertext DELQ. We now need to find another plaintext string that maps to DELQ. We can begin with setting up a system of equations, but this time we will take as the ciphertext a translate of those values we obtained from abcd w x 1 2 y z w + 3x 29 2w + 4z 30 y + 3z 37 2y + 4z 42 Solving here, we get { w + 3x 29 2w + 4x 30 (w, x) ( 13, 14) (13, 14) and { y + 3z 37 2y + 4z 42 (y, z) ( 11, 16) (15, 16) we have that nopq also maps to DELQ. 18. Let a, b, c, d, e, f be integers mod 26. Consider the following combination of the Hill and affine ciphers. Represent a block of plaintext as a pair (x, y) mod 26. The corresponding ciphertext (u, v) is a b (x, y) c d + (e, f) (u, v)(mod 26) Describe how you can carry out a chosen plaintext attack on this system (with the goal of finding the key a, b, c, d, e, f). You should state explicitly what plaintexts you chose and how to recover the key. We will need to use three different plaintexts. Choose (x, y) (0, 0). a b (0, 0) c d + (e, f) (e, f) (u, v)(mod 26)

9 Choose (x, y) (1, 0). a b (1, 0) c d We may subtract off (e, f) to find (a, b). Choose (x, y) (0, 1). a b (0, 1) c d We may subtract off (e,f) to get (c,d). + (e, f) (a, b) + (e, f) (u, v)(mod 26) + (e, f) (c, d) + (e, f) (u, v)(mod 26) 24. Alice is sending a message to Bob using one of the following cryptosystems. In fact, Alice is bored and her plaintext consists of the letter a repeated a few hundred times. Eve knows what system is being used, but not the key, and intercepts the ciphertext. For systems (a), (b) and (c), state how Eve will recognize that the plaintext is one repeated letter and decide whether or not Eve can deduce the letter and the key. (a) Shift cipher For a shift cipher, since the input is all one letter, so will the output. Eve will be able to tell that the plaintext is all the same letter but will not be able to deduce the key. (b) Affine cipher With an affine cipher, as with the shift cipher, the same plaintext letter being repeated over and over will map the same ciphertext. There will be no way, however to deduce the key from this ciphertext. (c) Hill cipher (with a 2 2 matrix Since a 0, a plaintext of a... a will map to all 0 s regardless of the choice of K. You cannot tell the original plaintext is from the ciphertext, however, since the choice of K is irrelevant when coding a A.

### Introduction to Hill cipher

Introduction to Hill cipher We have explored three simple substitution ciphers that generated ciphertext C from plaintext p by means of an arithmetic operation modulo 26. Caesar cipher: The Caesar cipher

### Cryptography and Cryptanalysis

Cryptography and Cryptanalysis Feryâl Alayont University of Arizona December 9, 2003 1 Cryptography: derived from the Greek words kryptos, meaning hidden, and graphos, meaning writing. Cryptography is

### Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur

Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Module No. # 01 Lecture No. # 05 Classic Cryptosystems (Refer Slide Time: 00:42)

### Related Idea: RSA Encryption Step 1

Related Idea: RSA Encryption Step 1 Example (RSA Encryption: Step 1) Here is how Alice and Bob can do to share a secret from Carl: What Alice Does 1. Alice chooses two (large) prime numbers p and q, which

### Exercise 1 Perfect Secrecy

Exercise 1 Perfect Secrecy Let us consider the following cryptosystem P = {a, b, c}; Pr(a) = 1/2; Pr(b) = 1/3; Pr(c) = 1/6 K = {k1, k2, k3}; Pr(k1) = Pr(k2) = Pr(k2) = 1/3; P=Plaintext C=Ciphertext K=Key

### Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Karagpur

Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Karagpur Lecture No. #06 Cryptanalysis of Classical Ciphers (Refer

### Cryptography ALICE BOB DECRYPT ENCRYPT OSCAR

Cryptography What is cryptography? Formal Definition: The art or science concerning the principles, means, and methods for rendering plain information unintelligible, and for restoring encrypted information

### Solutions to Problem Set 1

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467b: Cryptography and Computer Security Handout #8 Zheng Ma February 21, 2005 Solutions to Problem Set 1 Problem 1: Cracking the Hill cipher Suppose

### Public-Key Cryptography. Oregon State University

Public-Key Cryptography Çetin Kaya Koç Oregon State University 1 Sender M Receiver Adversary Objective: Secure communication over an insecure channel 2 Solution: Secret-key cryptography Exchange the key

### 1) A very simple example of RSA encryption

Solved Examples 1) A very simple example of RSA encryption This is an extremely simple example using numbers you can work out on a pocket calculator (those of you over the age of 35 45 can probably even

### Data Encryption 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. we would encrypt the string IDESOFMARCH as follows:

Data Encryption Encryption refers to the coding of information in order to keep it secret. Encryption is accomplished by transforming the string of characters comprising the information to produce a new

Hill Cipher Project K80TTQ1EP-??,VO.L,XU0H5BY,_71ZVPKOE678_X,N2Y-8HI4VS,,6Z28DDW5N7ADY013 Directions: Answer all numbered questions completely. Show non-trivial work in the space provided. Non-computational

### Homework 7. Using the monoalphabetic cipher in Figure 8.3, encode the message This is an easy problem. Decode the message rmij u uamu xyj.

Problems: 1 to 11. Homework 7 Question: 1 Using the monoalphabetic cipher in Figure 8.3, encode the message This is an easy problem. Decode the message rmij u uamu xyj. This is an easy problem. > uasi

### Hill s Cipher: Linear Algebra in Cryptography

Ryan Doyle Hill s Cipher: Linear Algebra in Cryptography Introduction: Since the beginning of written language, humans have wanted to share information secretly. The information could be orders from a

### RSA Cryptosystem. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong. RSA Cryptosystem

Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong In this lecture, we will discuss the RSA cryptosystem, which is widely adopted as a way to encrypt a message, or

### Chapter 10 Asymmetric-Key Cryptography

Chapter 10 Asymmetric-Key Cryptography Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 10.1 Chapter 10 Objectives Present asymmetric-key cryptography. Distinguish

### T Cryptology Spring 2009

T-79.5501 Cryptology Spring 2009 Homework 2 Tutor : Joo Y. Cho joo.cho@tkk.fi 5th February 2009 Q1. Let us consider a cryptosystem where P = {a, b, c} and C = {1, 2, 3, 4}, K = {K 1, K 2, K 3 }, and the

### Outline. Cryptography. Bret Benesh. Math 331

Outline 1 College of St. Benedict/St. John s University Department of Mathematics Math 331 2 3 The internet is a lawless place, and people have access to all sorts of information. What is keeping people

### 3. Applications of Number Theory

3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a

### Chapter 10 Asymmetric-Key Cryptography

Chapter 10 Asymmetric-Key Cryptography Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 10.1 Chapter 10 Objectives To distinguish between two cryptosystems: symmetric-key

### Network Security. Computer Networking Lecture 08. March 19, 2012. HKU SPACE Community College. HKU SPACE CC CN Lecture 08 1/23

Network Security Computer Networking Lecture 08 HKU SPACE Community College March 19, 2012 HKU SPACE CC CN Lecture 08 1/23 Outline Introduction Cryptography Algorithms Secret Key Algorithm Message Digest

### uses same key for encryption, decryption classical, conventional, single-key encryption

CEN 448 Security and Internet Protocols Chapter 2 Classical Encryption Techniques Dr. Mostafa Hassan Dahshan Computer Engineering Department College of Computer and Information Sciences King Saud University

### Shared Secret = Trust

Trust The fabric of life! Holds civilizations together Develops by a natural process Advancement of technology results in faster evolution of societies Weakening the natural bonds of trust From time to

### Secure Network Communication Part II II Public Key Cryptography. Public Key Cryptography

Kommunikationssysteme (KSy) - Block 8 Secure Network Communication Part II II Public Key Cryptography Dr. Andreas Steffen 2000-2001 A. Steffen, 28.03.2001, KSy_RSA.ppt 1 Secure Key Distribution Problem

### The application of prime numbers to RSA encryption

The application of prime numbers to RSA encryption Prime number definition: Let us begin with the definition of a prime number p The number p, which is a member of the set of natural numbers N, is considered

### CIS 5371 Cryptography. 8. Encryption --

CIS 5371 Cryptography p y 8. Encryption -- Asymmetric Techniques Textbook encryption algorithms In this chapter, security (confidentiality) is considered in the following sense: All-or-nothing secrecy.

### PRIME NUMBERS & SECRET MESSAGES

PRIME NUMBERS & SECRET MESSAGES I. RSA CODEBREAKER GAME This is a game with two players or teams. The players take turns selecting either prime or composite numbers as outlined on the board below. The

### CSC474/574 - Information Systems Security: Homework1 Solutions Sketch

CSC474/574 - Information Systems Security: Homework1 Solutions Sketch February 20, 2005 1. Consider slide 12 in the handout for topic 2.2. Prove that the decryption process of a one-round Feistel cipher

### Shift Cipher. Ahmet Burak Can Hacettepe University. Substitution Cipher. Enigma Machine. How perfect secrecy can be satisfied?

One Time Pad, Block Ciphers, Encryption Modes Ahmet Burak Can Hacettepe University abc@hacettepe.edu.tr Basic Ciphers Shift Cipher Brute-force attack can easily break Substitution Cipher Frequency analysis

### CSCE 465 Computer & Network Security

CSCE 465 Computer & Network Security Instructor: Dr. Guofei Gu http://courses.cse.tamu.edu/guofei/csce465/ Public Key Cryptogrophy 1 Roadmap Introduction RSA Diffie-Hellman Key Exchange Public key and

### 9 Modular Exponentiation and Cryptography

9 Modular Exponentiation and Cryptography 9.1 Modular Exponentiation Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system.

### Some practice problems for midterm 2

Some practice problems for midterm 2 Kiumars Kaveh November 15, 2011 Problem: What is the remainder of 6 2000 when divided by 11? Solution: This is a long-winded way of asking for the value of 6 2000 mod

### Midterm Exam Solutions CS161 Computer Security, Spring 2008

Midterm Exam Solutions CS161 Computer Security, Spring 2008 1. To encrypt a series of plaintext blocks p 1, p 2,... p n using a block cipher E operating in electronic code book (ECB) mode, each ciphertext

### Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition

### The mathematics of cryptology

The mathematics of cryptology Paul E. Gunnells Department of Mathematics and Statistics University of Massachusetts, Amherst Amherst, MA 01003 www.math.umass.edu/ gunnells April 27, 2004 What is Cryptology?

### Secret Writing. Introduction to Cryptography. Encryption. Decryption. Kerckhoffs s ( ) Principle. Security of Cryptographic System

Introduction to Cryptography ECEN 1200, Telecommunications 1 Secret Writing Cryptography is the science and study of secret writing. More specifically, cryptography is concerned with techniques for enciphering

### CS 161 Computer Security

Song Spring 2015 CS 161 Computer Security Discussion 11 April 7 & April 8, 2015 Question 1 RSA (10 min) (a) Describe how to find a pair of public key and private key for RSA encryption system. Find two

### CIS 6930 Emerging Topics in Network Security. Topic 2. Network Security Primitives

CIS 6930 Emerging Topics in Network Security Topic 2. Network Security Primitives 1 Outline Absolute basics Encryption/Decryption; Digital signatures; D-H key exchange; Hash functions; Application of hash

### Chapter 6 Character Strings. Copyright 2013 Pearson Education, Inc. Publishing as Pearson Addison-Wesley

Chapter 6 Character Strings Outline 6.1 Character String Concepts: Mapping and Casting 6.2 MATLAB Implementation 6.3 Format Conversion Functions 6.4 Character String Operations 6.5 Arrays of Strings Introduction

### C Simplified DES. William Stallings Copyright 2006

APPENDIX C Simplified DES C.1 Overview...2 C.2 S-DES Key Generation...3 C.3 S-DES Encryption...3 Initial and Final Permutations...3 The Function... The Switch Function...5 C. Analysis of Simplified DES...5

### Fundamentals of Computer Security

Fundamentals of Computer Security Spring 2015 Radu Sion Intro Encryption Hash Functions A Message From Our Sponsors Fundamentals System/Network Security, crypto How do things work Why How to design secure

### Network Security. Omer Rana

Network Security Omer Rana CM0255 Material from: Cryptography Components Sender Receiver Plaintext Encryption Ciphertext Decryption Plaintext Encryption algorithm: Plaintext Ciphertext Cipher: encryption

### Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010

CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Introduction to Cryptography What is cryptography?

### Elements of Applied Cryptography Public key encryption

Network Security Elements of Applied Cryptography Public key encryption Public key cryptosystem RSA and the factorization problem RSA in practice Other asymmetric ciphers Asymmetric Encryption Scheme Let

### PUBLIC KEY ENCRYPTION

PUBLIC KEY ENCRYPTION http://www.tutorialspoint.com/cryptography/public_key_encryption.htm Copyright tutorialspoint.com Public Key Cryptography Unlike symmetric key cryptography, we do not find historical

### Introduction to Cryptography

Introduction to Cryptography Part 2: public-key cryptography Jean-Sébastien Coron January 2007 Public-key cryptography Invented by Diffie and Hellman in 1976. Revolutionized the field. Each user now has

### Cryptography: Motivation. Data Structures and Algorithms Cryptography. Secret Writing Methods. Many areas have sensitive information, e.g.

Cryptography: Motivation Many areas have sensitive information, e.g. Data Structures and Algorithms Cryptography Goodrich & Tamassia Sections 3.1.3 & 3.1.4 Introduction Simple Methods Asymmetric methods:

### Topic 1: Cryptography

1 Introduction to Cryptography: 1.1 Science SCIE1000 Project, Semester 1 2011 Topic 1: Cryptography Cryptography is the science of using mathematics to hide information. Cryptography allows us to store

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### Security in Distributed Systems. Network Security

Security in Distributed Systems Introduction Cryptography Authentication Key exchange Computer Science Lecture 18, page 1 Network Security Intruder may eavesdrop remove, modify, and/or insert messages

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Outline. CSc 466/566. Computer Security. 8 : Cryptography Digital Signatures. Digital Signatures. Digital Signatures... Christian Collberg

Outline CSc 466/566 Computer Security 8 : Cryptography Digital Signatures Version: 2012/02/27 16:07:05 Department of Computer Science University of Arizona collberg@gmail.com Copyright c 2012 Christian

### Shor s algorithm and secret sharing

Shor s algorithm and secret sharing Libor Nentvich: QC 23 April 2007: Shor s algorithm and secret sharing 1/41 Goals: 1 To explain why the factoring is important. 2 To describe the oldest and most successful

### A PPENDIX G S IMPLIFIED DES

A PPENDIX G S IMPLIFIED DES William Stallings opyright 2010 G.1 OVERVIEW...2! G.2 S-DES KEY GENERATION...3! G.3 S-DES ENRYPTION...4! Initial and Final Permutations...4! The Function f K...5! The Switch

### Multiplicative Ciphers. Cryptography of Multiplicative Ciphers

Fall 2006 Chris Christensen MAT/CSC 483 Multiplicative Ciphers It is evident from the relative ease with which the Caesar Cipher or its generalization to an arbitrary number of positions of shift has been

Family Name:... First Name:... Section:... Advanced Cryptography Final Exam July 18 th, 2006 Start at 9:15, End at 12:00 This document consists of 12 pages. Instructions Electronic devices are not allowed.

### CSE331: Introduction to Networks and Security. Lecture 20 Fall 2006

CSE331: Introduction to Networks and Security Lecture 20 Fall 2006 Announcements Homework 2 has been assigned: **NEW DUE DATE** It's now due on Friday, November 3rd. Midterm 2 is Friday, November 10th

### Announcements. CS243: Discrete Structures. More on Cryptography and Mathematical Induction. Agenda for Today. Cryptography

Announcements CS43: Discrete Structures More on Cryptography and Mathematical Induction Işıl Dillig Class canceled next Thursday I am out of town Homework 4 due Oct instead of next Thursday (Oct 18) Işıl

### 1720 - Forward Secrecy: How to Secure SSL from Attacks by Government Agencies

1720 - Forward Secrecy: How to Secure SSL from Attacks by Government Agencies Dave Corbett Technical Product Manager Implementing Forward Secrecy 1 Agenda Part 1: Introduction Why is Forward Secrecy important?

### Basic Algorithms In Computer Algebra

Basic Algorithms In Computer Algebra Kaiserslautern SS 2011 Prof. Dr. Wolfram Decker 2. Mai 2011 References Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, 1993. Cox, D.; Little,

### Asymmetric Cryptography. Mahalingam Ramkumar Department of CSE Mississippi State University

Asymmetric Cryptography Mahalingam Ramkumar Department of CSE Mississippi State University Mathematical Preliminaries CRT Chinese Remainder Theorem Euler Phi Function Fermat's Theorem Euler Fermat's Theorem

### Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

### Homework 2. A 4*4 image with 16 pixels Borders unaltered. Color of B2 = Average color of (B1,A2,B3,C2) A1 A2 A3 A4 B1 B2 B3 B4 C1 C2 C3 C4 D1 D2 D3 D4

Homework 2 A 4*4 image with 16 pixels Borders unaltered A1 A2 A3 A4 B1 B2 B3 B4 C1 C2 C3 C4 D1 D2 D3 D4 Color of B2 = Average color of (B1,A2,B3,C2) Swap function Example: (swap_buggy.py) >>> a = 1...

### Lecture 17: Re-encryption

600.641 Special Topics in Theoretical Cryptography April 2, 2007 Instructor: Susan Hohenberger Lecture 17: Re-encryption Scribe: Zachary Scott Today s lecture was given by Matt Green. 1 Motivation Proxy

### Lecture 5 - Cryptography

CSE497b Introduction to Computer and Network Security - Spring 2007 - Professors Jaeger Lecture 5 - Cryptography CSE497b - Spring 2007 Introduction Computer and Network Security Professor Jaeger www.cse.psu.edu/~tjaeger/cse497b-s07/

### Section 2.1: Shift Ciphers and Modular Arithmetic

1 Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 3-6, 9-12, 13, 15 The purpose of this section is to learn about modular arithmetic, which

### CRYPTOGRAPHIC ALGORITHMS (AES, RSA)

CALIFORNIA STATE POLYTECHNIC UNIVERSITY, POMONA CRYPTOGRAPHIC ALGORITHMS (AES, RSA) A PAPER SUBMITTED TO PROFESSOR GILBERT S. YOUNG IN PARTIAL FULFILLMENT OF THE REQUIREMENT FOR THE COURSE CS530 : ADVANCED

### Symmetric Key cryptosystem

SFWR C03: Computer Networks and Computer Security Mar 8-11 200 Lecturer: Kartik Krishnan Lectures 22-2 Symmetric Key cryptosystem Symmetric encryption, also referred to as conventional encryption or single

### Principles of Public Key Cryptography. Applications of Public Key Cryptography. Security in Public Key Algorithms

Principles of Public Key Cryptography Chapter : Security Techniques Background Secret Key Cryptography Public Key Cryptography Hash Functions Authentication Chapter : Security on Network and Transport

### POLYTECHNIC UNIVERSITY Department of Computer and Information Science. The Hill Cipher. K. Ming Leung

POLYTECHNIC UNIVERSITY Department of Computer and Information Science The Hill Cipher K. Ming Leung Abstract: The Hill cipher in cryptography is used to illustrate the application of matrices defined over

### MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins

MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public

### Today ENCRYPTION. Cryptography example. Basic principles of cryptography

Today ENCRYPTION The last class described a number of problems in ensuring your security and privacy when using a computer on-line. This lecture discusses one of the main technological solutions. The use

### Cryptography and Network Security

Cryptography and Network Security Xiang-Yang Li Introduction The art of war teaches us not on the likelihood of the enemy s not coming, but on our own readiness to receive him; not on the chance of his

### Network Security. Security Attacks. Normal flow: Interruption: 孫 宏 民 hmsun@cs.nthu.edu.tw Phone: 03-5742968 國 立 清 華 大 學 資 訊 工 程 系 資 訊 安 全 實 驗 室

Network Security 孫 宏 民 hmsun@cs.nthu.edu.tw Phone: 03-5742968 國 立 清 華 大 學 資 訊 工 程 系 資 訊 安 全 實 驗 室 Security Attacks Normal flow: sender receiver Interruption: Information source Information destination

### Cyber Security Workshop Encryption Reference Manual

Cyber Security Workshop Encryption Reference Manual May 2015 Basic Concepts in Encoding and Encryption Binary Encoding Examples Encryption Cipher Examples 1 P a g e Encoding Concepts Binary Encoding Basics

MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic

### The Mathematics of the RSA Public-Key Cryptosystem

The Mathematics of the RSA Public-Key Cryptosystem Burt Kaliski RSA Laboratories ABOUT THE AUTHOR: Dr Burt Kaliski is a computer scientist whose involvement with the security industry has been through

### Cryptographic hash functions and MACs Solved Exercises for Cryptographic Hash Functions and MACs

Cryptographic hash functions and MACs Solved Exercises for Cryptographic Hash Functions and MACs Enes Pasalic University of Primorska Koper, 2014 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a

### Cryptography Exercises

Cryptography Exercises 1 Contents 1 source coding 3 2 Caesar Cipher 4 3 Ciphertext-only Attack 5 4 Classification of Cryptosystems-Network Nodes 6 5 Properties of modulo Operation 10 6 Vernam Cipher 11

### Discrete Mathematics, Chapter 4: Number Theory and Cryptography

Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility

### Network Security. Abusayeed Saifullah. CS 5600 Computer Networks. These slides are adapted from Kurose and Ross 8-1

Network Security Abusayeed Saifullah CS 5600 Computer Networks These slides are adapted from Kurose and Ross 8-1 Goals v understand principles of network security: cryptography and its many uses beyond

### Information Theory. Entropy

Information Theory 19 Information Theory Information theory concerns the measure of information contained in data. The security of a cryptosystem is determined by the relative content of the key, plaintext,

### Programming with TI-Nspire

1 By: Brian Olesen BO@haslev-gym.dk Pilot teacher at Haslev Gymnasium and HF Skolegade 31 4690 Haslev Denmark 2 1. Introduction to the Program Editor Functions and Programs are found in the menu of the

### Network Security. HIT Shimrit Tzur-David

Network Security HIT Shimrit Tzur-David 1 Goals: 2 Network Security Understand principles of network security: cryptography and its many uses beyond confidentiality authentication message integrity key

### 4. How many integers between 2004 and 4002 are perfect squares?

5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started

### APNIC elearning: Cryptography Basics. Contact: esec02_v1.0

APNIC elearning: Cryptography Basics Contact: training@apnic.net esec02_v1.0 Overview Cryptography Cryptographic Algorithms Encryption Symmetric-Key Algorithm Block and Stream Cipher Asymmetric Key Algorithm

### Advanced Analogue and Digital Encryption Methods. Presented by: Dr. S. Sarpal

Advanced Analogue and Digital Encryption Methods Presented by: Dr. S. Sarpal Background Term given to a mathematical algorithm OR a set of known sequences. Mixed with message to hide the meaning of content.

### Modular Arithmetic Exponent Law 1

Modular Arithmetic Exponent Law 1 Definition (Modular Arithmetic Exponent Law) Applying exponents in modular arithmetic can be done before or after simplifying! In symbols this says that for any integer

### Public Key Cryptography: RSA and Lots of Number Theory

Public Key Cryptography: RSA and Lots of Number Theory Public vs. Private-Key Cryptography We have just discussed traditional symmetric cryptography: Uses a single key shared between sender and receiver

### 1. The RSA algorithm In this chapter, we ll learn how the RSA algorithm works.

MATH 13150: Freshman Seminar Unit 18 1. The RSA algorithm In this chapter, we ll learn how the RSA algorithm works. 1.1. Bob and Alice. Suppose that Alice wants to send a message to Bob over the internet

### RSA Attacks. By Abdulaziz Alrasheed and Fatima

RSA Attacks By Abdulaziz Alrasheed and Fatima 1 Introduction Invented by Ron Rivest, Adi Shamir, and Len Adleman [1], the RSA cryptosystem was first revealed in the August 1977 issue of Scientific American.

### FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY

FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY LINDSEY R. BOSKO I would like to acknowledge the assistance of Dr. Michael Singer. His guidance and feedback were instrumental in completing this

### Introduction To Security and Privacy Einführung in die IT-Sicherheit I

Introduction To Security and Privacy Einführung in die IT-Sicherheit I Prof. Dr. rer. nat. Doğan Kesdoğan Institut für Wirtschaftsinformatik kesdogan@fb5.uni-siegen.de http://www.uni-siegen.de/fb5/itsec/

### Practice Questions. CS161 Computer Security, Fall 2008

Practice Questions CS161 Computer Security, Fall 2008 Name Email address Score % / 100 % Please do not forget to fill up your name, email in the box in the midterm exam you can skip this here. These practice

### Lecture 3: One-Way Encryption, RSA Example

ICS 180: Introduction to Cryptography April 13, 2004 Lecturer: Stanislaw Jarecki Lecture 3: One-Way Encryption, RSA Example 1 LECTURE SUMMARY We look at a different security property one might require

### Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #10 Symmetric Key Ciphers (Refer

### >> double (s) ans = Columns 1 through Columns 13 through

3. Encryption A cryptosystem is a way of encoding and decoding messages so that only certain people are able to read them. This case presents a cryptosystem based on matrix algebra and implemented using

### Lecture 10 - Cryptography and Information Theory

Lecture 10 - Cryptography and Information Theory Jan Bouda FI MU May 18, 2012 Jan Bouda (FI MU) Lecture 10 - Cryptography and Information Theory May 18, 2012 1 / 14 Part I Cryptosystem Jan Bouda (FI MU)