Homework #1 J. H. Wang Oct. 2, 2013.

Slides:

Advertisements

Similar presentations

Computer Security Set of slides 4 Dr Alexei Vernitski.

Advertisements

30.1 Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Encipherment Using Modern Symmetric-Key Ciphers. 8.2 Objectives ❏ To show how modern standard ciphers, such as DES or AES, can be used to encipher long.

Modern Symmetric-Key Ciphers

Modern Symmetric-Key Ciphers

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.

IS 302: Information Security and Trust Week 4: Asymmetric Encryption

Digital Kommunikationselektroink TNE027 Lecture 6 (Cryptography) 1 Cryptography Algorithms Symmetric and Asymmetric Cryptography Algorithms Data Stream.

Encryption Public-Key, Identity-Based, Attribute-Based.

CS 6262 Spring 02 - Lecture #7 (Tuesday, 1/29/2002) Introduction to Cryptography.

Web Security for Network and System Administrators1 Chapter 4 Encryption.

Block Ciphers 1 Block Ciphers Block Ciphers 2 Block Ciphers  Modern version of a codebook cipher  In effect, a block cipher algorithm yields a huge.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the orderQuestions? Review.

ECOMMERCE TECHNOLOGY SUMMER 2002 COPYRIGHT © 2002 MICHAEL I. SHAMOS Cryptographic Security.

ECOMMERCE TECHNOLOGY FALL 2003 COPYRIGHT © 2003 MICHAEL I. SHAMOS Cryptography.

Modes of Operation CS 795. Electronic Code Book (ECB) Each block of the message is encrypted with the same secret key Problems: If two identical blocks.

How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.

Lecture 23 Symmetric Encryption

Public Key Algorithms 4/17/2017 M. Chatterjee.

8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.

CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.

Chapter 13: Electronic Commerce and Information Security Invitation to Computer Science, C++ Version, Fourth Edition SP09: Contains security section (13.4)

1 Chapter 4 Encryption. 2 Objectives In this chapter, you will: Learn the basics of encryption technology Recognize popular symmetric encryption algorithms.

Asymmetric encryption. Asymmetric encryption, often called "public key" encryption, allows Alice to send Bob an encrypted message without a shared secret.

Block Cipher Transmission Modes CSCI 5857: Encoding and Encryption.

HW6 due tomorrow Teams T will get to pick their presentation day in the order Teams T will get to pick their presentation day in the order Teams mostly.

10/1/2015 9:38:06 AM1AIIS. OUTLINE Introduction Goals In Cryptography Secrete Key Cryptography Public Key Cryptograpgy Digital Signatures 2 10/1/2015.

Chapter 20 Symmetric Encryption and Message Confidentiality.

Public Key Encryption and the RSA Public Key Algorithm CSCI 5857: Encoding and Encryption.

How cryptography is used to secure web services Josh Benaloh Cryptographer Microsoft Research.

Chapter 20 Symmetric Encryption and Message Confidentiality.

CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.

BASIC CRYPTOGRAPHIC CONCEPTS. Public Key Cryptography  Uses two keys for every simplex logical communication link.  Public key  Private key  The use.

Improving Encryption Algorithms Betty Huang Computer Systems Lab

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

Cryptography Wei Wu. Internet Threat Model Client Network Not trusted!!

Cryptograpy By Roya Furmuly W C I H D F O P S L 7.

Multiple Encryption & DES  clearly a replacement for DES was needed Vulnerable to brute-force key search attacks Vulnerable to brute-force key search.

BLOCK CIPHER SYSTEMS OPERATION MODES OF DATA ENCRYPTION STANDARD (DES)

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security.

Confidentiality Confidentiality is maintained so long as private keys are secure. Authenticity is possible via public-key encryption by encrypting messages.

From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, © Addison-Wesley 2012 Exercises for Chapter 11: Security.

24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,

NEW DIRECTIONS IN CRYPTOGRAPHY Made Harta Dwijaksara, Yi Jae Park.

Lecture 23 Symmetric Encryption

Chapter 2 Symmetric Encryption.

CS 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.

Cipher Transmission and Storage Modes Part 2: Stream Cipher Modes CSCI 5857: Encoding and Encryption.

CHAOS CRYPTOGRAPHY Nathaniel Speiser Physics

Homework #2 J. H. Wang Oct. 31, 2012.

Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.

CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.

Information Security and Management 10. Other Public-key Cryptosystems Chih-Hung Wang Fall

Substitution Ciphers Reference –Matt Bishop, Computer Security, Addison Wesley, 2003.

Prof. Reuven Aviv, Nov 2013 Public Key Infrastructure1 Prof. Reuven Aviv Tel Hai Academic College Department of Computer Science Problem Set 1: Cryptography.

1 CPCS425: Information Security (Topic 5) Topic 5  Symmetrical Cryptography  Understand the principles of modern symmetric (conventional) cryptography.

Homework #1 J. H. Wang Oct. 9, 2012.

CS480 Cryptography and Information Security

Homework #2 J. H. Wang Oct. 19, 2017.

Chapter 30 Cryptography Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

مروري برالگوريتمهاي رمز متقارن(كليد پنهان)

Block cipher and modes of encryptions

Homework #1 Chap. 1, 3, 4 J. H. Wang Oct. 2, 2018.

Homework #2 J. H. Wang Oct. 18, 2018.

Elect. Codebook, Cipher Block Chaining

Review of Cryptography: Symmetric and Asymmetric Crypto Advanced Network Security Peter Reiher August, 2014.

Presentation transcript:

Homework #1 J. H. Wang Oct. 2, 2013

Homework #1 Chap.1: Chap.2: Due: two weeks (Oct. 16, 2013) Review question 1.2 Chap.2: Review question 2.4, 2.8 Problems: 2.3, 2.11, 2.13 Due: two weeks (Oct. 16, 2013)

Chap. 1 Review question 1.2: What is the difference between passive and active security threats? Chap. 2 Review question 2.4: What is the difference between a block cipher and a stream cipher? Review question 2.8: Why is the middle portion of 3DES a decryption rather than an encryption?

Problem 2.3: Perhaps the simplest “serious” symmetric block encryption algorithm is the Tiny Encryption Algorithm (TEA). TEA operates on 64-bit blocks of plaintext using a 128-bit key. The plaintext is divided into two 32-bit blocks (L0, R0), and the key is divided into four 32-bit blocks (K0, K1, K2, K3). (…to be continued)

Encryption involves repeated application of a pair of rounds, defined as rounds i and i+1: Li=Ri-1 Ri=Li-1+F(Ri-1, K0, K1, i) mod 264 Li+1=Ri Ri+1=Li+F(Ri, K2, K3, i+1) mod 264 where F is defined as F(M, Kj, Kk, i) = ((M<<4)+Kj mod 264) ((M>>5)+Kk mod 264) (M+i mod 264) And where the logical shift of x by y bits is denoted by x<<y, the logical right shift of x by y bits is denoted by x>>y, and i is a sequence of predetermined constants. (… to be continued…)

(a) Comment on the significance and benefit of using the sequence of constants. (b) Illustrate the operation of TEA using a block diagram or flow chart type of depiction. (c) If only one pair of rounds is used, then the ciphertext consists of the 64-bit block (L2, R2). For this case, express the decryption algorithm in terms of equations. (d) Repeat part (c) using an illustration similar to that used for part (b).

Problem 2.11: Alice and Bob agree to communicate privately via e-mail using a scheme based on RC4, but they want to avoid using a new secret key for each transmission. Alice and Bob privately agree on a 128-bit key k. To encrypt a message m consisting of a string of bits, the following procedure is used: Choose a random 80-bit value v Generate the ciphertext c=RC4(v||k) m Send the bit string (v||c) Suppose Alice uses this procedure to send a message m to Bob. Describe how Bob can recover the message m from (v||c) using k. If an adversary observes several values (v1||c1), (v2 ||c2), … transmitted between Alice and Bob, how can he/she determine when the same key stream has been used to encrypt two messages?

Problem 2.13: Is it possible to perform encryption operations in parallel on multiple blocks of plaintext in CBC mode? How about decryption?

Homework Submission For hand-written exercises, please hand in your homework in class (paper version)

Thanks for Your Attention!