Application of RSA
Algorithm in
Secure
Communications
1. Introduction
The RSA (Rivest–Shamir–Adleman) algorithm is a public-key
cryptosystem widely used for secure data transmission It is one of
the most old and robust method of secure communication that
provides a very secure method for communication over not so
very trusted networks. So speaking of secure communications,
RSA plays quite an important role in protocols like SSH (Secure
Shell) and HTTPS (Hypertext Transfer Protocol Secure).
2. Importance
RSA encryption is extremely important for internet messaging as
it provides legitimacy and security. It is used widely in signatures
that are digital , secure communication protocols like SSH and
HTTPS, encrypting email messages, virtual private networks, and
software protection. However, it’s not so often used alone as an
encryption method as it can use too much resources. Though still
it’s importance cannot be underestimated. And it is pretty crucial
in modern encryption technologies.
3. Full Description
RSA is works on two different keys: a public key for encryption
and a private key for decryption .The public key is readily
available to everyone, while the private key is the key that is
remained secret . This asymmetric nature of RSA cryptography
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 case of application of secure communications, RSA is used in
protocols like SSH for the ability to securely access to remote
computers and HTTPS for secure web browsing¹⁶. In both these ,
RSA encryption secures the connection between the client (like a
web browser or an SSH client) and the server, protecting
important information such as login and credit card details.
4. Mathematics
The RSA algorithm relies on the idea that it is hard (both for
computer, supercomputer and human) to factorize a very large
integer. The public key is consisted of two numbers where one
number is basically two large prime numbers multiplied with each
other and the private key is also derived from the same two prime
numbers and so Therefore, the ability to encrypt totally relies on
the key size
5. Numerical Example
Example
Let p=7, q=19
N = p*q = 133
2. φ(n) = (p-1)*(q-1) = 108
3. choose e, Coprime of φ(n), gcd(e,108)=1
E=2 ) gcd(108,2) ≠ 1
E=3 ) gcd(108,3) ≠ 1
E=5 ) gcd(108,5) = 1 ✓
4. Find integer d such that de mod φ(n)=1
K(-13), d=-13+5*22 , d=-13+110 , d=97 ✗
K(-12), d=-12+5*21 , d=-12+105 , d=93 ✗
K(-11), d=-11+5*20 , d=-11+100 , d=89 ✗
K(-10), d=-10+5*19 , d=-10+95 , d=85 ✓
Public Key: n=133, e=5
Secret Key: p=7,q=19,d=85
Encryption:
P = 6 (ASCII – G)
C = P^e mod n = 6^5 mod133
Decryption:
C:62
P:62^d mod n
Msg [31][75][31] -> [62]
6. References
1. RSA Algorithm in Cryptography - GeeksforGeeks
2. RSA (cryptosystem) - Wikipedia
3. RSA Encryption and RSA Algorithm: A Comprehensive
Overview
4. What Is RSA Algorithm in Cryptography and How Does It
Work?
