Scribd
Upload
4 views10 pages

RSA Algorithm

The RSA algorithm is a widely used public key cryptographic method for encryption, decryption, digital signatures, and authentication, developed by Rivest, Shamir, and Adleman. It operates using a pair of keys: a public key for encryption and a private key for decryption, relying on the difficulty of factoring large prime numbers for security. Key generation involves selecting two prime numbers, calculating their product and Euler's totient function, and determining the public and private keys for secure communication.

Uploaded by

23urit024
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
4 views10 pages

RSA Algorithm

The RSA algorithm is a widely used public key cryptographic method for encryption, decryption, digital signatures, and authentication, developed by Rivest, Shamir, and Adleman. It operates using a pair of keys: a public key for encryption and a private key for decryption, relying on the difficulty of factoring large prime numbers for security. Key generation involves selecting two prime numbers, calculating their product and Euler's totient function, and determining the public and private keys for secure communication.

Uploaded by

23urit024
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
RSA Algorithm — 15 Marks Answer Introduction RSA the most widely used public key cryptographic algorithm used for: + Encryption + Decryption + Digital signatures + Authentication SA was developed by: + Rivest + Shamir + Adleman RSA s an asymmetric cryptographic algorithm because it uses two different keys: 1. Public Key 2. Private Key Reference: CCS354 Network Security Book —RSA Algorithm 0) sims seary Definition SA sa public key cryptographic algorithm that uses two keys for secure communication, + Public key ~ used for encryption + Private key - used for decryption RSA provides: + Confidentiality + Authentication + Integrity + Digital signature support v How RSA encryption works O - & Sender _Plaintext data Ciphered data ' Decrypted Recipient plaintext data Public key Private key Simple RSA Diagram Plata Text Encrypt using Public Key 1 original nessage Working Principle of RSA SA works based on + Prime number factorization + Modular arithmetic RSA security dapends on the difficulty of factoring large numbers, attacker knows: itis very difficult to find oP oa for large prime numbers. a - Important Terms in RSA Term Pq io) M RSA Key Generation Steps Step 1- Choose Two Prime Numbers Choose: Meaning Prime numbers Product of p and q Euler Totient Function Public exponent Private exponent Plain text Cipher text Step 2-Findn Formula: =pxq Calculation: n=3K11 n=33 Step 3 — Find Euler Totient Function (n) Formula: (n) = (p—1)(q—1) Caleulation: Importance of o(n) Euler Totient Function is used for: «Finding public key * Finding private key It plays an important role in RSA calculations. Step 4- Choose e Conditions: + e< ${n) + gcdleg(m) =1 Choose: Because: ged(7,20) =1 Step 5-Findd Formula dx emod 6(n) =1 Calculation: dx 7 mod 20 = d Because: 3x7=21 21 mod 20 =1 Public and Private Keys Key Type Value Public Key (en) = (7,33) Private Key (Gn = 33) RSA Encryption Formule: C=M* modn Where: + M= Message + C= Cipher toxt Encryption Example Plain Text: M=2 Calculation: C=2 mod 33 = 128 mod 33 =29 Cipher Text: RSA Decryption Formulas M=C*modn Decryption Example per Text Calculation: M = 29° mod 33 M=2 Original message recovered successfully. RSA Encryption and Decryption Flow sender ecetver | encrypt using public Key I i chpnen tet 1 ! 1 ol 1 i | Decrypt using Private Key Original Message Recovered Successfully Important Exam Sums to Practice 1. Find n n=pxq 2. Find o(n) a(n) = (P— Yg—) 3. Find d dx emod ¢(n) =1 4. Encryption C=M' modn 5. Decryption M=C" modn

You might also like