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

Slides:

Advertisements

Similar presentations

Advertisements

Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.

Digital Signatures and Hash Functions. Digital Signatures.

Public Key Cryptography & Message Authentication By Tahaei Fall 2012.

1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.

Lecture 3.3: Public Key Cryptography III CS 436/636/736 Spring 2012 Nitesh Saxena.

7. Asymmetric encryption-

1 The RSA Algorithm Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.

Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.

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.

Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.

Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.

Pass in HW6 now Can use up to 2 late days Can use up to 2 late days But one incentive not to burn them all: teams will get to pick their presentation day.

Announcements: 1. HW6 due now 2. HW7 posted Questions? This week: Discrete Logs, Diffie-Hellman, ElGamal Discrete Logs, Diffie-Hellman, ElGamal Hash Functions.

Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.

RSA Exponentiation cipher

Chapter 3 Encryption Algorithms & Systems (Part B)

1 Intro To Encryption Exercise 6. 2 Problem Is every (weak) CRHF also a OWF.

Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.

Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.

Diffie-Hellman Key Exchange

Computer Science CSC 474Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.5 Public Key Algorithms.

Public-Key Cryptography and RSA CSE 651: Introduction to Network Security.

Public Key Model 8. Cryptography part 2.

1 CIS 5371 Cryptography 8. Asymmetric encryption-.

13.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 13 Digital Signature.

Information Security and Management 13. Digital Signatures and Authentication Protocols Chih-Hung Wang Fall

CS5204 – Fall Cryptographic Security Presenter: Hamid Al-Hamadi October 13, 2009.

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 9: Cryptography.

Bob can sign a message using a digital signature generation algorithm

The RSA Algorithm Rocky K. C. Chang, March

Lecture 15 Lecture’s outline Public algorithms (usually) that are each other’s inverse.

Digital Signatures Good properties of hand-written signatures: 1. Signature is authentic. 2. Signature is unforgeable. 3. Signature is not reusable (it.

Lecture 7b: The Diffie-Hellman Secret Sharing Scheme Wayne Patterson SYCS 653 Fall 2009.

J. Wang. Computer Network Security Theory and Practice. Springer 2008 Chapter 3 Public-Key Cryptography and Key Management.

Message Authentication  message authentication is concerned with: protecting the integrity of a message protecting the integrity of a message validating.

RSA Implementation. What is Encryption ? Encryption is the transformation of data into a form that is as close to impossible as possible to read without.

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.

Cryptography: RSA & DES Marcia Noel Ken Roe Jaime Buccheri.

4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.

Chapter 21 Public-Key Cryptography and Message Authentication.

Modular Arithmetic with Applications to Cryptography Lecture 47 Section 10.4 Wed, Apr 13, 2005.

Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

Section 4.4: The RSA Cryptosystem Practice HW Handwritten and Maple Exercises p at end of class notes.

Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.

Public Key Encryption with keyword Search Author: Dan Boneh Rafail Ostroversity Giovanni Di Crescenzo Giuseppe Persiano Presenter: 陳昱圻.

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

PUBLIC KEY CRYPTOGRAPHY ALGORITHM Concept and Example 1IT352 | Network Security |Najwa AlGhamdi.

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

1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,

Prepared by Dr. Lamiaa Elshenawy

DIGITAL SIGNATURE. A digital signature is an authentication mechanism that enables the creator of a message to attach a code that acts as a signature.

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

Introduction to Cryptography Lecture 9. Public – Key Cryptosystems Each participant has a public key and a private key. It should be infeasible to determine.

Key Management Network Systems Security Mort Anvari.

1 Authenticated Key Exchange Rocky K. C. Chang 20 March 2007.

Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.

Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

1 Chapter 3-3 Key Distribution. 2 Key Management public-key encryption helps address key distribution problems have two aspects of this: –distribution.

Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:

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

Security. Cryptography (1) Intruders and eavesdroppers in communication.

1 The RSA Algorithm Rocky K. C. Chang February 23, 2007.

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

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

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

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

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

Presentation transcript:

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

Homework #2 Chap.3: Due: two weeks (extended to Nov. 21, 2012) Review questions 3.4, 3.6 Problems 3.8, 3.20, 3.21 Due: two weeks (extended to Nov. 21, 2012)

Chap. 3 Review question 3.4: What properties must a hash function have to be useful for message authentication? Review question 3.6: What are the principal ingredients of a public-key cryptosystem?

Problem 3.8: Now consider the opposite problem: Use an encryption algorithm to construct a one-way hash function. Consider using RSA with a known key. Then process a message consisting of a sequence of blocks as follows: Encrypt the first block, XOR the result with the second block and encrypt again, and so on. Show that this scheme is not secure by solving the following problem:

Given a two-block message B1, B2, and its hash, we have RSAH(B1, B2) = RSA(RSA(B1)B2) Given an arbitrary block C1, choose C2 so that RSAH(C1, C2)=RSAH(B1, B2), Thus, the hash function does not satisfy weak collision resistance.

3.20: Suppose Bob uses the RSA cryptosystem with a very large modulus n for which the factorization cannot be found in a reasonable amount of time. Suppose Alice sends a message to Bob by representing each alphabetic character as an integer between 0 and 25 (A->0, …, Z->25), and then encrypting each number separately using RSA with large e and large n. Is this method secure? If not, describe the most efficient attack against this encryption method.

3.21: Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root =2. a. If user A has public key YA=9, what is A’s private key XA? B. If user B has public key YB=3, what is the shared secret key K?

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

Thanks for Your Attention!