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

Slides:

Advertisements

Similar presentations

Diffie-Hellman Diffie-Hellman is a public key distribution scheme First public-key type scheme, proposed in 1976.

Advertisements

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

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

Asymmetric-Key Cryptography

7. Asymmetric encryption-

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 Cryptosystems Based on Discrete Logarithms. 2 Outline [1] Discrete Logarithm Problem [2] Algorithms for Discrete Logarithm –A trivial algorithm –Shanks’

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.

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

Chapter3 Public-Key Cryptography and Message Authentication.

1 Pertemuan 08 Public Key Cryptography Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.

Public Key Cryptography RSA Diffie Hellman Key Management Based on slides by Dr. Lawrie Brown of the Australian Defence Force Academy, University College,

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

CSCI 172/283 Fall 2010 Public Key Cryptography. New paradigm introduced by Diffie and Hellman The mailbox analogy: Bob has a locked mailbox Alice can.

ASYMMETRIC CIPHERS.

Public Key Model 8. Cryptography part 2.

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

1 CIS 5371 Cryptography 8. Asymmetric encryption-.

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

Rachana Y. Patil 1 1.

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.

Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 21 “Public-Key Cryptography.

Network and Communications Network Security Department of Computer Science Virginia Commonwealth University.

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.

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.

1 Lecture 9 Public Key Cryptography Public Key Algorithms CIS CIS 5357 Network Security.

Public-Key Cryptography CS110 Fall Conventional Encryption.

Chapter 21 Public-Key Cryptography and Message Authentication.

By Yernar.  Background  Key generation  Encryption  Decryption  Preset Bits  Example.

Number Theory and Advanced Cryptography 2

Cryptography and Network Security (CS435) Part Eight (Key Management)

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

PUBLIC KEY CRYPTOSYSTEMS Symmetric Cryptosystems 23/10/2015 | pag. 2.

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

1 離散對數密碼系統交通大學資訊工程系陳榮傑. 2 Outline 離散對數問題 (Discrete Logarithm Problem) 離散對數演算法 (DL Algorithms) –A trivial algorithm –Shanks’ algorithm –Pollard’s algorithm.

Q: How do Ole and Lena get a shared private key? 1) Lena  LockmasterE keyLena ( ID Lena || ID Ole ) Example (Suppose Lena wants a key to shared with Ole.)

PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.

Key Exchange Methods Diffie-Hellman and RSA CPE 701 Research Case Study Derek Eiler | April 2012.

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

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

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

IT 221: Introduction to Information Security Principles Lecture 4: Public-Key Cryptography For Educational Purposes Only Revised: September 15, 2002.

Scott CH Huang COM 5336 Lecture 7 Other Public-Key Cryptosystems Scott CH Huang COM 5336 Cryptography Lecture 7.

ECE509 Cyber Security : Concept, Theory, and Practice Key Management Spring 2014.

Elliptic Curve Cryptography

Cryptography and Network Security

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

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

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

Public Key Cryptosystem Introduced in 1976 by Diffie and Hellman [2] In PKC different keys are used for encryption and decryption 1978: First Two Implementations.

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.

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

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.

CST 312 Pablo Breuer.  First published public-key algorithm  A number of commercial products employ this key exchange technique  Purpose is to enable.

CPIS 312 Chapter Four: PUBLIC KEY CRYPTO. Index 2 A.Introduction A.1 Asymmetric Key Cryptography- Introduction A.2 General ideas about the Public Key.

@Yuan Xue 285: Network Security CS 285 Network Security Digital Signature Yuan Xue Fall 2012.

Public Key Cryptosystem

Key Exchange References: Applied Cryptography, Bruce Schneier

Diffie-Hellman Algorithm

Presentation transcript:

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

Diffie and Hellman 1976 A number of commercial products employ this key exchange technique This algorithm enables two users to exchange key securely 2 Diffie-Hellman Key Exchange

3 Algorithm of Diffie-Hellman (1/2)

4 Algorithm of Diffie-Hellman (2/2)

5 Example of D-H Key Exchange q=97 =5X A = 36 X B =58 Y A =5 36 =50 mod 97 Y B =5 58 =44 mod 97 K=(Y B )X A mod 97 = = 75 nod 97 K=(Y A )X B mod 97 = = 75 nod 97

6 Diffie-Hellman

RSA based hybrid encryption system 7 Supplementary (1) A B Randomly selects a DES Key (or other symmetric encryption system) K DES E K DES (M), E K puB (K DES )

Diffie-Hellman based hybrid encryption system 8 Supplementary (2) A B YAYA YBYB K=(Y B ) xA =(Y A ) xB Mod q SK=h(K) 128 – 256 bits E SK (M)

In 1984, Elgamal announced a public-key scheme based on discrete logarithms. Closely related to the Diffie-Hellman technique. ElGamal Cryptographic System 9

q : prime number α: α<q and α a primitive root of q Global Public Elements 10

Select private X A : X A <q-1 Calculate Y A : Y A = α X A mod q Public key: PU={q, α, Y A } Private key: X A Key Generation by Alice 11

Plaintext: M <q Select random integer k: k<q Calculate K: K=(Y A ) k mod q Calculate C 1 : C 1 = α k mod q Calculate C 2 : C 2 =KM mod q Ciphertext: (C 1, C 2 ) Encryption by Bob with Alice’s Public Key 12

Ciphertext: (C 1, C 2 ) Calculate K: K=(C 1 ) X A mod q Plaintext: M=(C 2 K -1 ) mod q Decryption by Alice with Alice’s Private Key 13