We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byAmia Hammond
Modified over 2 years ago
Asymmetric Encryption Prof. Ravi Sandhu
2 © Ravi Sandhu PUBLIC KEY ENCRYPTION Encryption Algorithm E Decryption Algorithm D Plain- text Plain- text Ciphertext INSECURE CHANNEL B's Public Key B's Private Key RELIABLE CHANNEL A A B B
3 © Ravi Sandhu PUBLIC KEY CRYPTOSYSTEM solves the key distribution problem provided there is a reliable channel for communication of public keys requires reliable dissemination of 1 public key/party scales well for large-scale systems
4 © Ravi Sandhu PUBLIC KEY ENCRYPTION confidentiality based on infeasibility of computing B's private key from B's public key key sizes are large (512 bits and above) to make this computation infeasible
5 © Ravi Sandhu SPEED OF PUBLIC KEY VERSUS SECRET KEY Public key runs at kilobits/second think modem connection Secret key runs at megabits/second and even gigabits/second think LAN or disk connection This large difference in speed is likely to remain independent of technology advances
6 © Ravi Sandhu RSA public key is (n,e) private key is d encrypt: C = M e mod n decrypt: M = C d mod n
7 © Ravi Sandhu GENERATION OF RSA KEYS choose 2 large (100 digit) prime numbers p and q compute n = p * q pick e relatively prime to (p-1)*(q-1) compute d, e*d = 1 mod (p-1)*(q-1) publish (n,e) keep d secret (and discard p, q)
8 © Ravi Sandhu PROTECTION OF RSA KEYS compute d, e*d = 1 mod (p-1)*(q-1) if factorization of n into p*q is known, this is easy to do security of RSA is no better than the difficulty of factoring n into p, q
9 © Ravi Sandhu RSA KEY SIZE key size of RSA is selected by the user casual384 bits commercial512 bits military1024 bits
Asymmetric Digital Signatures And Key Exchange Prof. Ravi Sandhu.
1 El Gamel Public Key Cryptosystem. 2 The Discrete Log Problem The El Gamel public key cryptosystem is based upon the difficulty of solving the discrete.
Public Key Cryptography INFSCI 1075: Network Security – Spring 2013 Amir Masoumzadeh.
Public Key Cryptography Nick Feamster CS 6262 Spring 2009.
Symmetric Encryption Prof. Ravi Sandhu. 2 © Ravi Sandhu SECRET KEY CRYPTOSYSTEM Encryption Algorithm E Decryption Algorithm D Plain- text Plain- text.
PKI Introduction Ravi Sandhu 2 © Ravi Sandhu 2002 CRYPTOGRAPHIC TECHNOLOGY PROS AND CONS SECRET KEY SYMMETRIC KEY Faster Not scalable No digital signatures.
Security – Keys, Digital Signatures and Certificates I CS3517 Distributed Systems and Security Lecture 19.
1 RSA. 2 Prime Numbers An integer p is a prime number if it has no factors other than 1 and itself. An integer which is greater than 1 and not a prime.
Symmetric Message Authentication Codes Prof. Ravi Sandhu.
Security and Privacy over the Internet Chan Hing Wing, Anthony Mphil Yr. 1, CSE, CUHK Oct 19, 1998.
Chapter 3 Public Key Cryptography and Message authentication.
Ethical Hacking Module XXI Cryptography. EC-Council Module Objective What is PKI RSA MD-5 SHA SSL PGP SSH Encryption Cracking Techniques.
Public Key Encryptions CS461/ECE422 Fall Reading Material Text Chapters 2 and 20 Handbook of Applied Cryptography, Chapter 8 –
Cryptography Ch-1 prepared by: Diwan. Essential Terms Cryptography Encryption Plain text Cipher text Decryption Cipher text Plain text Cryptanalysis Cryptology.
RSA and Public Key Cryptography Oct Nathanael Paul.
Peer-to-peer and agent-based computing Security in Distributed Systems.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesThe Mighty Mod.
Md. Kamrul Hasan Assistant Professor and Chairman Computer and Communication Engineering Dept. Network Security.
CLASSICAL ENCRYPTION TECHNIQUES
Seminar on (ENCODING AND DECODING TECHNIQUES)
Cryptography (One Day Cryptography Tutorial) By Dr. Mohsen M. Tantawy.
Computer Security Set of slides 4 Dr Alexei Vernitski.
Side-Channel Attacks on RSA with CRT Weakness of RSA Alexander Kozak Jared Vanderbeck.
Chapter 8 Database Security and Authorization Copyright © 2004 Pearson Education, Inc.
Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.
The Diffie-Hellman Algorithm. Overview Introduction Implementation Example Applications Conclusion.
Hash Functions A hash function takes data of arbitrary size and returns a value in a fixed range. If you compute the hash of the same data at different.
© 2016 SlidePlayer.com Inc. All rights reserved.