Secure Communications
Secure Communications
Algorithm in
Secure
Communications
1. Introduction
makes sure that even if a third party does have access to the
public key, they do not have the facilities to decrypt the data so in
The RSA algorithm relies on the idea that it is hard (both for
other and the private key is also derived from the same two prime
Example
N = p*q = 133
E=2 ) gcd(108,2) ≠ 1
E=3 ) gcd(108,3) ≠ 1
E=5 ) gcd(108,5) = 1 ✓
Encryption:
P = 6 (ASCII – G)
Decryption:
C:62
P:62^d mod n
Overview
Work?