Documente Academic
Documente Profesional
Documente Cultură
And RSA
BY
VINEETH MATHEW
(1NH02EC059)
Cryptography
Confidentiality
Data integrity
Authentication
Non-repudiation
Terminology
Plaintext: Original intelligible
message
Encryption algorithm: It
performs various
substitutions and
transformations on the plaintext
Key: Is a word that is used to encrypt the plaintext
key
Decryption
Cipher-text Plain-text output
“The quick
“AxCv;5bmEseTfid3)f brown fox
GsmWe#4^,sdgfMwir jumps over
3:dkJeTsY8R\s@!q3 the lazy
%” dog”
Decryption
Algorithm
key
Mathematical Notation
P: plaintext
C: ciphertext
K : key
E: encryption function
D: decryption function
C = Ek(P)
P = Dk(C)
Types of Cryptography
Using Keys
Same key
(shared secret)
Public Key
Cryptography
Public-Key Cryptography
• 1976: W. Diffie and M.E. Hellman
proposed the first public-key
• public-key/asymmetric cryptography
involves the use of two keys:
Different keys
Public Key Cryptography
Public Key Cryptography
Public Key Cryptography
Public Key Cryptography
•Advantage •Disadvantages
Encryption
•Plaintext: M<n
•Ciphertext: C = Me (mod n)
Decryption
•Ciphertext: C
•Plaintext: M = Cd (mod n)
RSA Example
• Select primes: p=17 & q=11
• Compute n = p*q =17×11=187
• Compute ø(n)=(p–1)(q-1)= 16×10=160
• Select e : gcd(e,160)=1; e=7
5 Compute d = e-1 mod φ(n) = 7 -1mod 160
=23
6. Publish public key KU={7,187}
7. Keep secret private key KR= 23
RSA Example
Encryption
C = 887 mod 187 = 11 C = Me (mod n)
Decryption
M = 1123 mod 187 = 88 M = Cd (mod n)
Biblography
Applied Cryptography
- Bruce Schneier
THANK YOU