ABSTRACT

Cryptography plays a vital role in securing digital communication in today’s

interconnected world, where sensitive information is exchanged across open and
potentially insecure networks. Among various cryptographic techniques, the
RSA algorithm stands out as one of the most widely used and reliable methods
for ensuring data confidentiality, integrity, authentication, and non-repudiation.
RSA is based on asymmetric key cryptography, where encryption and
decryption are performed using a public and a private key. Its security depends
on complex mathematical principles, particularly the difficulty of factoring large
prime numbers. This makes RSA resistant to unauthorized access and suitable
for securing online transactions, digital signatures, secure emails, banking
operations, and SSL/TLS communication on the internet.
This seminar report provides an in-depth study of the RSA algorithm, including
its history, working principle, key generation, encryption and decryption
processes, mathematical foundation, applications, advantages, limitations, and
future challenges—especially the impact of quantum computing. Through
theoretical analysis and structured explanation, the report highlights the
importance of RSA in modern cybersecurity and how it continues to safeguard
digital environments. The findings emphasize that although RSA faces
challenges from emerging technologies, it remains a cornerstone of secure
communication systems worldwide.

CONTENT
1|Page
1. Introduction ........................................................................... 2
2. Objectives of the Study ...................................................... 3
3. Cryptography .......................................................................... 4
4. Types of Cryptography ....................................................... 6
5. History of RSA Algorithm .................................................. 7
6. Importance of RSA Algorithm ............................................ 8
7. Working Principle of RSA .................................................. 9
8. Key Generation Process ..................................................... 11
9. RSA Encryption Process .................................................. 12
10. RSA Decryption Process .................................................. 13
11. Mathematics Behind RSA ............................................... 12
12. Applications of RSA ......... ............................................... 14
13. Advantages of RSA .......................................................... 15
14. Conclusion ............................................................................. 17
15. References ............................................................................. 18

1. INTRODUCTION:

2|Page
  In the modern digital era, communication and data transfer have become
a part of daily life. With increasing dependency on internet-based
platforms—such as mobile banking, online transactions, e-governance
portals, cloud storage systems, and social media—it has become essential
to protect sensitive information from hackers and cybercriminals.
Cryptography provides the mechanism to secure such communication and
ensure that confidential information remains safe even over untrusted
networks.
 Cryptography is the science of converting plain, readable data (plaintext)
into unreadable and scrambled form (ciphertext) using mathematical
algorithms. Only authorized users who possess the correct key can
convert it back to its original form.
 With the development of stronger cryptographic methods, especially
asymmetric cryptography, communication security has reached new
levels. Among all asymmetric algorithms, RSA (Rivest–Shamir–
Adleman) is the most commonly used and trusted public-key
cryptosystem.
 RSA is used in almost all major security systems today, including
SSL/TLS certificates, digital signatures, banking applications, secure
email systems, VPNs, and authentication protocols.
 This report provides a comprehensive study of the RSA Algorithm—its
history, working, mathematical basis, key generation, encryption and
decryption processes, applications, benefits, and future prospects.

2. OBJECTIVES OF THE STUDY:

The main objectives of this seminar report are as follows:
2.1 To understand the fundamentals of cryptography
 Gain a clear understanding of how cryptography works and why it is
needed in information security.
2.2 To differentiate between symmetric and asymmetric encryption
 Explain why RSA belongs to asymmetric encryption and how it improves
security over traditional symmetric methods.
2.3 To study the mathematics behind RSA

3|Page
  Concepts such as prime numbers, modular arithmetic, Euler’s Totient
Function, GCD, and modular exponentiation.
2.4 To explain the step-by-step working principle of RSA Algorithm
 Detailed explanation of key generation, encryption, and decryption.
2.5 To explore real-world applications of RSA
 Its usage in banking, secure websites, digital signatures, and more.
2.6 To analyze the advantages and limitations of RSA
 Understanding why RSA is secure and what risks or performance
limitations exist.
2.7 To discuss the impact of future technologies like quantum computing
 How emerging technology may influence RSA security.

3. CRYPTOGRAPHY:

Cryptography is a core pillar of information security that focuses on protecting

data from unauthorized access, misuse, and alteration. It provides secure
communication techniques that ensure sensitive information can be transmitted
safely, even over untrusted or public networks. With the rapid increase in online
activities such as digital transactions, online shopping, cloud storage, and

4|Page
mobile communication, the importance of cryptography has grown significantly.
Its primary aim is to safeguard data in such a way that even if an attacker
intercepts the information, they cannot read, modify, or misuse it. To achieve
this, modern cryptography follows several essential security goals, including
confidentiality, integrity, authentication, and non-repudiation.
3.1 Confidentiality
Confidentiality ensures that only authorized users can access and understand the
information being transmitted. It protects data from being viewed or leaked to
unauthorized individuals. Even if hackers intercept the data during
transmission, confidentiality ensures they cannot understand it because the
message is encrypted. For example, when we enter an ATM PIN or password on
a website, cryptographic algorithms immediately convert the data into
unreadable cipher text that only the authorized system can decrypt.
Confidentiality is the foundation of secure communication and is crucial for
online banking, personal messaging, and any situation involving sensitive
information.
3.2 Integrity
Integrity ensures that data remains accurate and unaltered throughout the
communication process. During transmission, data may be exposed to various
threats such as tampering, modification, or corruption—either accidentally or
intentionally. Cryptographic techniques such as hashing and digital signatures
detect even the smallest changes in the message. If a single character is
modified, the system immediately identifies the alteration. For example, if a
transaction amount is changed from “₹1000” to “₹10000” during transmission,
integrity verification will detect the difference and prevent the fraudulent action.
Thus, integrity preserves the trustworthiness and correctness of data.
3.3 Authentication
Authentication verifies the identity of the sender and receiver before
communication begins. It ensures that both parties involved in the
communication are genuine and not impersonated by outsiders. This is
especially important in situations where identity plays a crucial role, such as
logging into an email, accessing a banking system, or using a secure
application. Cryptographic methods like passwords, digital certificates, and
OTP-based systems help authenticate users. Without authentication, attackers
could pretend to be legitimate users and gain access to confidential information.
5|Page
3.4 Non-Repudiation
Non-repudiation ensures that a sender cannot deny sending a particular message
or performing a specific action. This is extremely important in digital
transactions, legal documentation, and financial agreements. Cryptographic
tools like digital signatures provide proof of origin, meaning they confirm who
sent the message and at what time. Once a sender digitally signs a document,
they cannot later claim that they did not send it. This establishes accountability
and prevents disputes in digital environments.

4. TYPES OF CRYPTOGRAPHY:
Cryptography can be categorized mainly into:
4.1 Symmetric Key Cryptography (Private Key Encryption)
Definition:
In symmetric encryption, the same key is used for both encryption and
decryption.
Example:
If A sends a message to B, both A and B must use the same secret key.
Characteristics:
 Very fast
 Suitable for large data
 Key distribution is a challenge
 If key leaks, full system is compromised
Examples:
DES, AES, Blowfish, Twofish, RC4.
4.2 Asymmetric Key Cryptography (Public Key Encryption)
Definition:
Uses two different keys:
 Public Key → shared with everyone
 Private Key → kept secret by the owner

6|Page
If A wants to send a message to B:
 A uses B’s Public Key to encrypt
 B uses his Private Key to decrypt
Characteristics:
 Very secure
 Eliminates the problem of key sharing
 Slow compared to symmetric algorithms
 Ideal for authentication and secure key exchange
Examples:
RSA, ECC, Diffie–Hellman, ElGamal
RSA is the oldest, strongest, and the most widely used asymmetric algorithm.

5. HISTORY OF RSA ALGORITHM:

The RSA algorithm was invented in 1977 by three MIT scientists:
✔ Ron Rivest
✔ Adi Shamir
✔ Leonard Adleman
The initials of their surnames form the name RSA.
Historical Background:
 In 1976, Diffie and Hellman introduced the concept of public-key
cryptography.
 Inspired by this, Rivest, Shamir, and Adleman created RSA.
 It was first published in 1978.
 Early RSA keys were small (256 or 512 bits), but now 2048-bit and
4096-bit keys are standard.
 Today RSA is used in almost every digital security system.

7|Page
6. WHY RSA IS IMPORTANT:
 RSA is considered one of the most important and widely used
cryptographic algorithms in the world because it provides a highly secure
method of protecting information in digital communication. In today’s
environment, where sensitive data is continuously exchanged over public
and insecure networks such as the internet, RSA plays a crucial role in
ensuring that this information does not fall into the hands of unauthorized
individuals. One of the main reasons RSA is important is because it
enables secure communication even when the channel used for
transmission is insecure. When data is encrypted using RSA, it becomes
extremely difficult for hackers or attackers to decode it, as only the
person holding the corresponding private key can decrypt and understand
the message. This makes RSA a reliable foundation for secure data
exchange in applications such as online banking, secure emails, and
confidential transactions.
 Another reason for the importance of RSA is that it eliminates the
traditional problem of secret key sharing. In older cryptographic methods
like symmetric encryption, the same key is used for both encryption and
decryption, and this key had to be shared secretly between the sender and
receiver. If the key was intercepted during transmission, the entire
communication could be compromised. RSA solves this problem by
using two different keys—a public key for encryption and a private key
for decryption. The public key can be openly shared with anyone, while
the private key remains confidential. This unique property prevents key
leakage and makes RSA highly secure for large-scale communication
systems.
 Further, RSA is important because it supports not only encryption but
also digital signatures. A digital signature is used to verify the identity of
the sender and ensure that the message has not been altered during
transmission. This makes RSA extremely valuable in authentication,
online document signing, software verification, and legal
communications. When a sender signs a message using their private key,
the receiver can verify the authenticity using the sender’s public key,
proving that the message came from the right person.
 The strength of RSA also lies in its mathematical foundation. RSA
security depends on the difficulty of factoring very large numbers into
prime components. Modern RSA systems use key sizes like 2048 bits or
8|Page
 4096 bits, which make factoring practically impossible with current
technology. This strong mathematical base gives RSA long-term security
and reliability.
 Because of these reasons, RSA is used in almost every major secure
system today. It is used in SSL/TLS certificates to secure websites, in
banking applications to protect transactions, in Aadhaar and government
systems for secure data handling, and in VPNs for safe remote
connections. Overall, RSA remains a cornerstone of modern
cybersecurity and continues to be one of the most trusted methods for
securing digital information.

7. WORKING PRINCIPLE OF RSA:

 The working principle of the RSA algorithm is based on strong
mathematical concepts that make it one of the most secure and widely
used encryption methods in the world. RSA primarily depends on the use
of large prime numbers, modular arithmetic, and the computational
difficulty of factoring extremely large numbers. The entire security of
RSA revolves around the idea that while it is easy to multiply two large
prime numbers together, it is extremely difficult and time-consuming to
determine the original prime numbers if only the product is known. This
difficulty forms the backbone of RSA and ensures that the system
remains secure even when the public key is openly available to everyone.
The process begins with the selection of two very large prime numbers,
usually hundreds of digits long. These primes are multiplied to form a
number known as “n,” which becomes a part of both the public key and
the private key. Although n is made public, the actual prime numbers used
to generate it remain secret because knowing them would allow anyone to
break the encryption.
 The second mathematical foundation behind RSA is modular arithmetic,
which deals with operations performed within a fixed number range.
Encryption and decryption in RSA involve raising numbers to very large
powers and then taking the remainder after division by n. These
operations seem complex, but they are designed in such a way that the
sender can easily encrypt the message using the public key, while only
the intended recipient, who holds the private key, can decrypt it. This

9|Page
 ensures confidentiality even when the communication takes place over
vulnerable networks.
 After selecting the primes and computing n, the next step is generating
the public key and the private key. The public key consists of two values,
usually represented as (e, n), where e is a number chosen such that it has
a special mathematical relationship with the private key. This public key
is shared openly and can be used by anyone to encrypt data. The private
key, represented as (d, n), is carefully computed using the prime numbers
selected earlier. The private key is kept secret and is used only by the
intended receiver to decrypt the message.
 In the actual communication process, a sender converts the plaintext
message into numerical form and applies the RSA encryption function
using the public key. This transforms the plaintext into ciphertext, which
appears completely random and unreadable. When the receiver gets the
ciphertext, they apply the RSA decryption function using their private
key. Because the private key is mathematically linked to the public key
through the original prime numbers, it can successfully recover the
original plaintext. This combination of mathematical complexity, secure
key generation, and reliable encryption-decryption operation makes the
RSA working principle both effective and highly secure.

8. key generation process:

The RSA key generation process is the foundation of the entire algorithm
because it creates the pair of keys that will be used for encryption and
decryption. The security of RSA mainly depends on how these keys are
generated and how difficult it is for an attacker to reverse the process. The first
step in RSA key generation is selecting two very large prime numbers. These
primes must be random, unpredictable, and sufficiently large because weak or
small primes make the algorithm vulnerable. After selecting the primes, they are
multiplied to form a composite number known as n, which becomes a part of
both the public key and private key. The size of n directly determines the
strength of RSA, and modern systems often use 2048-bit or 4096-bit values to
ensure strong protection.
Once n is computed, the next step is calculating Euler’s Totient Function,
written as φ(n). For two primes p and q, φ(n) = (p − 1)(q − 1). This value is used

10 | P a g e
to determine the encryption and decryption exponents. After this, a value e is
selected such that it is greater than 1 and less than φ(n), and it does not share
any common factors with φ(n). The number e becomes the public exponent,
which is used for encrypting messages and is generally a small number like
65537 for fast processing.
Some short points about e:
• It must be coprime with φ(n)
• It is openly shared
• Used to encrypt data
After selecting e, the next step is determining the private exponent d. This value
is chosen so that the equation (e × d) mod φ(n) = 1 holds true. Only the user
generating the keys can calculate d because it requires knowing the original
primes p and q. Thus, the private key remains secure. The key generation
process ends by creating the two keys:
• Public Key → (e, n)
• Private Key → (d, n)
These keys work together in such a way that a message encrypted with the
public key can be decrypted only with the private key. This makes RSA a secure
and powerful cryptographic system.

9. RSA ENCRYPTION PROCESS:

The RSA encryption process is the step where a readable message is converted
into an unreadable ciphertext to ensure secure communication. Encryption
guarantees that even if a hacker intercepts the data, it will appear like
meaningless random characters. The encryption process begins when the sender
takes the original message and converts it into numerical form because RSA
operates mathematically on numbers rather than text. This conversion is usually
done using standard encoding schemes such as ASCII or UTF-8. Once the
message is converted, the sender uses the recipient’s public key, which is freely
available and can be shared with anyone, to encrypt the data. Because the public
key contains the values e and n, the encryption function applies modular
exponentiation on the numerical message using these values. This process
produces a ciphertext that appears completely random, but it is structured in
such a way that only the receiver’s private key can reverse it.

11 | P a g e
Some short points about the encryption basics:
• Encryption uses the public key (e, n)
• The plaintext is converted into numeric blocks
• Ciphertext looks random and unreadable
• Only the correct private key can decode it
During encryption, the sender does not need any secret information from the
receiver. The public key alone is sufficient to encrypt the message, which makes
RSA efficient and secure for open communication. Even if many users know the
public key, no one can decrypt the encrypted message without the private key.
This ensures confidentiality and protects the message from unauthorized access.
The mathematical difficulty of reversing modular exponentiation without the
private key is what makes RSA secure. Additionally, the encryption process
ensures that even if the ciphertext is intercepted, it cannot be modified without
detection because altering encrypted values will result in corrupted data after
decryption.
Another important aspect of RSA encryption is its ability to support hybrid
encryption. Since RSA is slower for large data, it is often used to encrypt only a
small secret key, while that key is used to encrypt the actual data using a fast
symmetric algorithm like AES. This combination gives the best of both worlds:
RSA provides secure key exchange, while symmetric encryption provides fast
data protection. Overall, the RSA encryption process plays a vital role in
safeguarding communication and forms the backbone of many secure
communication systems on the internet.

10. RSA DECRYPTION PROCESS:

The RSA decryption process is the reverse operation of encryption and is used
by the receiver to convert the unreadable ciphertext back into the original
plaintext message. Decryption requires the use of the private key, which is
known only to the intended recipient and never shared publicly. When the
receiver obtains the ciphertext, they apply the RSA decryption function, which
uses the values d and n from the private key. Just like encryption, the decryption
process involves modular exponentiation, but this time the operation reverses
the transformation applied during encryption. Due to the mathematical
properties of RSA, ciphertext raised to the power of the private exponent d

12 | P a g e
modulo n will always produce the original plaintext, as long as the correct key
is used.
Some short points about decryption:
• Decryption uses the private key (d, n)
• Private key must remain secret
• It reverses the public key encryption
• Only the owner of the private key can decrypt
The security of the decryption process relies on the fact that calculating the
private key from the public key is nearly impossible. While the public key is
shared openly, the private key remains hidden and is derived using the prime
factors selected during key generation. Without knowing these prime numbers,
an attacker would find it extremely difficult to compute the private key due to
the complexity of factoring large integers. Once the mathematical decryption is
completed, the resulting number is converted back into readable text using the
same encoding system used during encryption.
The RSA decryption process is stable, predictable, and mathematically
guaranteed to recover the exact original message, provided no one tampers with
the ciphertext. This reliability makes RSA suitable for applications where
accuracy and integrity are essential, such as financial transactions, government
communication, and corporate data exchange. Decryption also enables digital
signatures because a signature created with the private key can be verified using
the public key, ensuring authenticity and non-repudiation. Overall, the RSA
decryption process is an essential part of secure communication systems that
guarantees data privacy and protects against unauthorized access.

11. Mathematics behind rsa:

The mathematics behind RSA is what makes the algorithm both powerful and
secure. RSA relies heavily on number theory, particularly the use of prime
numbers, modular arithmetic, and the difficulty of factoring large integers. At
the core of RSA is the idea that multiplying two large primes is computationally
easy, but reversing the process—factoring the resulting product back into those
original primes—is extremely difficult with current technology. This
mathematical challenge forms what is called a “one-way function,” meaning it
is easy to perform in one direction but nearly impossible to reverse without

13 | P a g e
special knowledge. RSA takes advantage of this property by generating a
composite number n from two very large primes. The larger the primes and the
larger the value of n, the stronger the security. In fact, modern RSA keys are
typically 2048 bits or even 4096 bits long because smaller key sizes may
become vulnerable to advanced attacks.
Some short points about RSA mathematics:
• Based on large prime numbers
• Relies on modular arithmetic
• Factoring n is extremely difficult
• Uses Euler’s Totient Function
Another mathematical component in RSA is Euler’s Totient Function, φ(n),
which measures how many numbers less than n are relatively prime to it. For
RSA, φ(n) plays a critical role in generating the public and private exponents.
Modular exponentiation is also essential in RSA. This process allows extremely
large exponential operations to be performed efficiently within a limited number
range. This enables both encryption and decryption to work smoothly without
processing impossibly large values. Furthermore, RSA relies on the principle
that modular arithmetic behaves predictably when combined with
exponentiation and prime number relationships. These properties allow RSA to
create a secure trapdoor function, meaning one direction is easy for anyone to
compute, while the reverse direction is only possible if the person has the
private key. Overall, the mathematics behind RSA forms a strong foundation
that ensures the algorithm remains secure, reliable, and suitable for protecting
sensitive digital information.

12. Applications of RSA:

RSA is widely used in modern digital systems because it provides strong
security through public-key encryption and digital signatures. One of the most
common applications of RSA is in securing websites through SSL/TLS
certificates. Whenever a user visits a secure website, RSA helps establish an
encrypted connection between the browser and the server, ensuring that
information such as login details or payment data cannot be intercepted by
attackers. RSA is also used extensively in email encryption. Applications like
PGP and GPG rely on RSA keys to protect the contents of emails from

14 | P a g e
unauthorized access. This allows users to exchange confidential messages safely
over an open network.
Some short points about RSA applications:
• Used in SSL/TLS for secure websites
• Protects email communication
• Used in digital signatures
• Applied in banking and secure transactions
Another important application of RSA is digital signatures, which verify the
authenticity and integrity of a message or document. Digital signatures ensure
that the sender cannot deny sending the message and that the message has not
been altered. This is crucial in legal, governmental, and financial
communication systems where trust and accuracy are essential. RSA is also
used in banking applications to secure transactions and protect sensitive
information like account details and authentication data. In Virtual Private
Networks (VPNs), RSA helps securely exchange keys for establishing
encrypted tunnels between remote devices and central servers.
RSA is also used in secure file transfer, software updates, encrypted messaging
apps, and identity verification systems. In many systems, RSA is used in
combination with symmetric encryption to achieve both security and high
performance. RSA encrypts only the keys, while symmetric algorithms like AES
encrypt large data. This hybrid approach is widely used and highly effective.
Overall, RSA’s applications are diverse and essential for maintaining security,
privacy, and trust in the digital world.

13. Advantages of RSA:

RSA offers several advantages that have made it one of the most trusted
encryption algorithms in the world. One of the biggest advantages is that RSA
does not require the sender and receiver to share a secret key in advance. This
eliminates the risk of key interception, which is a major weakness in symmetric
encryption. With RSA, the public key is openly distributed while the private key
remains secure with the user. This makes RSA ideal for open environments like
the internet where secure key exchange is challenging. Another significant
advantage is that RSA supports both encryption and digital signatures. This dual
functionality allows RSA to ensure confidentiality, authentication, integrity, and

15 | P a g e
non-repudiation all in one algorithm, making it extremely versatile for different
security applications.
Some short points of RSA advantages:
• No need for private key sharing
• Supports digital signatures
• High security with large keys
• Suitable for open networks
Another advantage is the strong mathematical foundation that makes RSA
secure. The difficulty of factoring large prime numbers means that RSA remains
safe against brute-force attacks. RSA keys of 2048 bits or higher are considered
extremely secure with current computing capabilities. Additionally, RSA is
widely used and supported across various platforms, operating systems,
browsers, and applications. This universal acceptance makes it easy to integrate
into existing communication systems. RSA also works efficiently when used for
encrypting small pieces of data, such as session keys, enabling hybrid
encryption systems that combine the strengths of RSA and symmetric
algorithms. Overall, RSA’s advantages make it a reliable and essential
component of modern cybersecurity.

CONCLUSION:
RSA is one of the most significant and influential cryptographic algorithms in
the history of digital security. Its introduction revolutionized the way
communication is secured on the internet by allowing users to exchange

16 | P a g e
information safely without needing a shared secret key. The algorithm’s strength
lies in its mathematical foundation, particularly the difficulty of factoring large
prime numbers. RSA provides essential security services, including
confidentiality, authentication, integrity, and non-repudiation. Through its use in
encryption and digital signatures, RSA forms the backbone of secure systems
such as online banking, secure websites, email communication, financial
networks, VPNs, and governmental data protection infrastructures. Its
widespread adoption across different sectors demonstrates its reliability and
effectiveness.
Although RSA offers many benefits, it is also important to recognize its
limitations. The algorithm is computationally intensive and slower compared to
symmetric encryption methods. It also requires large key sizes to remain secure
as computing power grows. Additionally, the rise of quantum computing
presents a potential threat because quantum algorithms may eventually break
RSA’s mathematical barrier. Despite these challenges, RSA continues to play a
central role in cybersecurity today. Researchers and organizations are working
on post-quantum solutions, but until quantum computers become fully capable,
RSA remains safe, practical, and highly effective. Overall, RSA has proven to
be a dependable and robust cryptographic system that significantly enhances the
security of digital communication worldwide.

REFERENCES

1. Rivest, R., Shamir, A., & Adleman, L. “A Method for Obtaining Digital
Signatures and Public-Key Cryptosystems,” Communications of the
ACM, 1978.
17 | P a g e
2. William Stallings, “Cryptography and Network Security: Principles and
Practice,” Pearson Education.
3. Bruce Schneier, “Applied Cryptography: Protocols, Algorithms, and
Source Code in C,” Wiley Publications.
4. NIST (National Institute of Standards and Technology) Cryptographic
Guidelines.
5. TutorialsPoint, “RSA Algorithm – Explanation and Implementation.”
6. GeeksforGeeks, “Introduction to RSA Algorithm.”
7. MIT Lecture Notes on RSA and Public-Key Cryptography.
8. Various online cryptographic forums and research papers discussing RSA
security and key generation methods.

18 | P a g e