200 likes | 513 Views
In this presentation on the RSA Encryption Algorithm, we learn about the global standard in asymmetric encryption, designed by Rivest-Shamir-Adleman. We understand the basics of asymmetric encryption, handling of digital signatures, and how we can use RSA encryption algorithm in the verification of documents and safeguarding of private data. We also cover the distiinct advantages RSA algorithm provides versus it's counterparts.<br><br>Learn more at: https://www.simplilearn.com/cyber-security-expert-master-program-training-course<br>
E N D
Agenda for Today What Is Asymmetric Encryption? What Are Digital Signatures? What Is RSA? RSA In Data Encryption Advantages of RSA
What Is Asymmetric Encryption? Two different keys are used in Asymmetric Encryption. Private key is used for encrypting the data, and public key is used for decrypting the data. PUBLIC KEY PRIVATE KEY ENCRYPTION DECRYPTION ENCRYPTED DATA
What Is Asymmetric Encryption? Mary Roy “Meet me now” “dh12#djdi2+rg” Using Roy’s Private key to decrypt Using Roy’s Public key to encrypt “Meet me now” “dh12#djdi2+rg”
What Are Digital Signatures? • Mechanism to determine authenticity of a document file • Uses public key cryptography mechanism • Helpful to authenticate long distance official communication channels M D + E M M H# h h Comparison h H# Public Key Decryption Private Key Encryption M – Plaintext h - Digest Hash Function
Types of Implementation Digital Signature Implementation RSA DSA
What Is RSA? • Rivest-Shamir-Adleman algorithm, named after its 3 founders • First published in 1977 • Along with signature verification, it can be used for encryption and decryption of standard data. • Below figure is the process of verifying signatures using RSA M + H# M CT D Comparison h E H# Ciphertext Public Key Decryption Private Key Encryption Hash Function
RSA In Data Encryption • Key scope is reversed • Public key of receiver is used to encrypt data • Private key of receiver is used to decrypt data • Key exchange not necessary • Two main components : • Key Generation • Encryption/Decryption Function
Key Generation 1. Two large prime numbers are chosen (p and q) 2. Compute n = p * qand z = (p-1)(q-1) 3. Choose a number e where 1 < e < (p-1)(q-1) 4. A number d is selected so that ed mod z = 1 and calculated as d = e-1mod(p-1)(q-1) 5. Public key is (n,e) and private key is (n,d)
Encryption and Decryption If the plaintext is m, encrypted ciphertext c is calculated as: c = me mod n Under similar assumptions, the plaintext can be calculated as: m = cd mod n
Data Encryption- Example Choose p and q as 7 and 13 respectively, so that n=p*q=91 We can select value of e to be 5 since it satisfies 1<e<(p-1)(q-1) Value of d = e-1mod(p-1)(q-1) = 29 Public key = (91,5), private key = (91,29) Let plaintext m be 10.Ciphertext(c) = me mod n = 82Plaintext = cd mod n = 10
Advantages of RSA No need of sharing secret keys Proof of owner’s authenticity Faster Encryption than DSA Data can’t be modified in transit