P1. Public-Key Cryptography and RSA 5351: Introduction to Cryptography Spring 2013.

Slides:



Advertisements
Similar presentations
Chapter 3 Public Key Cryptography and Message authentication.
Advertisements

Public Key Cryptography Nick Feamster CS 6262 Spring 2009.
By Md Emran Mazumder Ottawa University Student no:
Public Key Cryptography INFSCI 1075: Network Security – Spring 2013 Amir Masoumzadeh.
Cryptography and Network Security Chapter 9
1 Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell.
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.
22C:19 Discrete Math Integers and Modular Arithmetic Fall 2010 Sukumar Ghosh.
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 6 Wenbing Zhao Department of Electrical and Computer Engineering.
OOP/Java1 Public Key Crytography From: Introduction to Algorithms Cormen, Leiserson and Rivest.
Lect. 11: Public Key Cryptography. 2 Contents 1.Introduction to PKC 2.Hard problems  IFP  DLP 3.Public Key Encryptions  RSA  ElGamal 4.Digital Signatures.
Public-key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998.
Public Key Crytography1 From: Introduction to Algorithms Cormen, Leiserson and Rivest.
Public Key Cryptography
WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.
Cryptography1 CPSC 3730 Cryptography Chapter 9 Public Key Cryptography and RSA.
Introduction to Modern Cryptography Lecture 7 1.RSA Public Key CryptoSystem 2.One way Trapdoor Functions.
WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.
Fall 2010/Lecture 311 CS 426 (Fall 2010) Public Key Encryption and Digital Signatures.
Dr.Saleem Al_Zoubi1 Cryptography and Network Security Third Edition by William Stallings Public Key Cryptography and RSA.
1 Pertemuan 08 Public Key Cryptography Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.
Public-Key Cryptography and RSA CSE 651: Introduction to Network Security.
ASYMMETRIC CIPHERS.
Computer Science Public Key Management Lecture 5.
Introduction to Public Key Cryptography
Public Key Model 8. Cryptography part 2.
 Introduction  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.
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.
ECE453 – Introduction to Computer Networks Lecture 18 – Network Security (I)
Introduction to Modular Arithmetic and Public Key Cryptography.
Public-key Cryptography Strengths and Weaknesses Matt Blumenthal.
Secure r How do you do it? m Need to worry about sniffing, modifying, end- user masquerading, replaying. m If sender and receiver have shared secret.
J. Wang. Computer Network Security Theory and Practice. Springer 2008 Chapter 3 Public-Key Cryptography and Key Management.
Number-Theoretic Algorithms
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.
RSA Ramki Thurimella.
Symmetric versus Asymmetric Cryptography. Why is it worth presenting cryptography? Top concern in security Fundamental knowledge in computer security.
Public-Key Cryptography CS110 Fall Conventional Encryption.
Midterm Review Cryptography & Network Security
Cryptographic Hash Functions Message Authentication Digital Signatures.
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.
Software Security Seminar - 1 Chapter 5. Advanced Protocols 조미성 Applied Cryptography.
Public-Key Encryption
Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.
Computer and Network Security Rabie A. Ramadan Lecture 6.
Cryptography and Network Security Chapter 9 - Public-Key Cryptography
CS461/ECE422 Spring 2012 Nikita Borisov — UIUC1.  Text Chapters 2 and 21  Handbook of Applied Cryptography, Chapter 8 
PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
ECE509 Cyber Security : Concept, Theory, and Practice Key Management Spring 2014.
Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.
Elliptic Curve Cryptography
Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.
PUBLIC-KEY CRYPTOGRAPHY AND RSA – Chapter 9 PUBLIC-KEY CRYPTOGRAPHY AND RSA – Chapter 9 Principles Applications Requirements RSA Algorithm Description.
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.
Introduction to Cryptography Lecture 9. Public – Key Cryptosystems Each participant has a public key and a private key. It should be infeasible to determine.
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
Computer Security Lecture 5 Ch.9 Public-Key Cryptography And RSA Prepared by Dr. Lamiaa Elshenawy.
Lecture 3 (Chapter 9) Public-Key Cryptography and RSA Prepared by Dr. Lamiaa M. Elshenawy 1.
Information Security and Management 10. Other Public-key Cryptosystems Chih-Hung Wang Fall
ECE454/599 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2012.
Security. Cryptography (1) Intruders and eavesdroppers in communication.
RSA Algorithm Date: 96/10/17 Wun-Long Yang. Outline Introduction to RSA algorithm RSA efficient implementation & profiling.
Cryptography and Network Security Chapter 13
Public-Key Cryptography and RSA
Cryptography and Security Fall 2009 Steve Lai
Introduction to Cryptography
Secure Diffie-Hellman Algorithm
Presentation transcript:

p1. Public-Key Cryptography and RSA 5351: Introduction to Cryptography Spring 2013

p2. Public-Key Cryptography Also known as asymmetric-key cryptography. Each user has a pair of keys: a public key and a private key. The public key is used for encryption. –The key is known to the public. The private key is used for decryption. –The key is only known to the owner.

p3. Why Public-Key Cryptography? Developed to address two main issues: –key distribution –digital signatures Invented by Diffie & Hellman in 1976.

p4.

p5.

p6.

p7.

p8.

p9. Modular Arithmetic

p10.

p11.

p12.

p13.

p14.

p15.

p16.

p17.

p18.

p19.

p20. The Chinese Remainder Problem A problem described in an ancient Chinese arithmetic book, Sun Tze Suan Ching, by Sun Tze (around 300AD, author of The Art of War). Problem: We have a number of objects, but we do not know exactly how many. If we count them by threes we have two left over. If we count them by fives we have three left over. If we count them by sevens we have two left over. How many objects are there?

p21.

p22. Example: Chinese remainder theorem

p23.

p24.

p25.

p26.

p27. Algorithms

p28.

p29.

p30.

p31.

p32.

p33.

p34. The RSA Cryptosystem RSA Encryption RSA Digital Signature

p35.

p36.

p37.

p38.

p39.

p40.

p41.

p42.

p43.

p44.

p45. Attacks on RSA

p46.

p47.

p48.

p49.

p50.

p51. RSA-200 = 27,997,833,911,221,327,870,829,467,638, 722,601,621,070,446,786,955,428,537,560, 009,929,326,128,400,107,609,345,671,052, 955,360,856,061,822,351,910,951,365,788, 637,105,954,482,006,576,775,098,580,557, 613,579,098,734,950,144,178,863,178,946, 295,187,237,869,221,823,983.

p52.

p53.

p54.

p55.

p56.

p57.

p58.

p59.

p60.

p61.

p62.

p63.

p64.

p65.

p66. Padded RSA

p67.

p68.

p69.

p70.

p71.

p72.

p73. 0 n 2n 3n 4n ns 2B 3B

p74. 2B 3B

p75.

p76. CCA-Secure RSA in the Random Oracle Model

p77.

p78.

p79.

p80.

p81.

p82.

p83.

p84. Digital Signatures

p85. Message m MAC k (m) Message m Sig sk (m)

p86.

p87. MCED PK Bob SK Bob Alice Bob M M SED PK Bob SK Bob Alice Bob Verify the signature Sign Encryption (using RSA): Signing (using RSA -1 ): E(S) =M?

p88.

p89.

p90.

p91.

p92.

p93.

p94.

p95.

p96.

p97.

p98.

p99.

p100.

p101.

p102.

p103.

p104. Generating large primes To set up an RSA cryptosystem, we need two large primes p and q.

p105.

p106.

p107.

p108.

p109.

p110.

p111.

p112.

p113.

p114.

p115.

p116.

p117.

p118.

p119.

p120.

p121.

p122.