CSE 331: Introduction to Networks and Security Fall 2001 Instructor: Carl A. Gunter Encrypted Knock Knock.

Slides:

Advertisements

Similar presentations

Data Security 1 El_Gamal Cryptography. Data Security2 Introduction El_Gamal is a public-key cryptosystem technique El_Gamal is a public-key cryptosystem.

Advertisements

7. Asymmetric encryption-

Public-key based. Public-key Techniques based Protocols –may use either weak or strong passwords –high computation complexity (Slow) –high deployment.

Public Key Algorithms …….. RAIT M. Chatterjee.

Network Security – Part 2 Public Key Cryptography Spring 2007 V.T. Raja, Ph.D., Oregon State University.

Elliptic Curve Cryptography (ECC) Mustafa Demirhan Bhaskar Anepu Ajit Kunjal.

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.

1 Security analysis of an enhanced authentication key exchange protocol Authors ： H.Y. Liu, G.B. Horng, F.Y. Hung Presented by F.Y. Hung Date ： 2005/5/20.

Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.

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.

Introduction to Signcryption November 22, /11/2004 Signcryption Public Key (PK) Cryptography Discovering Public Key (PK) cryptography has made.

Dr. Lo’ai Tawalbeh Fall 2005 Chapter 10 – Key Management; Other Public Key Cryptosystems Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University.

CSE331: Introduction to Networks and Security Lecture 20 Fall 2002.

Cryptography & Number Theory

WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.

The Diffie-Hellman Algorithm Riley Lochridge April 11, 2003.

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

Codes, Ciphers, and Cryptography-RSA Encryption

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

Public Key Model 8. Cryptography part 2.

1 CIS 5371 Cryptography 8. Asymmetric encryption-.

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

ElGamal Public Key Cryptography CS 303 Alg. Number Theory & Cryptography Jeremy Johnson Taher ElGamal, "A Public-Key Cryptosystem and a Signature Scheme.

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

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.

Cyrtographic Security Identity-based Encryption 1Dennis Kafura – CS5204 – Operating Systems.

Public-Key Cryptography CS110 Fall Conventional Encryption.

Digital Signatures A primer 1. Why public key cryptography? With secret key algorithms Number of key pairs to be generated is extremely large If there.

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

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

Modern Cryptographic Topics

Discrete Logarithm(s) (DLs) Fix a prime p. Let a, b be nonzero integers (mod p). The problem of finding x such that a x ≡ b (mod p) is called the discrete.

Fall 2010/Lecture 321 CS 426 (Fall 2010) Key Distribution & Agreement.

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

Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.

A A E E D D C C B B # Symmetric Keys = n*(n-1)/2 F F

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

Fall, Privacy&Security - Virginia Tech – Computer Science Click to edit Master title style Cryptographic Security Identity-Based Encryption.

Diffie-Hellman Key Exchange Color Mixing Example Rick Stroud 21 September 2015 CSCE 522.

Cryptography Readings Encryption, Decryption, & Digital Certificates.

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.

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

Key Management Network Systems Security Mort Anvari.

1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.

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

Introduction to Pubic Key Encryption CSCI 5857: Encoding and Encryption.

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:

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

Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.

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

@Yuan Xue CS 285 Network Security Key Distribution and Management Yuan Xue Fall 2012.

Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.

Cryptography and Network Security Chapter 13

최신정보보호기술 경일대학교 사이버보안학과 김 현성.

Key Exchange References: Applied Cryptography, Bruce Schneier

ElGamal Public-Key Systems over GF(p) & GF(2m)

Chapter 10: Key Management (Again) and other Public Key Systems

Key Management Network Systems Security

El Gamal and Diffie Hellman

Cryptography and Network Security Chapter 10

CSCE 715: Network Systems Security

Cryptology Design Fundamentals

Key Exchange, Man-in-the-Middle Attack

Diffie-Hellman Algorithm

How to Use Charm Crypto Lib

LAB 3: Digital Signature

Presentation transcript:

CSE 331: Introduction to Networks and Security Fall 2001 Instructor: Carl A. Gunter Encrypted Knock Knock

ElGamal l Similar to Diffie-Hellman, but provides for encryption of a message M. l Start as with Diffie-Hellman.  Select and share the public information  Select a prime number q and a primitive root  of this prime.  Compute the private and public keys.  Alice chooses XA < q at random and takes YA to be  **XA mod q.  Bob chooses XB < q at random and takes YB to be  **XB mod q.

ElGamal Encryption l Alice wishes to send the encryption of a message M to Bob. l Represent M as a number M < q. l Choose random r such that 1<=r<q. l Let R = YB**r mod q. l Let  =  **r mod q. l Let  = R*M mod q. l The encrypted message is ( ,  ).

ElGamal Decryption l To decrypt:   **XB = (  **r)**XB = (  **XB)**r = (YB)**r  R (mod q)   *R -1 = (R*M)*R -1  M (mod q)

EKK l Encrypted Knock! Knock! (EKK) uses ElGamal and DES. l It provides confidential channels without authentication. l Protocol notation:  Alice -> Bob: How are you?  Bob -> Alice: Ok, and you?  Alice -> Bob: Not bad, have a nice day!  Bob -> Alice: You too!

EKK Set Up l Advanced setup: prime q and primitive root  where q is more than 64 bits. l Client C (you) and server S select key pairs (XC, YC) and (XS, YS) as in ElGamal/Diffie-Hellman.

EKK Overview l Client initiates protocol with “Knock! Knock!” message and its public key YC. l Server responds with “Who’s there?”, its public key YS, and DES key K, encrypted using ElGamal. l Client responds with first part of joke encrypted using DES and key K. l Server plays along, using DES encryption with K.

EKK Example l C->S: Knock! Knock!YC. l S->C: Who’s there?YS, ( ,  ). l C->S: E(K, Boo!). l S->C: E(K, Boo! Who?). l C->S: E(K, Don’t cry, this will be easy!). l S->C: E(K, Don’t waste server time, connection closed.).